Implicit QR factorization of a product of three matrices (Q805148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4203577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit QR factorization of a product of three matrices |
scientific article; zbMATH DE number 4203577 |
Statements
Implicit QR factorization of a product of three matrices (English)
0 references
1991
0 references
The paper extends the method of \textit{C. Paige} [Reliable numerical computation, Proc. Conf. in Honour of J. H. Wilkinson, Teddington/UK, 73- 91 (1990; Zbl 0721.65013)] concerning the (generalized) QR factorization of two matrices to the case of three or more matrices. The method is used to compute both the generalized and the restricted total least squares solutions of linear equations, and to reduce the computational work.
0 references
QR factorization
0 references
least squares solutions
0 references
0.7423214316368103
0 references
0.7369659543037415
0 references
0.7199518084526062
0 references
