Graph Theory and Sparse Matrix Computation
Published on 24. October 2011
Book
Paperback/Softback
245 pages
978-1-4613-8371-0 (ISBN)
Description
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.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1993
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
245 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
406 gr
ISBN-13
978-1-4613-8371-0 (9781461383710)
DOI
10.1007/978-1-4613-8369-7
Schweitzer Classification
Other editions
Additional editions
Alan George | John R. Gilbert | Joseph W.H. Liu
Graph Theory and Sparse Matrix Computation
Workshop on Sparse Matrix Computations: Graph Theory Issues and Algorithms : Selected Papers
Book
10/1993
Springer
€85.55
Article exhausted; check different version
Content
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.