Fast BEM-solution of Laplace problems with H-matrices and ACA
- 20 March 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 42 (4), 627-630
- https://doi.org/10.1109/tmag.2006.871642
Abstract
The main problems for applying boundary element methods (BEM) in computational electromagnetism are related to the large memory requirements of the matrices and the convergence of the iterative solver. In this paper, we solve a Laplace problem with mixed boundary conditions by making use of a variational symmetric direct boundary integral equation. The Galerkin discretization results in densely populated matrices that are here compressed by adaptive cross approximation. This leads to an approximation of the underlying BEM-operator by means of so-called hierarchical matrices (H-Matrices). These matrices are then used to construct an effective preconditioner for the iterative solver. Numerical experiments demonstrate the application of the methodKeywords
This publication has 14 references indexed in Scilit:
- On the Finite Element Solution of the Pure Neumann ProblemSIAM Review, 2005
- Hierarchical LU Decomposition-based Preconditioners for BEMComputing, 2004
- Fast evaluation of boundary integral operators arising from an eddy current problemJournal of Computational Physics, 2004
- Construction and Arithmetics of H -MatricesComputing, 2003
- Adaptive Low-Rank Approximation of Collocation MatricesComputing, 2003
H Applied Numerical Mathematics, 2002- A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -MatricesComputing, 1999
- A new version of the Fast Multipole Method for the Laplace equation in three dimensionsActa Numerica, 1997
- On the fast matrix multiplication in the boundary element method by panel clusteringNumerische Mathematik, 1989
- General stress analysis method by means of integral equations and boundary elementsMeccanica, 1979