Doprava zdarma při nákupu nad 1 499 Kč přes Zásilkovnu nebo PPL Box.

Zjistit stav objednávky

Staňte se součástí komunity milovníků knih z celého světa a získejte hromadu výhod. Založit účet zdarma

Doprava zdarma se Zásilkovnou nad 1 499 Kč

Kurýr DPD 69 Kč PPL shop 49 Kč Balíkovna 69 Kč PPL kurýr 74 Kč PPL box 39 Kč Balíkovna 49 Kč Výdejní místo DPD 49 Kč Zásilkovna 39 Kč

Kontakt

Jak nakupovat

Pomoc

Můj účet

▸ Prázdný :-(

Doprava zdarma při nákupu nad 1 499 Kč přes Zásilkovnu nebo PPL Box.

Algorithms for Sparse Linear Systems

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

Scott Jennifer Scott

Tuma Miroslav Tuma

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 43417915

Nakladatelství Springer Nature B.V., květen 2023

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This ope... Celý popis

Libristo kód: 43417915

131 b

Top

1 309 Kč

Skladem u dodavatele Odesíláme za 10-18 dnů

30 dní na vrácení zboží

Zákazníci také koupili

Iterative Methods for Sparse Linear Systems Yousef Saad

Brožovaná

3 304 Kč

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Hra/Hračka

Hračka

1 880 Kč

Monster High POP! Vinyl Figure Skelita 9 cm Hra/Hračka

Hračka

523 Kč

Lo spazio del teatro Fabrizio Cruciani

Brožovaná

549 Kč

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

Brožovaná

1 014 Kč

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.