A compact row storage scheme for Cholesky factors using elimination trees

DOI10.1145/6497.6499zbMath0605.65015OpenAlexW2046020107WikidataQ111899472 ScholiaQ111899472MaRDI QIDQ3742603

Joseph W. H. Liu

Publication date: 1986

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1986-12/

zbMATH Keywords

Cholesky factorizationComparisonelimination treesrow structuresymmetric positive definite sparse matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (17)

Efficient Solution of a Sparse Non-symmetric System of Linear Equations ⋮ Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ Solution of sparse positive definite systems on a hypercube ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ An Application of Generalized Tree Pebbling to Sparse Matrix Factorization ⋮ Fast separator decomposition for finite element meshes ⋮ Task scheduling for parallel sparse Cholesky factorization ⋮ Sparse matrix representations in a functional language ⋮ A survey of direct methods for sparse linear systems ⋮ Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Refining an approximate inverse ⋮ Improving parallel ordering of sparse matrices using genetic algorithms ⋮ A parallel interior point algorithm for linear programming on a network of transputers ⋮ On constructing the elimination tree ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems ⋮ \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems

This page was built for publication: A compact row storage scheme for Cholesky factors using elimination trees