Envío gratis a partir de 69,99 euros.

«Comprobar estado del pedido»

Entre a formar parte de una comunidad de amantes de los libros del mundo entero y acceda a un sinfín de ventajas. Crear una cuenta gratis

Envío gratuito con Zásilkovna para compras superiores a 59.99 €

Mensajería SEUR 4.99 € Mensajería GLS 7.99 € Mensajería Correos 5.49 € Mensajería DHL 5.49 € Punto SEUR 3.99 €

Contacto

Cómo comprar

Ayuda

Mi cuenta

▸ Vacío :-(

Envío gratis a partir de 69,99 euros.

Algorithms for Sparse Linear Systems

Name: Algorithms for Sparse Linear Systems
Brand: Springer Nature B.V.
SKU: 43417915
Price: 62.99 EUR
Availability: InStock
Author: Scott Jennifer Scott
ISBN: 9783031258213

Scott Jennifer Scott

Tuma Miroslav Tuma

Idioma

Inglés

Libro Tapa blanda

Código Libristo: 43417915

Editores Springer Nature B.V., mayo 2023

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This ope... Descripción completa

Código Libristo: 43417915

154 b

Popular

62.99 €

Almacenamiento externo Envío en 10-18 días

Política de devolución de 30 días

Clientes que también han comprado

Iterative Methods for Sparse Linear Systems Yousef Saad

Tapa blanda

144.99 €

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Juego/Juguete

Juguete

76.79 €

Monster High POP! Vinyl Figure Skelita 9 cm Juego/Juguete

Juguete

21.39 €

Lo spazio del teatro Fabrizio Cruciani

Tapa blanda

23.99 €

Memoires, Correspondance Et Manuscrits Du General La Fayette. T6 (Ed.1837-1838) Gilbert Du Motier La Fayette

Tapa blanda

48.79 €

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.