Skip to main content

Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids

  • Conference paper
  • First Online:
Domain Decomposition Methods in Science and Engineering XIX

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 78))

Abstract

In this paper, we develop and analyze an efficient multigrid method to solve the finite element systems from elliptic obstacle problems on two dimensional adaptive meshes. Adaptive finite element methods (AFEMs) based on local mesh refinement are an important and efficient approach when the solution is non-smooth. An optimality theory on AFEM for linear elliptic equations can be found in [8]. To achieve optimal complexity, an efficient solver for the discretization is indispensable.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. L. Badea, X.-C. Tai, and J. Wang. Convergence rate analysis of a multiplicative schwarz method for variational inequalities. SIAM J. Numer. Anal., 41(3):1052–1073, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.H. Bramble, J.E. Pasciak, and A.H. Schatz. The construction of preconditioners for elliptic problems by substructuring, I. J. Comput. Math., 47:103–134, 1986.

    MATH  MathSciNet  Google Scholar 

  3. L. Chen, R.H. Nochetto, and J. Xu. Local multilevel methods on graded bisection grids for H 1 system. Submitted to J. Comput. Math., 2009.

    Google Scholar 

  4. L. Chen and C.-S. Zhang. A coarsening algorithm and multilevel methods on adaptive grids by newest vertex bisection. Submitted to J. Comput. Math., 2009.

    Google Scholar 

  5. C.W. Cryer. Successive overrelaxation methods for solving linear complementarity problems arising from free boundary problems. Proceedings of Intensive Seminary on Free Boundary Problems, Pavie, Ed. Magenes, 1979.

    Google Scholar 

  6. C. Graser and R. Kornhuber. Multigrid methods for obstacle problems. J. Comput. Math., 27(1):1–44, 2009.

    MathSciNet  Google Scholar 

  7. R. Kornhuber. Adaptive Monotone Multigrid Methods for Nonlinear Variational Problems. Advances in Numerical Mathematics B. G. Teubner, Stuttgart, 1997.

    MATH  Google Scholar 

  8. R.H. Nochetto, K.G. Siebert, and A. Veeser. Theory of adaptive finite element methods: an introduction. In R.A. DeVore and A. Kunoth, editors, Multiscale, Nonlinear and Adaptive Approximation. Springer, Heidelberg, 2009.

    Google Scholar 

  9. K.G. Siebert and A. Veeser. A unilaterally constrained quadratic minimization with adaptive finite elements. SIAM J. Optim., 18(1):260–289, 2007.

    Article  MATH  MathSciNet  Google Scholar 

  10. X.-C. Tai. Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities. Numer. Math., 93(4):755–786, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  11. X.-C. Tai, B. Heimsund, and J. Xu. Rate of convergence for parallel subspace correction methods for nonlinear variational inequalities. In Domain Decomposition Methods in Science and Engineering (Lyon, 2000), Theory Eng. Appl. Comput. Methods, pp. 127–138. Internat. Center Numer. Methods Eng. (CIMNE), Barcelona, 2002.

    Google Scholar 

  12. X.-C. Tai and J. Xu. Global convergence of subspace correction methods for convex optimization problems. Math. Comput., 71(237):105–124, 2002.

    MATH  MathSciNet  Google Scholar 

  13. J. Xu, L. Chen, and R.H. Nochetto. Optimal multilevel methods for H(grad), H(curl), and H(div) systems on adaptive and unstructured grids. In R.A. DeVore and A. Kunoth, editors, Multiscale, Nonlinear and Adaptive Approximation. Springer, Heidelberg, 2009.

    Google Scholar 

  14. J. Xu. Iterative methods by space decomposition and subspace correction. SIAM Rev., 34:581–613, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen-Song Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, L., Nochetto, R.H., Zhang, CS. (2011). Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids. In: Huang, Y., Kornhuber, R., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XIX. Lecture Notes in Computational Science and Engineering, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11304-8_25

Download citation

Publish with us

Policies and ethics