Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

Methods for computing and modifying the $ LDV$ factors of a matrix


Authors: Philip E. Gill, Walter Murray and Michael A. Saunders
Journal: Math. Comp. 29 (1975), 1051-1077
MSC: Primary 65F30
DOI: https://doi.org/10.1090/S0025-5718-1975-0388754-8
MathSciNet review: 0388754
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Methods are given for computing the LDV factorization of a matrix B and modifying the factorization when columns of B are added or deleted. The methods may be viewed as a means for updating the orthogonal (LQ) factorization of B without the use of square roots. It is also shown how these techniques lead to two numerically stable methods for updating the Cholesky factorization of a matrix following the addition or subtraction, respectively, of a matrix of rank one. The first method turns out to be one given recently by Fletcher and Powell; the second method has not appeared before.


References [Enhancements On Off] (What's this?)

  • [1] R. FLETCHER & M. J. D. POWELL (1973), On the Modification of $ LD{L^T}$ Factorizations, AERE report, TP 519.
  • [2] W. M. GENTLEMAN (1973), "Least squares computations by Givens transformations without square roots," J. Inst. Math. Appl., v. 12, pp. 329-336. MR 48 #7575. MR 0329233 (48:7575)
  • [3] P. E. GILL, G. H. GOLUB, W. MURRAY & M. A. SAUNDERS (1974), "Methods for modifying matrix factorizations," Math. Comp., v. 28, pp. 505-535. MR 0343558 (49:8299)
  • [4] E. HELLERMAN & D. RARICK (1971), "Reinversion with the preassigned pivot procedure," Math. Programming, v. 1, pp. 195-216. MR 45 #2895 MR 0293819 (45:2895)
  • [5] E. HELLERMAN & D. RARICK (1972), "The partitioned preassigned pivot procedure $ ({{\text{P}}^4})$," Sparse Matrices and Their Applications, D. J. Rose and R. A. Willoughby (Editors), Plenum Press, New York, pp. 67-76. MR 48 #10075. MR 0331743 (48:10075)
  • [6] M. A. SAUNDERS (1972), Product Form of the Cholesky Factorization for Large-Scale Linear Programming, Report STAN--CS--72--301, Computer Science Department, Stanford University, Stanford, California.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F30

Retrieve articles in all journals with MSC: 65F30


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1975-0388754-8
Article copyright: © Copyright 1975 American Mathematical Society

American Mathematical Society