An optimal adaptive Fictitious Domain Method Academic Article uri icon


  • © 2019 American Mathematical Society. We consider a fictitious domain formulation of an elliptic partial differential equation and approximate the resulting saddle-point system using a nested inexact preconditioned Uzawa iterative algorithm, which consists of three nested loops. In the outer loop the trial space for the Galerkin approximation of the Lagrange multiplier is enlarged. The intermediate loop solves this Galerkin system by a damped preconditioned Richardson iteration. Each iteration of the latter involves solving an elliptic problem on the fictitious domain whose solution is approximated by an adaptive finite element method in the inner loop. We prove that the overall method converges with the best possible rate and illustrate numerically our theoretical findings.

author list (cited authors)

  • Berrone, S., Bonito, A., Stevenson, R., & Verani, M.

citation count

  • 2

publication date

  • February 2019