.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
boundary integral equations
panel-clustering method
Galerkin boundary element method
alternative representations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.8K
被引数:
9.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容