Summary
Two variants of modified incomplete block-matrix factorization with additive correction are proposed for the iterative solution of large linear systems of equations. Both rigorous theoretical support and numerical evidence are given displaying their efficiency when applied to discrete second order partial differential equations (PDEs), even in the case of quasi-singular problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Axelsson, O. (1972): A generalized SSOR method. BIT13, 443–467
Axelsson, O. (1989): On the eigenvalue distribution of relaxed incomplete factorization methods and the rate of convergence of preconditioned conjugate gradient method. XV National summer school on Application of Mathematics in Engineering, August 23–31, 1989, Varna, Bulgaria
Axelsson, O., Barker, V.A.: Finite Element Solutions of Boundary Value Problems: Theory and Computation. Academic Press, New York, 1984
Axelsson, O., Eijkhout, V. (1989): Vectorizable preconditioners for elliptic difference equations in three space dimensions. J. Comput. Appl. Math.27, 299–321
Axelsson, O., Lindskog, G. (1986): On the eigenvalue distribution of a class of preconditioning methods. Numer. Math.48, 479–498
Beauwens, R. (1987): Lower eigenvalue bounds for pencils of matrices. Lin Alg. Appl.85, 101–119
Beauwens, R. (1985): On Axelsson's perturbations. Lin. Alg. Appl.68, 221–242
Beauwens, R. (1990): Modified incomplete factorization strategies. In: Axelsson, O., Kolotilina, L. eds., Preconditioned Conjugate Gradient Methods. Lectures Notes in Mathematics No. 1457, Springer, Berlin Heidelberg New York, pp. 1–16
Beauwens, R., Ben Bouzid, M. (1987): On sparse block factorization iterative methods. SIAM J. Numer. Anal.24, 1066–1076
Beauwens, R., Ben Bouzid, M. (1988): Existence and conditioning properties of sparse approximate block factorizations. SIAM J. Numer. Anal.25, 941–956
Beauwens, R., Wilmet, R. (1989): Conditioning analysis of positive definite matrices by approximate factorizations. J. Comput. Appl. Math.26, 257–269
Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York, 1979
Concus, P., Golub, G.H., Meurant, G. (1985): Block preconditioning for the conjugate gradient method. SIAM J. Sci. Statist. Comput.6, 220–252
George, A., Liu, J.W. (1981): Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, N.J.
Goovaerts, D. (1990): Domain Decomposition Methods for Elliptic Partial Differential Equations. PhD Thesis, Katholieke Universiteit Leuven, Department of Computer Science, Leuven, Belgium
Gustafsson, I. (1983): Modified incomplete Cholesky (MIC) Methods. In: Evans, D.J. ed., Preconditioning Methods, Theory and Applications Gordon and Breach, New York London Paris, pp. 265–293
Harary, F. (1969): Graph Theory. Addison-Wesley, Reading
Kershaw, D.S. (1978): The incomplete Choleski-conjugate gradient method for the iterative solution of systems of linear equations. J. Comput. Phys.26, 43–65
Kettler, R. (1987): Linear multigrid method for numerical reservoir simulation. Ph. D. Thesis, University of Technology, Dept. of Technical Math. and Informatics, Delft
Magolu, M.M. (1991): Conditioning analysis, of sparse block approximate factorizations. Appl. Numer. Math.8, 25–42
Magolu, M.M.: Analytical bounds for block approximate factorization methods. Lin. Alg. Appl. (submitted)
Magolu, M.M., Notay, Y. (1991): On the conditioning analysis of block approximate factorization methods. Lin. Alg. Appl.154–156, 583–599
Manteuffel, T.A. (1980): An incomplete factorization technique for positive definite linear systems. Math. Comput.34, 473–497
Notay, Y. (1989): Incomplete factorizations of singular linear systems. BIT29, 682–702
Notay, Y. (1991): Conditioning analysis of modified block incomplete factorizations. Lin. Alg. Appl.154–156, 711–722
Sonneveld, P. (1989): A fast Lanczos type solver for nonsymmetric linear system. SIAM J. Sci. Statist. Comput.10, 36–52
Van der Sluis, A., Van der Vorst, H.A. (1986): The rate of convergence of conjugate gradients. Numer. Math.48, 543–560
Van der Vorst, H.A. (1990): The convergence behaviour of preconditioned CG and CG-S. In: Axelsson, O., Kolotilina, L. eds., Preconditioned Conjugate Gradient Methods. Lectures Notes in Mathematics, No. 1457. Springer, Berlin Heidelberg New York, pp. 126–136
Varga, R.S. (1962): Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, N.J.
Wittum, G. (1989): On the robustness of ILU-smoothing. SIAM J. Sci. Stat. Comput.10, 699–717
Wittum, G. (1989): Linear, iterations as smoothers in Multigrid methods: Theory with applications to incomplete decompositions. Impact Comput. Sci. Engrg.1, 180–215
Author information
Authors and Affiliations
Additional information
Research supported by the A.B.O.S. (A.G.C.D.) under project 11, within the co-operation between Belgium and Zaire