In this paper, a multi-grid solver for the discretisation of partial differential equations on complicated domains will be developed. The algorithm requires as input only the given discretisation instead of a hierarchy of discretisations on coarser grids. Such auxiliary grids and discretisations will be generated in a black-box fashion and will be employed to define purely algebraic intergrid transfer operators. The geometric interpretation of the algorithm allows one to use the framework of geometric multigrid methods to prove its convergence. The focus of this paper is on the formulation of the algorithm and the demonstration of its efficiency by numerical experiments while the analysis is carried out for some model problems.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Received: 12 February 2002 / Accepted: 31 July 2002 / Published online: 10 April 2003
Communicated by R.E. Bank
About this article
Cite this article
Feuchter, D., Heppner, I., Sauter, S. et al. Bridging the gap between geometric and algebraic multi-grid methods. Comput Visual Sci 6, 1–13 (2003). https://doi.org/10.1007/s00791-003-0102-3
- Differential Equation
- Partial Differential Equation
- Numerical Experiment
- Model Problem
- Coarse Grid