A comparison of condition numbers for the full rank least squares problem

Authors:
Joab R. Winkler
Affiliations:
Department of Computer Science, The University of Sheffield, Sheffield, United Kingdom
Venue:
Proceedings of the First international conference on Deterministic and Statistical Methods in Machine Learning
Year:
2004

Citing 5
Cited 0

Effectively well-conditioned linear systems

SIAM Journal on Scientific and Statistical Computing
Truncated singular value decomposition solutions to discrete ill-posed problems with ill-determined numerical rank

SIAM Journal on Scientific and Statistical Computing
Fundamentals of matrix computations

Fundamentals of matrix computations
On the Sensitivity of Solution Components in Linear Systems of Equations

SIAM Journal on Matrix Analysis and Applications
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion

Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion

Quantified Score

Hi-index	0.00

Visualization

Abstract

Condition numbers of the full rank least squares (LS) problem minx||Ax−b||2 are considered theoretically and their computational implementation is compared. These condition numbers range from a simple normwise measure that may overestimate by several orders of magnitude the true numerical condition of the LS problem, to refined componentwise and normwise measures. Inequalities that relate these condition numbers are established, and it is concluded that the solution x0 of the LS problem may be well-conditioned in the normwise sense, even if one of its components is ill-conditioned. It is shown that the refined condition numbers are ill-conditioned in some circumstances, the cause of this ill-conditioning is identified, and its implications are discussed.