MiS Preprint Repository
We have decided to discontinue the publication of preprints on our preprint server end of 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.
Accelerating Galerkin BEM for Linear Elasticity using Adaptive Cross Approximation
Mario Bebendorf and Richard GrzibovskiAbstract
The adaptive cross approximation (ACA) algorithm provides a means to compute data-sparse approximants of discrete integral formulations of elliptic boundary value problems with almost linear complexity. ACA uses only few of the original entries for the approximation of the whole matrix and is therefore well-suited to speed up existing computer codes. In this article we extend the convergence proof of ACA to Galerkin discretizations. Additionally, we prove that ACA can be applied to integral formulations of systems of second-order elliptic operators without adaptation to the respective problem. The results of applying ACA to boundary integral formulations of linear elasticity are reported. Furthermore, we comment on recent implementation issues of ACA for nonsmooth boundaries.
- Received:
- 02.05.06
- Published:
- 02.05.06
- MSC Codes:
- 65D05, 65D15, 65F05