Articoli correlati a Algorithms for Sparse Linear Systems
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 43,57
GRATIS per la spedizione da U.S.A. a Italia
Destinazione, tempi e costi
Risultati della ricerca per Algorithms for Sparse Linear Systems
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-261362
Quantità: 3 disponibili
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo ABNR-13593
Quantità: 1 disponibili
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: SMASS Sellers, IRVING, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. Codice articolo ASNT3-13593
Quantità: 1 disponibili
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 26395357427
Quantità: 1 disponibili
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 18395357433
Quantità: 1 disponibili
Immagini fornite dal venditore
Algorithms for Sparse Linear Systems
Editore:
Springer International Publishing, 2023
ISBN 10: 3031258193
ISBN 13: 9783031258190
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 784365061
Quantità: Più di 20 disponibili
Foto dell'editore
Algorithms for Sparse Linear Systems
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 401019692
Quantità: 1 disponibili
Foto dell'editore
ALGORITHMS FOR SPARSE LINEAR SYSTEMS
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-297041
Quantità: 1 disponibili
Immagini fornite dal venditore
Algorithms for Sparse Linear Systems
Editore:
Springer International Publishing Apr 2023, 2023
ISBN 10: 3031258193
ISBN 13: 9783031258190
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 264 pp. Englisch. Codice articolo 9783031258190
Quantità: 2 disponibili
Immagini fornite dal venditore
Algorithms for Sparse Linear Systems
Editore:
Springer International Publishing, 2023
ISBN 10: 3031258193
ISBN 13: 9783031258190
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9783031258190
Quantità: 1 disponibili