ALGORITHMS FOR SPARSE LINEAR SYSTEMS

Scott, Jennifer; T?ma, Miroslav

ISBN 10: 3031258193 ISBN 13: 9783031258190
Editore: Birkhäuser, 2023
Nuovi Brossura

Da Romtrade Corp., STERLING HEIGHTS, MI, U.S.A. Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Venditore AbeBooks dal 17 aprile 2013

Questo articolo specifico non è più disponibile.

Riguardo questo articolo

Descrizione:

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 ABBB-241210

Segnala questo articolo

Riassunto:

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. 

Informazioni sull'autore: ?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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Dati bibliografici

Titolo: ALGORITHMS FOR SPARSE LINEAR SYSTEMS
Casa editrice: Birkhäuser
Data di pubblicazione: 2023
Legatura: Brossura
Condizione: New

I migliori risultati di ricerca su AbeBooks

Vedi altre 3 copie di questo libro

Vedi tutti i risultati per questo libro