.png){kind=icon}
返回
A domain decomposition tool for boundary element methods
.png){kind=icon}
PRE
AI
DOI：10.1016/j.enganabound.2007.03.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Domain decomposition boundary element methods have become increasingly popular over the last several years for a variety of reasons. In particular, these methods reduce the storage and CPU requirements, can result in sparse linear systems, are easy to parallelize, and, when used in conjunction with a dual reciprocity method, can significantly improve the conditioning of the associated linear system. Nevertheless, for complex geometries, determining an appropriate decomposition of the domain can be extremely difficult. A domain decomposition tool based on a graph partitioning algorithm is presented to automate the process and provide quality decompositions. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
domain decomposition BEM
graph decomposition
kernighan-lin method
neumann-neumann iteration
particular solution method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.9K
被引数:
9.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容