A class of incomplete orthogonal factorization methods. I: Methods and theories

BIT Numerical Mathematics

Volumn 41, Issue 1, 2001, Pages 53-70

  Bai, Zhong Zhi ^a   Duff, Iain S ^b   Wathen, Andrew J ^c  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Givens rotations; Incomplete orthogonal factorizations; Linear systems; Modified Gram Schmidt orthogonalization; Preconditioning; Sparse least squares

Indexed keywords

EID: 0042275964     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021913700691     Document Type: Article

References (19)

1. O. Axelsson, Iterative Solution Methods, Cambridge University Press, New York, 1994.
2. O. Axelsson and V. A. Barker, Finite Element Solutions of Boundary Value Problems. Theory and Computation, Academic Press, New York, 1985.
3. P. Concus, G. H. Golub, and G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 220-252.
4. J. Daniel, W. B. Gragg, L. Kaufman, and G. W. Stewart, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-95.
5. J. M. Donato and T. F. Chan, Fourier analysis of incomplete factorization preconditioners for three dimensional anisotropic problems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 319-338.
6. H. C. Elman, A stability analysis of incomplete LU factorizations, Math. Comp., 47 (1986), pp. 191-217.
7. H. C. Elman, Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems, BIT, 29 (1989), pp. 890-915.
8. A. George and M. T. Heath, Solution of sparse linear least squares problems using Givens rotations, Linear Alg. Appl., 34 (1980), pp. 69-83.
9. A. George and E. Ng, On the complexity of sparse QR and LU factorisation of finite element matrices, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 849-861.
10. J. R. Gilbert, E. Ng, and W. Peyton, Separators and structure prediction in sparse orthogonal factorisation, Linear Alg. Appl., 262 (1997), pp. 83-97.
11. I. Gustafsson, A class of first order factorizations, BIT, 18 (1978), pp. 142-156.
12. A. Jennings and M. A. Ajiz, Incomplete methods for solving A′Ax = b, SIAM J. Sci. Statist. Comput., 5:4 (1984), pp. 978-987.
13. T. A. Manteuffel, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 473-497.
14. J. A. Meijerink and H. A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
15. Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
16. Y. Saad, ILUT: A dual threshold incomplete ILU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
17. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
18. X. Wang, K. A. Gallivan, and R. Bramley, CIMGS: A incomplete orthogonalization preconditioner, SIAM J. Sci. Comput., 18 (1997), pp. 516-536.
19. Z. Zlatev, Comparison of two pivotal strategies in sparse plane rotations, Internat. J. Comput. Appl., 8 (1982), pp. 119-135.