-
DISPONIBILITÀ IMMEDIATA
{{/disponibilitaBox}}
-
{{speseGratisLibroBox}}
{{/noEbook}}
{{^noEbook}}
-
Libro
-
- Genere: Libro
- Lingua: Inglese
- Editore: Springer
- Pubblicazione: 10/2011
- Edizione: Softcover reprint of the original 1st ed. 1993
Graph Theory and Sparse Matrix Computation
george alan (curatore); gilbert john r. (curatore); liu joseph w.h. (curatore)
108,98 €
103,53 €
{{{disponibilita}}}
SOMMARIO
An introduction to chordal graphs and clique trees.- Cutting down on fill using nested dissection: Provably good elimination orderings.- Automatic Mesh Partitioning.- Structural representations of Schur complements in sparse matrices.- Irreducibility and primitivity of Perron complements: Application of the compressed directed graph.- Predicting structure in nonsymmetric sparse matrix factorizations.- Highly parallel sparse triangular solution.- The fan-both family of column-based distributed Cholesky factorization algorithms.- Scalability of sparse direct solvers.- Sparse matrix factorization on SIMD parallel computers.- The efficient parallel iterative solution of large sparse linear systems.ALTRE INFORMAZIONI
- Condizione: Nuovo
- ISBN: 9781461383710
- Collana: The IMA Volumes in Mathematics and its Applications
- Dimensioni: 235 x 155 mm Ø 406 gr
- Formato: Brossura
- Illustration Notes: 245 p.
- Pagine Arabe: 245