New Estimates for Multilevel Algorithms Including the V-Cycle (Q5288215)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 247060
Language Label Description Also known as
default for all languages
No label defined
    English
    New Estimates for Multilevel Algorithms Including the V-Cycle
    scientific article; zbMATH DE number 247060

      Statements

      New Estimates for Multilevel Algorithms Including the V-Cycle (English)
      0 references
      0 references
      0 references
      15 August 1993
      0 references
      multigrid methods
      0 references
      rate estimates
      0 references
      Quasi-uniform finite element approximation
      0 references
      Local mesh refinement
      0 references
      local smoothing
      0 references
      symmetric multigrid \(V\)-cycle method
      0 references
      The authors provide new abstract estimates for the additive and, especially, for the multiplicative (standard) multigrid methods. Weakening the approximation property, they can obtain level-independent rate estimates, e.g., for the following cases: 1) Quasi-uniform finite element approximation to symmetric elliptic boundary value problems which do not necessarily satisfy the full elliptic regularity condition, e.g. the theory covers changing boundary conditions and domains with cracks in \(2D\); 2) Local mesh refinement combined with local smoothing; 3) The curved boundary case with special approximations on the coarser grids near the boundary. In all these cases, uniform rate estimates are obtained for the additive version as well as for the standard (multiplicative) symmetric multigrid \(V\)-cycle method with one pre- and post-smoothing step. The results for the multiplicative version can be generalized to other cycling strategies, more smoothing steps and to the non-symmetric setting.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references