Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € SPS 3.99 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Pošta 3.99 € Zberné miesto DPD 2.99 € Zberné miesto DPD 0.00 € Kuriér GLS 3.99 € Zberné miesto GLS 2.49 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Algorithms for Sparse Linear Systems

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

Scott Jennifer Scott

Tuma Miroslav Tuma

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 43417915

Nakladateľstvo Springer Nature B.V., máj 2023

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

Libristo kód: 43417915

138 b

57.01 €

Skladom u dodávateľa Odosielame za 10-18 dní

30 dní na vrátenie tovaru

Zákazníci tiež kúpili

Iterative Methods for Sparse Linear Systems Yousef Saad

Brožovaná

136.62 €

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

Hračka

77.78 €

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

Hračka

21.66 €

Lo spazio del teatro Fabrizio Cruciani

Brožovaná

22.68 €

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

Brožovaná

44.15 €

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.