Skip to main content

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

  • 2535 Accesses

In this chapter, we describe iterative methods for solving the discretization of a self adjoint and coercive elliptic equation on a grid with a multilevel structure. Such grids are obtained by the successive refinement of an initial coarse grid, either globally or locally. When the refinement is global, the resulting grid is quasi-uniform, while if the refinement is restricted to subregions, the resulting grid will not be quasi-uniform. We describe preconditioners formulated using multigrid methodology [BR22, HA4, HA2, BR36]. Multilevel preconditioners can yield optimal order performance, like multigrid methods, however, they are convergent only with Krylov space acceleration.

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

Access this chapter

eBook
USD 16.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

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.

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Multilevel and Local Grid Refinement Methods. In: Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations. Lecture Notes in Computational Science and Engineering, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77209-5_7

Download citation

Publish with us

Policies and ethics