General Sparse Elimination Requires No Permanent Integer Storage
From MaRDI portal
Publication:3759803
DOI10.1137/0908052zbMath0622.65021OpenAlexW2021820942MaRDI QIDQ3759803
R. Kent Smith, Randolph E. Bank
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
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (5)
A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations ⋮ Sparse matrix multiplication package (SMMP) ⋮ Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ 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
This page was built for publication: General Sparse Elimination Requires No Permanent Integer Storage
