Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Algorithms for Sparse Linear Systems

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

Scott Jennifer Scott

Tuma Miroslav Tuma

Language

English

Book Paperback

Libristo code: 43417915

Publishers Springer Nature B.V., May 2023

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This ope... Full description

Libristo code: 43417915

145 b

21 235 Ft

In stock at our supplier Shipping in 10-18 days

30-day return policy

Customers also purchased

Iterative Methods for Sparse Linear Systems Yousef Saad

Paperback

48 452 Ft

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Game/Toy

Toy

27 588 Ft

Monster High POP! Vinyl Figure Skelita 9 cm Game/Toy

Toy

7 672 Ft

Lo spazio del teatro Fabrizio Cruciani

Paperback

8 056 Ft

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

Paperback

16 436 Ft

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.