Condition Number Estimators in a Sparse Matrix Software
From MaRDI portal
Publication:3725444
DOI10.1137/0907080zbMath0594.65030OpenAlexW2004093973MaRDI QIDQ3725444
Kjeld Schaumburg, Jerzy Wasniewski, Zahari Zlatev
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907080
sparse matricesGaussian eliminationcondition number of a matrixsparse matrix techniquedrop-tolerancestability factorpivotal strategies for sparse matrices
Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Improving the numerical stability and the performance of a parallel sparse solver
