Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class (Q1822902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1822902 |
scientific article; zbMATH DE number 4113856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class |
scientific article; zbMATH DE number 4113856 |
Statements
Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class (English)
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
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
0 references
0.8691567778587341
0 references
0.7991836071014404
0 references
0.7988693714141846
0 references
