Multilevel block incomplete factorization preconditioning

Applied Numerical Mathematics

Volumn 31, Issue 2, 1999, Pages 209-225

  Notay, Y ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; FINITE DIFFERENCE METHOD; LINEAR SYSTEMS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS;

ACCELERATION OF CONVERGENCE; MULTILEVEL BLOCK INCOMPLETE FACTORIZATION PRECONDITIONING;

ITERATIVE METHODS;

EID: 0033207377     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00133-0     Document Type: Article

References (33)

1. O. Axelsson, A general incomplete block-matrix factorization method, Linear Algebra Appl. 74 (1986) 179-190.
2. O. Axelsson, The method of diagonal compensation of reduced matrix entries and multilevel iteration, J. Comput. Appl. Math. 38 (1991) 31-43.
3. O. Axelsson, On algebraic multilevel iterations for methods for selfadjoint elliptic problems with anisotropy, in: Fascicolo speciale, numerical methods, Rend. Sem. Mat. Univers. Politech. Torino, 1991, pp. 31-61.
4. O. Axelsson, Iterative Solution Methods (Cambridge University Press, Cambridge, 1994).
5. O. Axelsson, S. Brinkkemper,V.P. Il'in, On some versions of incomplete block-matrix factorization iterative methods, Linear Algebra Appl. 84 (1984) 3-15.
6. O. Axelsson, V. Eijkhout, The nested recursive two level factorization for nine-point difference matrices, Technical Report 8936, Department of Mathematics, Catholic University, Nijmegen, The Netherlands, 1989.
7. O. Axelsson, V. Eijkhout, Analysis of recursive 5-point/9-point factorization method, in: O. Axelsson, L. Kolotilina, eds., Preconditioned Conjugate Gradient Methods, Lectures Notes in Mathematics, Vol. 1457 (Springer, Berlin, 1990) 154-173.
8. O. Axelsson, V. Eijkhout, The nested recursive two level factorization for nine-point difference matrices, SIAM J. Sci. Statist. Comput. 12 (1991) 1373-1400.
9. O. Axelsson, M. Neytcheva, Algebraic multilevel iterations for stieltjes matrices, Numer. Linear Algebra Appl. 1 (1994) 213-236.
10. R. Beauwens, M. Ben Bouzid, On sparse block factorization iterative methods, SIAM J. Numer. Anal. 24 (1987) 1066-1076.
11. R. Beauwens, M. Ben Bouzid, Existence and conditioning properties of sparse approximate block factorizations, SIAM J. Numer. Anal. 25 (1988) 941-956.
12. R. Beauwens, B. Tombuyses, Graph perturbations, Appl. Numer. Math. 16 (1994) 251-264.
13. A. Ben Israel, T.N.E. Greville, Generalized Inverses: Theory and Applications (Wiley, New York, 1974).
14. A. Berman, R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences (Academic Press, New York, 1979).
15. E. Botta, A. van der Ploeg, Preconditioning Techniques for Matrices with Arbitrary Sparsity Patterns, Preprint, Department of Mathematics, University of Groningen, The Netherlands, 1995.
16. C.W. Brand, An incomplete factorization preconditioning using repeated red-black ordering, Numer. Math. 61 (1992) 433-454.
17. P. Concus, G.H. Golub, G. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput. 6 (1985) 220-252.
18. D.J. Klein, Treediagonal matrices and their inverses, Linear Algebra Appl. 42 (1982) 109-117.
19. M. Magolu, Taking advantage of the potentialities of dynamically modified block incomplete factorizations, SIAM J. Sci. Comput. 19 (1998) 1083-1108.
20. M.M. Magolu, Modified block-approximate factorization strategies, Numer. Math. 61 (1992) 91-110.
21. M.M. Magolu, Sparse block approximate factorizations for singular problems, in: R. Beauwens, P. de Groen, eds., Iterative Methods in Linear Algebra (North-Holland, Amsterdam, 1992) 519-529.
22. M.M. Magolu, Ordering strategies for modified block incomplete factorization, SIAM J. Sci. Comput. 16 (1995) 378-399.
23. S. Margenov, P. Vassilevski, Algebraic multilevel preconditioning of anisotropic elliptic problems, SIAM J. Sci. Stat. Comput. 15 (1994) 1026-1037.
24. J.A. Meijerink, 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) 148-162.
25. Y. Notay, Polynomial acceleration of iterative schemes associated with subproper splittings, J. Comput. Appl. Math. 24 (1988) 153-167.
26. Y. Notay, Solving positive (semi)definite linear systems by preconditioned iterative methods, in: O. Axelsson, L. Kolotilina, eds., Preconditioned Conjugate Gradient Methods, Lectures Notes in Mathematics, Vol. 1457 (Springer, Berlin, 1990) 105-125.
27. Y. Notay, Conditioning analysis of modified block incomplete factorizations, Linear Algebra Appl. 154-156 (1991) 711-722.
28. Y. Notay, Z. Ould Amar, A nearly optimal preconditioning based on recursive red-black orderings, Numer. Linear Algebra Appl. 4 (1997) 369-391.
29. Y. Saad, ILUM: A parallel multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Statist. Comput. 17 (1996) 830-847.
30. H.L. Stone, Iterative solution of implicit approximation of multidimensional partial differential equations, SIAM J. Numer. Anal. 5 (1968) 530-558.
31. K. Takahishi, J. Pagan, M. Chen, Formation of a sparse bus impedance matrix and its application to short circuit study, in: 8th PICA Conference Proceedings, Minneapolis, 1973, pp. 63-69.
32. A. van der Ploeg, E. Botta, F. Wubs, Nested grids ILU-decomposition (NGILU), J. Comput. Appl. Math. 66 (1996) 515-526.
33. H.A. van der Vorst, The convergence behaviour of preconditioned CG and CG-S, in: O. Axelsson, L. Kolotilina, eds., Preconditioned Conjugate Gradient Methods, Lectures Notes in Mathematics, Vol. 1457 (Springer, Berlin, 1990) 126-136.