Efficient in-score sparse direct solution of large finite element problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61388998%3A_____%2F14%3A00430422" target="_blank" >RIV/61388998:_____/14:00430422 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Efficient in-score sparse direct solution of large finite element problems
Original language description
Sparse direct solvers represent one of the possible approaches to the solution of large problems in FEM. Our approach focuses on minimizing the amount of storage space and computational time required for the solution of a large problem. This is achievedparticularly by using a modified minimum ordering algorithm to reduce the fill-in, therefore, reducing the number of numerical operations needed to compute the solution. Both the factorization and the backsubstitution algorithms are parallelized using the OpenMP library to fully exploit today's multi-core and multi-processor computers. The global stiffness matrix is assembled and stored in-core throughout the computation, using an efficient sparse matrix storage format. We present some details of our sparse direct solver implementation, realized within the framework of our in-house finite element code PMD. We also show the performance results for several large real-world problems taken from the engineering practice and assess the scalab
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů