Graph Theory and Sparse Matrix Computation

George, Alan & John R. Gilbert & Joseph W. H. Liu

ISBN 10: 0387941312 / ISBN 13: 9780387941318

Editore: Springer, 1993

Riguardo questo articolo

Still shrinkwrapped; The IMA Volumes In Mathematics And Its Applications; 8vo 8" - 9" tall; 245 pages. Codice articolo 205949

Dati bibliografici

Titolo: Graph Theory and Sparse Matrix Computation

Casa editrice: Springer

Data di pubblicazione: 1993

Legatura: Hardcover

Condizione: As New

Condizione sovraccoperta: No Dust Jacket As Issued

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.