Abstract
A domain decomposition method is used to construct a new type of block matrix incomplete factorization method. The properties of this method are such that it can be used as an efficient (i.e. with low computational complexity) and robust, corrector on a coarse mesh. Since the cost of it is of optimal order of computational complexity there is no need to use any further levels of grids as it is in a classical multigrid method. Combined with a smoother on the fine mesh the method turns out to perform as well on difficult problems as on model type problems and with a complexity about as low as that for a classical multigrid method on the model problems. The method is well suited for vector- and parallel Computers. The smoothing-correction forms a V-cycle step which can be used as a preconditioner for a conjugate gradient method, thus guaranteeing convergence. However, the method is so efficient that there is rarely any need for convergence acceleration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Axelsson, O. A generalized conjugate gradient, least Square method, Numer. Math. 51 (1987), 209–227.
Axelsson, O., 1988 in preparation.
Axelsson, O., On multigrid methods of two-level type. Multigrid methods, Proceedings, Köln-Porz (1981), ed. Hackbusch W., Trottenberg U., Lect. notes in Math. 960, Springer, Beding, Heidelberg, New York.
Axelsson, O., Incomplete block matrix factorization preconditioning methods. The ultimate answer? J. Comp. Appl. Math. 12/13 (1985), 3–18.
Axelsson, O., Gustafsson, I., Preconditioning and two-level multigrid methods of arbitrary degree of approximation. Math. Comp. 40 (1983), 219–242.
Axelsson, O., Lindskog, G., On the rate of convergence of the preconditioned conjugate gradient method, Numer. Math. 48 (1986), 499–523.
Axelsson, O., Polman, B., Block preconditioning and domain decomposition method I. Report 8735 (1987), Department of Mathematics, University of Nijmegen.
Fedorenko, R.P., The speed of convergence of one iterative process. USSR Comput. Math, and Math. Phys. 4, 3(1964), 227–235.
Hackbusch, W., Multigrid Methods and Applications, Springer series in Comp. Math. 4(1985), Springer, Berlin, Heidelberg, New York.
Keyes, D.E., Gropp, W.D., A comparison of domain decomposition technique for elliptic partial differential equations and their parallel implementation, SIAM J. Sci. Statist. Comput. 8 (1987), 166–202.
Multigrid Methods II, proceedings Köln 1984, ed. Hackbusch, W., Trottenberg, U., Lecture notes in Math. 1228, Springer, Berlin, Heidelberg, New York.
Polman, B., Preconditioning matrices based on incomplete blockwise factorizations. M.Sc. thesis, Nijmegen, 1984.
Wesseling, P., A robust and efficient Multigrid Method. Multigrid methods, Proceedings, Köln-Porz (1981), ed. Hackbusch, W., Trottenber, U., Lect. notes in Math. 960, Springer, Berlin, Heidelberg, New York.
Wachpress, E.L., Split-level iteration, Comp, & Maths. with Applic, 10 (1984), 453–456.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig
About this chapter
Cite this chapter
Axelsson, O., Polman, B. (1989). A robust preconditioner based on algebraic substructuring and two-level grids. In: Hackbusch, W. (eds) Robust Multi-Grid Methods. Notes on Numerical Fluid Mechanics, vol 23. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-86200-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-322-86200-6_1
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-08097-6
Online ISBN: 978-3-322-86200-6
eBook Packages: Springer Book Archive