Previous |  Up |  Next

Article

Keywords:
algebraic multigrid method; smoothing; unknowns aggregation; black-box solver
Summary:
In this paper a black-box solver based on combining the unknowns aggregation with smoothing is suggested. Convergence is improved by overcorrection. Numerical experiments demonstrate the efficiency.
References:
[lit1] R. Blaheta: Iterative Methods for Numerical Solving of the Boundary Value Problems of Elasticity. Thesis, Ostrava, 1989. (Czech)
[lit2] S. Míka, P. Vaněk: Modification of the Two-level Algorithm with Overcorrection. Appl. Math. 37 (1992), no. 1. MR 1152154
[lit3] S. Míka, P. Vaněk: The Acceleration of Two-level Algorithm by Aggregation in Smoothing Process. Appl. Math. 37 (1992), no. 5. MR 1175929
[lit4] P. Vaněk: Acceleration of a Two-level Algorithm by Smoothing Transfer Operators. Appl. Math. 37 (1992), no. 4.. MR 1180605
[lit5] W. Hackbusch: Multi-Grid Methods and Applications. Springer-Verlag, 1985. Zbl 0595.65106
[lit6] J. Mandel: Adaptive Iterative Solvers in Finite Elements. (to appear).
[lit7] O. Axelsson, V.A. Barker: Finite Element Solution of Boundary Value Problems. Academic Press, 1984. MR 0758437
[lit8] S.F. McCormick: Multi-Grid Methods. SIAM (1987).
[lit9] P. Leitl: private communication. Nynice, 1993.
[lit10] J. Mandel: Balancing Domain Decomposition. Communications in Numerical Methods in Engineering 9 (1993). MR 1208381 | Zbl 0796.65126
Partner of
EuDML logo