On computing bounds for the least singular value of a triangular matrix

DOI10.1007/BF01932992MaRDI QIDQ4055066zbMATH OpenFDO

Authors Ned Anderson, Ilkka Karasalo

Publication date 1975

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01932992

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites work

• A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)

Cited in

(3)

• On the comparison of H-matrices with M-matrices
• Rang revealing QR factorizations
• On estimating the least singular value of a matrix

This page was built for publication: On computing bounds for the least singular value of a triangular matrix

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