Methods for Modifying Matrix Factorizations
Philip E. Gill, Gene Howard Golub, Walter Murray et al. · Mathematics of Computation · 1974
In recent years, several algorithms have appeared for modifying the factors of a matrix following a rank-one change. These methods have always been given in the context of specific applications and this has probably inhibited their use over a wider field. In this report, several methods are described for modifying Cholesky factors. Some of these have been published previously while others appear for the first time. In addition, a new algorithm is presented for modifying the complete orthogonal factorization of a general matrix, from which the conventional QR factors are obtained as a special case. A uniform notation has been used and emphasis has been placed on illustrating the similarity between different methods.
Cited by 590 works. doi:10.1090/s0025-5718-1974-0343558-6 Open-access PDF
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- The algebraic eigenvalue problem
- Least Squares Computations by Givens Transformations Without Square Roots
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Quasi-Newton Methods for Unconstrained Optimization
- The least squares problem and pseudo-inverses
- Triangular factors of modified matrices
- Numerical Techniques in Mathematical Programming
- Large-scale linear programming using the Cholesky factorization.