Computing and Visualization in Science

, Volume 15, Issue 5, pp 271–289

Local multilevel preconditioners for elliptic equations with jump coefficients on bisection grids

Article

DOI: 10.1007/s00791-013-0213-4

Cite this article as:
Chen, L., Holst, M., Xu, J. et al. Comput. Visual Sci. (2012) 15: 271. doi:10.1007/s00791-013-0213-4

Abstract

The goal of this paper is to design optimal multilevel solvers for the finite element approximation of second order linear elliptic problems with piecewise constant coefficients on bisection grids. Local multigrid and BPX preconditioners are constructed based on local smoothing only at the newest vertices and their immediate neighbors. The analysis of eigenvalue distributions for these local multilevel preconditioned systems shows that there are only a fixed number of eigenvalues which are deteriorated by the large jump. The remaining eigenvalues are bounded uniformly with respect to the coefficients and the meshsize. Therefore, the resulting preconditioned conjugate gradient algorithm will converge with an asymptotic rate independent of the coefficients and logarithmically with respect to the meshsize. As a result, the overall computational complexity is nearly optimal.

Keywords

Local multilevel preconditioners Multigrid BPX  Discontinuous coefficients Adaptive finite element methods  PCG Effective condition number 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Long Chen
    • 1
  • Michael Holst
    • 2
  • Jinchao Xu
    • 3
  • Yunrong Zhu
    • 4
  1. 1.Department of MathematicsUniversity of California at IrvineIrvineUSA
  2. 2.Department of MathematicsUniversity of California at San DiegoLa JollaUSA
  3. 3.Department of MathematicsPennsylvania State UniversityUniversity ParkUSA
  4. 4.Department of MathematicsIdaho State UniversityPocatelloUSA