Skip to main content
Log in

Convergence analysis of geometrical multigrid methods for solving data-sparse boundary element equations

  • Regular article
  • Published:
Computing and Visualization in Science

Abstract

The convergence analysis of multigrid methods for boundary element equations arising from negative-order pseudo-differential operators is quite different from the usual finite element multigrid analysis for elliptic partial differential equations. In this paper, we study the convergence of geometrical multigrid methods for solving large-scale, data-sparse boundary element equations. In particular, we investigate multigrid methods for \(\mathcal{H}\)-matrices arising from the adaptive cross approximation to the single layer potential operator.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Andjelić Z., Smajić J. and Conry M. (2007). BEM-based simulations in engineering design. In: Schanz, M. and Steinbach, O. (eds) Boundary Element Analysis: Mathematical Aspects and Applications, pp 281–352. Springer, Berlin

    Chapter  Google Scholar 

  2. Bebendorf M. (2000). Approximation of boundary element matrices. Numer. Math. 86: 565–589

    Article  MATH  MathSciNet  Google Scholar 

  3. Bebendorf, M.: Effiziente numerische Lösung von Randintegralgleichungen unter Verwendung von Niedrigrang-Matrizen. PhD thesis, Universität Saarbrücken, 2000

  4. Bebendorf M. and Grzibovski R. (2006). Accelerating Galerkin BEM for linear elasticity using adaptive cross approximation. Mathematical Methods in Applied Sciences 29: 1721–1747

    Article  MATH  Google Scholar 

  5. Bebendorf M. and Rjasanow S. (2003). Adaptive low-rank approximation of collocation matrices.. Computing 70(1): 1–24

    Article  MATH  MathSciNet  Google Scholar 

  6. Bramble J.H., Goldstein C.I. and Pasciak J.E. (1994). Analysis of V-cycle multigrid algorithms for forms defined by numerical quadrature. SIAM Sci. Stat. Comput. 15: 566–576

    Article  MATH  MathSciNet  Google Scholar 

  7. Bramble J.H., Leyk Z. and Pasciak J.E. (1994). The analysis of multigrid algorithms for pseudo-differential operators of order minus one. Math. Comput. 63(208): 461–478

    Article  MATH  MathSciNet  Google Scholar 

  8. Bramble J.H. and Pasciak J.E. (1993). New estimates for multilevel algorithms including the V-cycle. Math. Comput. 60: 447–471

    Article  MATH  MathSciNet  Google Scholar 

  9. Bramble, J.H., Zhang, X.: The analysis of multigrid methods. In: Ciarlet, P., Lions, J.L. (eds.) The Handbook for Numerical Analysis, vol. VIII, pp. 173–415. North-Holland, Amsterdam (2000)

  10. Brandt A. and Lubrecht A.A. (1990). Multilevel matrix multiplication and fast solution of integral equations. J. Comput. Phys. 90: 348–370

    Article  MATH  MathSciNet  Google Scholar 

  11. Carstensen C., Kuhn M. and Langer U. (1998). Fast parallel solvers for symmetric boundary element domain decomposition equations. Numer. Math. 79: 321–347

    Article  MATH  MathSciNet  Google Scholar 

  12. Dahmen W., Prössdorf S. and Schneider R. (1994). Wavelet approximation methods for pseudodifferential equations i: Stability and convergence. Math. Zeitschrift 215: 583–620

    Article  MATH  Google Scholar 

  13. Falgout R.D. and Vassilevski P.S. (2004). On generalizing the AMG framework. SIAM J. Numer. Anal. 42(4): 1669–1693

    Article  MATH  MathSciNet  Google Scholar 

  14. Falgout R.D., Vassilevski P.S. and Zikatanov L.T. (2005). On the two-grid convergence estimates. Numer. Linear Algebra Appl. 12(5–6): 471–494

    Article  MathSciNet  Google Scholar 

  15. Fischer M., Perfahl H. and Gaul L. (2005). Approximate inverse preconditioning for the fast multipole BEM in acoustics. Comput. Vis. Sci. 8(3–4): 169–177

    Article  MathSciNet  Google Scholar 

  16. Giebermann, K.: Schnelle Summationsverfahren zur numerischen Lösung von Integralgleichungen für Streuprobleme in R 3. PhD thesis, Universität Karlsruhe, 1997

  17. Greengard L. and Rokhlin V. (1987). A fast algorithm for particle simulations.. J. Comput. Phys. 73(2): 325–348

    Article  MATH  MathSciNet  Google Scholar 

  18. Hackbusch W. (1985). Multigrid methods and application. Springer, Berlin

    Google Scholar 

  19. Hackbusch, W.: A sparse matrix arithmetic based on \(\mathcal{H}\)-matrices. Computing 62(2), 89–108 (1999)

    Google Scholar 

  20. Hackbusch W. and Nowak Z.P. (1989). On the fast matrix multiplication in the boundary element method by panel clustering. Numer. Math. 54(4): 463–491

    Article  MATH  MathSciNet  Google Scholar 

  21. Jung M. and Langer U. (1991). Applications of multilevel methods to practical problems. Surv. Math. Indust. 1: 217–257

    MATH  MathSciNet  Google Scholar 

  22. Kurz S., Rain O. and Rjasanow S. (2002). The adaptive cross approximation technique for the 3-D boundary element method. IEEE Trans. Magn. 38(2): 421–424

    Article  Google Scholar 

  23. Lage C. and Schwab C. (1999). Wavelet Galerkin algorithms for boundary integral equations. SIAM J. Sci. Comput. 20: 2195–2222

    Article  MATH  MathSciNet  Google Scholar 

  24. Langer U. (1994). Parallel iterative solution of symmetric coupled FE/BE-equations via domain decomposition. Contemp. Math. 157: 335–344

    Google Scholar 

  25. Langer U. and Pusch D. (2005). Data-sparse algebraic multigrid methods for large scale boundary element equations. Appl. Numer. Math. 54: 406–424

    Article  MATH  MathSciNet  Google Scholar 

  26. Langer U., Pusch D. and Reitzinger S. (2003). Efficient preconditioners for boundary element matrices based on grey-box algebraic multigrid methods. Int. J. Numer. Methods Eng. 58(13): 1937–1953

    Article  MATH  MathSciNet  Google Scholar 

  27. Langer U. and Steinbach O. (2003). Boundary element tearing and interconnecting methods. Computing 71(3): 205–228

    Article  MATH  MathSciNet  Google Scholar 

  28. Of G., Steinbach O. and Wendland W.L. (2005). Applications of a fast multipole Galerkin boundary element method in linear elastostatics. Comput. Vis. Sci 8(3–4): 201–209

    Article  MathSciNet  Google Scholar 

  29. Rjasanow S. (1987). Zweigittermethode für eine Modellaufgabe bei BEM Diskretisierung. Wiss. Z. d. TU Karl-Marx-Stadt 29: 230–235

    MATH  MathSciNet  Google Scholar 

  30. Rokhlin V. (1985). Rapid solution of integral equations of classical potential theory. J. Comput. Phys. 60(2): 187–207

    Article  MATH  MathSciNet  Google Scholar 

  31. Sauter, S.A., Schwab, C.: Randelementemethoden: Analyse, Numerik und Implementierung schneller Algorithmen. Teubner, Stuttgart (2004)

  32. Steinbach, O.: Numerische Näherungsverfahren für elliptische Randwert-probleme: Finite Elemente und Randelemente. Teubner, Stuttgart (2003)

  33. Petersdorff, T. von , Stephan, E.P (1992). Multigrid solvers and preconditioners for first kind integral equations. Numer. Methods Partial Differ. Equations 8: 443–450

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ulrich Langer.

Additional information

Communicated by P. Hemker.

This work has been supported by the Austrian Science Fund ‘Fonds zur Förderung der wissenschaftlichen Forschung (FWF)’ under the grant P14953 “Robust Algebraic Multigrid Methods and their Parallelization”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Langer, U., Pusch, D. Convergence analysis of geometrical multigrid methods for solving data-sparse boundary element equations. Comput. Visual Sci. 11, 181–189 (2008). https://doi.org/10.1007/s00791-007-0067-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00791-007-0067-8

Keywords

Navigation