Ill-conditionedness need not be componentwise near to ill-posedness for least squares problems

DOI10.1023/A:1022377410087zbMath0970.65039OpenAlexW1539082189MaRDI QIDQ1283254

Siegfried Michael Rump

Publication date: 24 October 2001

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022377410087

zbMATH Keywords

condition numberill-posed problempseudoinverseleast squares problemscomponentwise distanceundetermined linear systems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Related Items (4)

Condition numbers and backward perturbation bound for linear matrix equations ⋮ Effective condition number for weighted linear least squares problems and applications to the Trefftz method ⋮ Condition numbers for structured least squares problems ⋮ Convergence of Rump’s method for computing the Moore-Penrose inverse

Uses Software

• Maple

This page was built for publication: Ill-conditionedness need not be componentwise near to ill-posedness for least squares problems