Skip to main content
Log in

A Subspace Cascadic Multigrid Method for Mortar Elements

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A cascadic multigrid (CMG) method for elliptic problems with strong material jumps is proposed and analyzed. Non–matching grids at interfaces between subdomains are allowed and treated by mortar elements. The arising saddle point problems are solved by a subspace confined conjugate gradient method as smoother for the CMG. Details of algorithmic realization including adaptivity are elaborated. Numerical results illustrate the efficiency of the new subspace CMG algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received December 14, 2001; revised September 2, 2002 Published online: November 18, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Braess, D., Deuflhard, P. & Lipnikov, K. A Subspace Cascadic Multigrid Method for Mortar Elements. Computing 69, 205–225 (2002). https://doi.org/10.1007/s00607-002-1460-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-002-1460-2

Navigation