The generalized Cholesky factorization method for saddle point problems

Applied Mathematics and Computation

Volumn 92, Issue 1, 1998, Pages 49-58

  Zhao, Jinxi ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

Condition I; Generalized cholesky factorization; Generalized positive definite; Saddle point problem

Indexed keywords

EID: 0141974583     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(97)10040-6     Document Type: Article

References (8)

1. R.E. Bank, B.D. Welfert, H. Yserentant, A class of iterative methods for solving saddle point problems, Numer. Math. 56 (1990) 645-666.
2. n, Elsevier, Amsterdam, 1990.
3. J.H. Bramble, J.E. Pasciak, A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Math. Comp. 50 (1988) 1-17.
4. H.C. Elmain, G.H. Golub, Inexact and preconditioned Uzawa algorithms for saddle point problems, Technical Report NA-93-02, Computer Science Department, Stanford University, 1993.
5. G.H. Golub, C.F. Van Loan, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.
6. G.H. Golub, M.L. Overton, The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems, Numer. Math. 53 (1988) 571-593.
7. I. Gustafsson, A class of first order factorizations, BIT 18 (1978) 142-156.
8. Y. Yuan, Numerical methods for nonlinear programming, Modern Mathematics Series, Shanghai Scientific and Technical Publishers, 1993.