Perturbation analysis and condition numbers of scaled total least squares problems (Q1027795)

From MaRDI portal
Revision as of 17:00, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Perturbation analysis and condition numbers of scaled total least squares problems
scientific article

    Statements

    Perturbation analysis and condition numbers of scaled total least squares problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    Scaled total least squares (STLS) is a generalization of total least squares (TLS). The problem is to approximate the solution \(x\) of the linear system \(Ax=b\) by \(y\), satisfying \((A+E)y=\lambda b-r\). Here \([r~E]\) is the minimal perturbation (minimal in Frobenius norm \(\|r~E\|_F\)), needed to make the latter system solvable. The scaling parameter \(\lambda\) is positive. TLS is a special case corresponding to \(\lambda=1\). First properties of TLS are recalled and used to show when STLS has a unique solution. Then a sharp, but impractical, relative condition number (in 2-norm) for the STLS problem is derived. However, it implies that the gap \(\hat{\sigma}_n-\sigma_{n+1}\) (assumed positive) with \(\hat{\sigma}_n\) and \(\sigma_{n+1}\) the smallest singular values of \(A\) and \([A~\lambda b]\) respectively is the essential determining element. The larger the gap, the better the condition. Similarly relative condition numbers in \(\infty\)-norm, both mixed (ratio of norms) and componentwise (norm of componentwise ratios) are obtained.
    0 references
    scaled total least squares
    0 references
    condition number
    0 references
    perturbation analysis
    0 references
    error bound
    0 references
    scaling
    0 references
    singular values
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers