Article

Full entry | PDF   (0.7 MB)
Keywords:
conjugate gradient method; preconditioning
Summary:
An algorithm of the preconditioned conjugate gradient method in which the solution of an auxiliary system is replaced with multiplication by the matrix $M=I-\omega A$ for suitably chosen $\omega$ is presented.
References:
[lit1] J. Mandel: Adaptive Iterative Solvers in Finite Elements. (to appear).
[lit2] J. Mandel: Balancing Domain Decomposition. Communications in Numerical Methods in Engineering 9 (1993). MR 1208381 | Zbl 0796.65126
[lit3] G. Luenberger: Introduction to Linear and Nonlinear Programming. Addison-Wesley, New York, 1973. Zbl 0297.90044
[lit4] A.van der Sluis and H.A.van der Vorst: The Rate of Convergence of Conjugate Gradients. Numer. Math. 48 (1986). MR 0839616
[lit6] W. Hackbusch: Multigrid Methods and Applications. Springer Verlag, 1985. MR 0814495
[lit8] O. Axelsson, V. A. Barker: Finite Element Solution of Boundary Value Problems. Academic Press, 1984. MR 0758437

Partner of