Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class (Q1822902)

From MaRDI portal
Revision as of 10:32, 20 June 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
Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
scientific article

    Statements

    Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    Three algorithms for solving linear least squares problems are described. The first uses an explicit QR factorization, and the other two are based on the Moore-Penrose pseudoinverse. Comparative computational results are given exhibiting the improvement in accuracy when the proposed methods are used.
    0 references
    0 references
    Huang algorithm
    0 references
    ABS class
    0 references
    numerical examples
    0 references
    algorithms
    0 references
    linear least squares problems
    0 references
    QR factorization
    0 references
    Moore-Penrose pseudoinverse
    0 references