Abstract
We present geometric (GMG) and algebraic multigrid (AMG) preconditioners for data-sparse boundary element matrices. Data-sparse approximation schemes such as adaptive cross approximation (ACA) yield an almost linear behavior in N h , where N h is the number of (boundary) unknowns. The treated system matrix represents the discretized single layer potential operator (SLP) resulting from the interior Dirichlet boundary value problem for the Laplace equation. It is well known, that the SLP has converse spectral properties compared to usual finite element matrices. Therefore, multigrid components have to be adapted properly. In the case of GMG we present convergence rate estimates for the data-sparse ACA version. Again, uniform convergence can be shown for the V-cycle.
Iterative solvers dramatically suffer from the ill-conditioness of the underlying system matrix for growing N h . Our multigrid-preconditioners avoid the increase of the iteration numbers and result in almost optimal solvers with respect to the total complexity. The corresponding numerical 3D experiments are confirming the superior preconditioning properties for the GMG as well as for the AMG approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bebendorf, M.: Approximation of Boundary Element Matrices. Numerische Mathematik 86, 565–589 (2000)
Bebendorf, M., Rjasanov, S.: Adaptive Low-Rank Approximation of Collocation Matrices. Computing 70(1), 1–24 (2003)
Bramble, J.H., Leyk, Z., Pasciak, J.E.: The Analysis of Multigrid Algorithms for Pseudo-Differential Operators of Order Minus One. Math. Comp. 63(208), 461–478 (1994)
Bramble, J.H., Zhang, X.: The analysis of multigrid methods. In: Ciarlet, P., Lions, J.L. (eds.) Handbook for Numerical Analysis, vol. VII, pp. 173–415. North- Holland, Amsterdam (2000)
Haase, G., Heise, B., Kuhn, M., Langer, U.: Adaptive domain decomposition methods for finite and boundary element equations. In: Wendland, W. (ed.) Boundary Element Topics, pp. 121–147. Springer, Berlin (1998)
Hackbusch, W.: A Sparse Matrix Arithmetic based on H-Matrices. Computing 62(2), 89–108 (1999)
Hackbusch, W., Nowak, Z.P.: On the fast matrix multiplication in the boundary element method by panel clustering. Numer. Math. 54(4), 463–491 (1989)
Johannes Kepler University Linz, Institute of Computational Mathematics. PEBBLES — User’s Guide (1999), http://www.numa.uni-linz.ac.at/Research/Projects/pebbles.html
Lage, C., Schwab, C.: Wavelet Galerkin Algorithms for Boundary Integral Equations. SIAM J. Sci. Comput. 20(2), 2195–2222 (1999)
Langer, U., Pusch, D.: Data-Sparse Algebraic Multigrid Methods for Large Scale Boundary Element Equations. Applied Numerical Mathematics 54, 406–424 (2005)
Langer, U., Pusch, D., Reitzinger, S.: Efficient Preconditioners for Boundary Element Matrices Based on Grey-Box Algebraic Multigrid Methods. International Journal for Numerical Methods in Engineering 58(13), 1937–1953 (2003)
Langer, U., Steinbach, O.: Boundary element tearing and interconnecting methods. Computing 71(3), 205–228 (2003)
Langer, U., Steinbach, O.: Coupled boundary and finite element tearing and interconnecting methods. In: Kornhuber, R., Hoppe, R., Periaux, J., Pironneau, O., Widlund, O., Xu, J. (eds.) Proceedings of the 15th Int. Conference on Domain Decomposition. Lecture Notes in Computational Sciences and Engineering, vol. 40. Springer, Heidelberg (2004)
Rokhlin, V.: Rapid solution of integral equations of classical potential theory. J. Comput. Phys. 60(2), 187–207 (1985)
Steinbach, O.: Numerische Näherungsverfahren für elliptische Randwert-probleme: Finite Elemente und Randelemente. Teubner, Stuttgart, Leipzig, Wiesbaden (2003)
Steinbach, O.: Stability Estimates for Hybrid Coupled Domain Decomposition Methods. Lectures Notes in Mathematics, vol. 1809. Springer, Berlin (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Langer, U., Pusch, D. (2006). Comparison of Geometrical and Algebraic Multigrid Preconditioners for Data-Sparse Boundary Element Matrices. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_13
Download citation
DOI: https://doi.org/10.1007/11666806_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)