Skip to main content

Estimation of the Condition Number of Additive Preconditioners on Tensor Product Grids

  • Conference paper
Multigrid Methods VI

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

  • 414 Accesses

Abstract

It is presented a new technique to estimate the condition number of additive preconditioners. This technique leads to small bounds of the condition number. We apply this technique to the BPX preconditioner on a tensor product grid.

It is proved that the lower eigenvalue of this preconditioner is larger than 0.0717. Using the standard approach for estimating the upper eigenvalue, shows that the upper eigenvalue is smaller than 37.7. This implies that the condition number of the BPX preconditioner is smaller than 526. This estimation implies that 16 cgiterations applied to the BPX preconditioner reduce the algebraic error by a factor 0.233 independent of the number of levels. This also holds for domains with reentrant corners.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.

References

  1. F. Bornemann and H. Yserentant. A basic norm equivalence for the theory of multilevel methods. Numer. Math., 64: 455–476, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. H. Bramble, J. E. Pasciak, and J. Xu. Parallel multilevel preconditioners. Math. Comp., 55 (191): 1–22, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  3. P.W. Hemker and C. Pflaum. Approximation on partially ordered sets of regular grids. Applied Numerical Mathematics, 25 (1): 55–87, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Oswald. Multilevel Finite Element Approximation. Teubner Skripten zur Numerik, Hrsg.: H.G.Bock, W.Hackbusch, R.Rannacher. Teubner, Stuttgart, 1994.

    Google Scholar 

  5. C. Pflaum. Fast and robust multilevel algorithms. Habilitationsschrift, Universität Würzburg, 1999.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. H. Yserentant. On the multi-level splitting of finite element spaces. Numer. Math., 49: 379–412, 1986.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pflaum, C. (2000). Estimation of the Condition Number of Additive Preconditioners on Tensor Product Grids. In: Dick, E., Riemslagh, K., Vierendeels, J. (eds) Multigrid Methods VI. Lecture Notes in Computational Science and Engineering, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58312-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58312-4_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67157-2

  • Online ISBN: 978-3-642-58312-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics