.png){kind=icon}
返回
Sparse direct solver for large finite element problems based on the minimum degree algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2017.03.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A sparse direct solver for large problems from solid continuum mechanics based on the minimum degree algorithm is proposed and tested. The solver is designed to take advantage of the properties of the finite element method, particularly the structure of the finite element mesh. For the minimization of the fill-in in the matrix factors a modification of the approximate minimum degree ordering algorithm of Amestoy, Davis and Duff is utilized. The employed sparse matrix storage format and the algorithms for each of the solver phases are also described. The results of numerical tests of the solver on large real-world finite element problems are presented and its performance is compared to a frontal solver and the PARDISO sparse direct solver. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Sparse direct solution
Finite element method
Large sparse Linear systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
3.3K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容