Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba 3.49 € Zbirno mesto 3.49 € Zbirno mesto 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

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

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 43417915

Založba Springer Nature B.V., maj 2023

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

Koda Libristo: 43417915

138 b

57.01 €

Na zalogi pri dobavitelju Odposlali bomo v 10-18 dneh

30 dni za vračilo blaga

Drugi so kupili tudi

Iterative Methods for Sparse Linear Systems Yousef Saad

Mehka

122.34 €

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Igra/Igrača

Igrača

77.78 €

Monster High POP! Vinyl Figure Skelita 9 cm Igra/Igrača

Igrača

21.66 €

Lo spazio del teatro Fabrizio Cruciani

Mehka

20.45 €

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

Mehka

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.