.png){kind=icon}
返回
Hierarchical node method for solving large-scale sparse linear equations in parallel
.png){kind=icon}
PRE
AI
DOI：10.1007/s10409-023-23350-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the hierarchical node method (HNM) is proposed for solving large-scale sparse linear equations in the context of elastic mechanics. HNM decomposes complex problems into simple subproblems using superposition and reduces computational costs using locality. In HNM, the coarse node stiffness matrix and subdomain stiffness matrix remain unchanged during the iteration process, which makes HNM suitable for solving multiple right-hand side problems. The mapping relationship between coarse nodes and fine nodes is obtained by solving local finite element problems rather than using the interpolation method, which enables HNM to solve complex topology problems rapidly. To accelerate the convergence rate of HNM, an optimal coarse node stiffness matrix is proposed, and a calculation method is provided based on the regularized least squares method. Large-scale numerical experiments show that HNM exhibits excellent scalability and a near-linear speedup. Compared to mainstream algorithms such as multigrid, HNM achieves faster convergence speeds when solving multiple right-hand side problems.
Keyword:
Hierarchical node method
Coarse node stiffness matrix
Large-scale sparse linear equations
Parallel computing
期刊
A
IF:
4.6
论文数:
2.9K
被引数:
4.7K
机构
引用论文
Generation of Human iPSC-derived Neural Progenitor Cells (NPCs) as Drug Discovery Model for Neurological and Mitochondrial Disorders.png)
BIO-PROTOCOL
OAAI
BIO-PROTOCOLIF0
OAAI分享收藏
查看更多内容