Abstract
The use of preconditionings obtained by so called modified incomplete factorizations has become quite popular for the PCG solution of regular systems arising from the discretization of elliptic PDE's. Our purpose here is to review their recent extension to the singular case. Because such conditionings may themselves be singular, we first review the extension of the general theory of polynomial acceleration to the case of singular preconditionings. We emphasize that all results can be formulated in such a way that they cover both the regular and singular cases. Examples of application are given, displaying the superiority of the recently developed factorization strategies.
Author's research is supported by the “Fonds National de la Recherche Scientifique” (Belgium) - Aspirant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O. Axelsson, Solution of linear equations: iterative methods, in: Sparse Matrix Techniques (V.A. Barker, Editor), Lectures Notes in Mathematics No. 572, Springer-Verlag, 1977.
—, On the eigenvalue distribution of relaxed incomplete factorization methods and the rate of convergence of conjugate gradient methods, Technical Report, Departement of Mathematics, Catholic UniversityNijmegen, The Netherlands, 1989.
O. Axelsson and V. Barker, Finite Element Solution of Boundary Value Problems. Theory and Computation, Academic Press, New York, 1984.
O. Axelsson and G. Lindskog, On the eigenvalue distribution of a class of preconditioning methods, Numer. Math., 48 (1986), pp. 479–498.
—, On the rate of convergence of the preconditioned conjugate gradient method, Numer. Math., 48 (1986), pp. 499–523.
R. Beauwens, Upper eigenvalue bounds for pencils of matrices, Lin. Alg. Appl., 62 (1984), pp. 87–104.
—, On Axelsson's perturbations, Lin. Alg. Appl., 68 (1985), pp. 221–242.
—, Lower eigenvalue bounds for pencils of matrices, Lin. Alg. Appl., 85 (1987), pp. 101–119.
—, Approximate factorizations with S/P consistently ordered M-factors, BIT, 29 (1989), pp. 658–681.
—, Modified incomplete factorizations strategies, submitted for publication in PCG Conference Proceedings, (1990).
R. Beauwens and L. Quenon, Existence criteria for partial matrix factorizations in iterative methods, Siam J. Numer. Anal., 13 (1976), pp. 615–643.
R. Beauwens and R. Wilmet, Conditioning analysis of positive definite matrices by approximate factorizations, J. Comput. Appl. Math., 26 (1989), pp. 257–269.
A. Ben Israel and T. Greville, Generalized Inverses: theory and applications, J. Wiley and Sons, New York, 1974.
A. Berman and R. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
A. George and J. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, 1981.
I. Gustafsson, Modified incomplete Cholesky (MIC) methods, in: Preconditioning Methods, Theory and Applications (D.J. Evans, Editor), Gordon and Breach Science, 1983.
L. Hageman and D. Young, Applied Iterative Methods, Academic Press, New York, 1981.
F. Harary, Graph Theory, Addison-Wesley, Reading, 1969.
E. Kaasschieter, Preconditioned conjugate gradients for solving singular systems, J. Comp. Appl. Math., 24 (1988), pp. 265–275.
V. Lebedev and S. Finogenov, Utilisation of ordered Chebyshev parameters in iterative methods, URSS Comput. Math. Math. Phys., 16 (1976), pp. 70–83.
M. Magolu, Lower eigenvalue bounds for singular pencils of matrices, in preparation.
Y. Notay, Sur le conditionnement de matrices de Stieltjes par factorisations approchées, Mémoire. Université Libre de Bruxelles, Brussels, Belgium, 1987.
—, Polynomial acceleration of iterative schemes associated with subproper splittings, J. Comp. Appl. Math., 24 (1988), pp. 153–167.
—, Incomplete factorizations of singular linear systems, BIT, 29 (1989), pp. 682–702.
—, Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations, submitted for publication, (1990).
A. van der Sluis and H. van der Vorst, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543–560.
R. Varga, Matrix iterative analysis, Prentice Hall, Englewood Cliffs, 1962.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Notay, Y. (1990). Solving positive (semi)definite linear systems by preconditioned iterative methods. In: Axelsson, O., Kolotilina, L.Y. (eds) Preconditioned Conjugate Gradient Methods. Lecture Notes in Mathematics, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090904
Download citation
DOI: https://doi.org/10.1007/BFb0090904
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53515-7
Online ISBN: 978-3-540-46746-5
eBook Packages: Springer Book Archive