Graph Theory and Sparse Matrix Computation

Alan George, John R. Gilbert, Joseph W.H. Liu (Herausgeber)

Buch | Softcover

245 Seiten

2011 | Softcover reprint of the original 1st ed. 1993
Springer-Verlag New York Inc.
978-1-4613-8371-0 (ISBN)

Artikel merken

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.

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.

Reihe/Serie	The IMA Volumes in Mathematics and its Applications ; 56
Zusatzinfo	245 p.
Verlagsort	New York, NY
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie
	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	1-4613-8371-4 / 1461383714
ISBN-13	978-1-4613-8371-0 / 9781461383710
Zustand	Neuware