Efficient Methods for Out-of-Core Sparse Cholesky Factorization

DOI10.1137/S1064827597322975MaRDI QIDQ4702375zbMATH OpenFDO

Authors Edward Rothberg, Robert Schreiber

Publication date 24 November 1999

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1064827597322975

zbMATH Keywords

Cholesky factorizationout-of-core methodssparse matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Computer aspects of numerical algorithms (65Y99)

Recommendations

• A refined subspace iteration algorithm for large sparse eigenproblems
• The design and implementation of a new out-of-core sparse cholesky factorization method
• An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
• An out-of-core sparse symmetric-indefinite factorization method
• scientific article; zbMATH DE number 4117735

Cited in

(7)

• Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
• Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
• A Cholesky out-of-core factorization
• IPM based sparse LP solver on a heterogeneous processor
• A survey of direct methods for sparse linear systems
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• Analysis of the solution phase of a parallel multifrontal approach

This page was built for publication: Efficient Methods for Out-of-Core Sparse Cholesky Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702375)