Scaled total least squares fundamentals (Q1597698)

From MaRDI portal
Revision as of 01:23, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Scaled total least squares fundamentals
scientific article

    Statements

    Scaled total least squares fundamentals (English)
    0 references
    0 references
    0 references
    30 May 2002
    0 references
    The authors analyse a particularly useful formulation of the scaled total least squares problem. The analysis is based on a new assumption that guarantees existence and uniqueness of meaningful solution for real positive parameters. The proposed in the paper theoretical considerations complex data are allowed. It is shown how any linear system can be reduced to a minimally dimensioned core system satisfying accepted assumption. Consequently, the developed theory and algorithms can be applied to fully general systems. The basics of practical algorithms for solving both scaled total least squares and data least squares problems are indicated for either dense or large sparse systems. All assumptions and their consequences are compared with earlier approaches.
    0 references
    overdetermined linear systems
    0 references
    scaled total least squares problem
    0 references
    algorithms
    0 references
    large sparse systems
    0 references

    Identifiers