Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 5.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Algorithms for Sparse Linear Systems

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

Scott Jennifer Scott

Tuma Miroslav Tuma

Lingua

Inglese

Libro In brossura

Codice Libristo: 43417915

Casa editrice Springer Nature B.V., maggio 2023

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

Codice Libristo: 43417915

151 b

61.89 €

Magazzino esterno Inviamo tra 10-18 giorni

30 giorni per il reso

I clienti hanno acquistato anche

Iterative Methods for Sparse Linear Systems Yousef Saad

In brossura

141.99 €

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Gioco/giocattolo

Giocattolo

76.79 €

Monster High POP! Vinyl Figure Skelita 9 cm Gioco/giocattolo

Giocattolo

21.39 €

Lo spazio del teatro Fabrizio Cruciani

In brossura

23.49 €

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

In brossura

47.99 €

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.