Condition Number Estimators in a Sparse Matrix Software

DOI10.1137/0907080MaRDI QIDQ3725444zbMATH OpenOpenAlexFDO

Authors J. Waśniewski, Kjeld Schaumburg, 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

zbMATH Keywords

condition number of a matrixdrop-toleranceGaussian eliminationpivotal strategies for sparse matricessparse matricessparse matrix techniquestability factor

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Cited in

(5)

• 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
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• Improving the numerical stability and the performance of a parallel sparse solver
• scientific article; zbMATH DE number 3936369 (Why is no real title available?)

This page was built for publication: Condition Number Estimators in a Sparse Matrix Software

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