Summary
We describe and analyze a multigrid algorithm for finite element approximations of second order elliptic boundary value problems with weightedextended b-splines (web-splines). This new technique provides high accuracy with relatively low-dimensional subspaces, does not require any grid generation, and is ideally suited for hierarchical solution techniques. In particular, we show that the standard W-cycle yields uniform convergence, i.e., the required number of iterations is bounded independent of the grid width.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 17, 2000 / Published online August 17, 2001
Rights and permissions
About this article
Cite this article
Höllig, K., Reif, U. & Wipper, J. Multigrid methods with web-splines. Numer. Math. 91, 237–255 (2002). https://doi.org/10.1007/s002110100324
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002110100324