General Sparse Elimination Requires No Permanent Integer Storage

DOI10.1137/0908052MaRDI QIDQ3759803zbMATH OpenOpenAlexFDO

Authors Randolph E. Bank, R. Kent Smith

Publication date 1987

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

Full work available at URL https://semanticscholar.org/paper/e5062221feaa115ef7bec64db83df8c876a4d5fb

zbMATH Keywords

sparse Gaussian eliminationFORTRAN implementationsymbolic factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Recommendations

• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• Parallel sparse Gaussian elimination with partial pivoting
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• A generalized Sylvester identity and fraction-free random Gaussian elimination
• scientific article; zbMATH DE number 3852305

Cited in

(5)

• A survey of direct methods for sparse linear systems
• A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• Sparse matrix multiplication package (SMMP)
• Exactly solving sparse rational linear systems via roundoff-error-free Cholesky factorizations

This page was built for publication: General Sparse Elimination Requires No Permanent Integer Storage

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