Sparse direct solver for large finite element problems based on the minimum degree algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61388998%3A_____%2F17%3A00479231" target="_blank" >RIV/61388998:_____/17:00479231 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S0965997817302582" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0965997817302582</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.advengsoft.2017.03.004" target="_blank" >10.1016/j.advengsoft.2017.03.004</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Sparse direct solver for large finite element problems based on the minimum degree algorithm

Popis výsledku v původním jazyce

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 Duffis 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.

Název v anglickém jazyce

Sparse direct solver for large finite element problems based on the minimum degree algorithm

Popis výsledku anglicky

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 Duffis 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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20301 - Mechanical engineering

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Advances in Engineering Software

ISSN

0965-9978

e-ISSN

—

Svazek periodika

113

Číslo periodika v rámci svazku

November

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

5

Strana od-do

2-6

Kód UT WoS článku

000413675600002

EID výsledku v databázi Scopus

2-s2.0-85015948512