Articles liés à Algorithms for Sparse Linear Systems
Synopsis
Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines.
This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Jennifer Scott is a Professor of Mathematics at the University of Reading and an Individual Merit Research Fellow at the Rutherford Appleton Laboratory. She is a SIAM Fellow and a Fellow of the Institute of Mathematics and its Applications. She is the author of many widely used sparse matrix packages that are available as part of the HSL Mathematical Software Library.
Miroslav Tuma is a Professor and Head of the Department of Numerical Mathematics at Charles University and was formerly a Professor at the Institute of Computer Science of the Academy of Sciences of the Czech Republic. His research has included important contributions to the development of algebraic preconditioners for iterative solvers. He was the recipient of a SIAM outstanding paper prize for his work on sparse approximate inverse preconditioners.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 43,06
Gratuit expédition depuis Etats-Unis vers France
Destinations, frais et délais
Résultats de recherche pour Algorithms for Sparse Linear Systems
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-13593
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : SMASS Sellers, IRVING, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. N° de réf. du vendeur ASNT3-13593
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-261362
Quantité disponible : 3 disponible(s)
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26395357427
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 18395357433
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Algorithms for Sparse Linear Systems
Edité par
Springer International Publishing, 2023
ISBN 10 : 3031258193
ISBN 13 : 9783031258190
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book is open access, which means that you have free and unlimited access This monograph presents factorization algorithms for solving large sparse linear systems of equationsIt unifies the study of direct methods and algebraic precondi. N° de réf. du vendeur 784365061
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithms for Sparse Linear Systems
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 401019692
Quantité disponible : 1 disponible(s)
Image d'archives
ALGORITHMS FOR SPARSE LINEAR SYSTEMS
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-297041
Quantité disponible : 1 disponible(s)
Image d'archives
Algorithms for Sparse Linear Systems (Ne?as Center Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783031258190_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithms for Sparse Linear Systems
Edité par
Springer International Publishing, 2023
ISBN 10 : 3031258193
ISBN 13 : 9783031258190
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Large sparse linear systems of equations are ubiquitous inscience, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses thecomputation of approximatedirect and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines.This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics. N° de réf. du vendeur 9783031258190
Quantité disponible : 1 disponible(s)