.png){kind=icon}
.png){kind=icon}
Return
Fast cluster techniques for BEM
.png){kind=icon}
OA
AI
DOI：10.1016/S0955-7997(02)00155-8.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2003 Published by Elsevier Science Ltd.
Keywords:
boundary integral equations
panel-clustering method
Galerkin boundary element method
alternative representations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.8K
Citations:
9.4K
Organization
No organization information available