- Main Menu-

Catalogue Tag Display

MARC 21

Graph Theory and Sparse Matrix Computation
Tag	Description
020	$a9781461383697$9978-1-4613-8369-7
082	$a511.6$223
099	$aOnline resource: Springer
245	$aGraph Theory and Sparse Matrix Computation$h[EBook] /$cedited by Alan George, John R. Gilbert, Joseph W. H. Liu.
260	$aNew York, NY :$bSpringer New York,$c1993.
300	$a245 p.$bonline resource.
336	$atext$btxt$2rdacontent
337	$acomputer$bc$2rdamedia
338	$aonline resource$bcr$2rdacarrier
440	$aThe IMA Volumes in Mathematics and its Applications,$x0940-6573 ;$v56
505	$aAn 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.
538	$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700	$aGeorge, Alan.$eeditor.
700	$aGilbert, John R.$eeditor.
700	$aLiu, Joseph W. H.$eeditor.
710	$aSpringerLink (Online service)
830	$aThe IMA Volumes in Mathematics and its Applications,$x0940-6573 ;$v56
856	$uhttp://dx.doi.org/10.1007/978-1-4613-8369-7