Graph Theory and Sparse Matrix Computation

Alan George

ISBN 10: 1461383714 / ISBN 13: 9781461383710

Editore: Springer-Verlag New York Inc., 2011

Riguardo questo articolo

This item is printed on demand. New copy - Usually dispatched within 5-9 working days 405. Codice articolo C9781461383710

Dati bibliografici

Titolo: Graph Theory and Sparse Matrix Computation

Casa editrice: Springer-Verlag New York Inc.

Data di pubblicazione: 2011

Legatura: Paperback / softback

Condizione: New

Descrizione articolo

Riassunto:

This book looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysis and theoretical computer scientists alike.

Contenuti:

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.