Electronic Resource
Springer
BIT
31 (1991), S. 375-379
ISSN:
1572-9125
Keywords:
65F20
;
65F25
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We present a numerical algorithm for computing the implicit QR factorization of a product of three matrices, and we illustrate the technique by applying it to the generalized total least squares and the restricted total least squares problems. We also demonstrate how to take advantage of the block structures of the underlying matrices in order to reduce the computational work.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01931299
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |