Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-21888
Krzebek, N; Sauter, S (2003). Fast cluster techniques for BEM. Engineering Analysis with Boundary Elements, 27(5):455-467.
View at publisher
In this paper, we will present a new approach for solving boundary integral equations with panel clustering. In contrast to all former versions of panel clustering, the computational and storage complexity of the algorithm scales linearly with respect to the number of degrees of freedom without any additional logarithmic factors. The idea is to develop alternative formulations of all classical boundary integral operators for the Laplace problem where the kernel function has a reduced singular behaviour. It turns out that the application of the panel-clustering method with variable approximation order preserves the asymptotic convergence rate of the discretisation and has significantly reduced complexity.
12 downloads since deposited on 29 Nov 2010
4 downloads since 12 months
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Dewey Decimal Classification:||510 Mathematics|
|Uncontrolled Keywords:||Boundary integral equations; Panel-clustering method; Galerkin boundary element method; Alternative representations|
|Deposited On:||29 Nov 2010 16:26|
|Last Modified:||04 Jan 2014 17:02|
|Additional Information:||Copyright © 2003 Published by Elsevier Science Ltd.|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page