.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Sparse direct solution
Finite element method
Large sparse Linear systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W