Accurate downdating of a modified Gram-Schmidt QR decomposition

BIT Numerical Mathematics

Volumn 36, Issue 1, 1996, Pages 166-181

  Yoo, K ^a   Park, H ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Gram Schmidt downdating algorithm; Householder transformation; Least squares problems; Modified Gram Schmidt algorithm; QR decomposition downdating; Reorthogonalization

Indexed keywords

EID: 0000057642     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01740553     Document Type: Article

References (17)

1. S. T. Alexander, C. T. Pan, and R. J. Plemmons. Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing. Linear Algebra and Its Applications, 98(1988), pp. 3-40.
2. A.A. Anda and H. Park. Fast plane rotations with dynamic scaling. SIAM J. Matrix Anal. Appl., 15(1994), pp. 162-174.
3. Å. Björck. Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT, 7(1967), pp. 1-21.
4. Å. Björck. Error analysis of least squares algorithms. In Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, G.H. Golub and P. Van Dooren, eds., NATO ASI Series, Vol. F70, Springer-Verlag, Berlin-Heidelberg, 1991.
5. Å. Björck and C. C. Paige. Loss and Recapture of orthogonality in the modified Gram-Schmidt algorithm. SIAM J. Matrix Anal. Appl., 13(1992), pp. 176-190.
6. Å. Björck, H. Park and L. Eldén. Accurate downdating of least squares solutions. SIAM J. Matrix Anal. Appl., 15(1994), pp. 549-568.
7. J. Daniel, W. B. Gragg, L. Kaufman, and G. W. Stewart. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Mathematics of Computation, 30(1976), pp. 772-95.
8. P. E. Gill, G. H. Golub, W. Murray and M. A. Saunders. Methods for modifying matrix factorizations. Mathematics of Computation, 28(1974), pp. 505-535.
9. G. H. Golub. Matrix decompositions and statistical computations. In Statistical Computation, R. C. Milton and J. A. Neider, eds., Academic Press, New York, 1969, pp. 365-397.
10. G. H. Golub and C. F. Van Loan. Matrix Computations. 2nd ed. Johns Hopkins Press, Baltimore, MD, 1989.
11. S. Haykin. Adaptive Filter Theory. 2nd ed. Prentice Hall, Englewood Cliffs, NJ, 1991.
12. C. C. Paige. Error analysis of some techniques for updating orthogonal decompositions. Mathematics of Computation, 34(1980), pp. 465-471.
13. B.N. Parlett. The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ, 1980.
14. L. Reichel and W. B. Gragg. FORTRAN subroutines for updating the QH decomposition. ACM Trans. Math. Software, 16(1990), pp. 369-377.
15. M. A. Saunders. Large-scale linear programming using the Cholesky factorization. Technical Report CS252, Computer Science Department, Stanford University, 1972.
16. B. Waldén, R. Karlson and J. Sun. Optimal backward perturbation bounds for the linear least squares problem. Numerical Linear Algebra and Applications, 2(1995), pp. 271-286.
17. J. H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, England, 1965.