Graph Theory and Sparse Matrix Computation [electronic resource] /

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.

Bibliographic Details

Main Authors:	George, Alan. editor., Gilbert, John R. editor., Liu, Joseph W. H. editor., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	New York, NY : Springer New York, 1993
Subjects:	Mathematics., Numerical analysis., Combinatorics., Numerical Analysis.,
Online Access:	http://dx.doi.org/10.1007/978-1-4613-8369-7
Tags:	Add Tag No Tags, Be the first to tag this record!