Sign in
Back
Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
Conference proceeding   Open access  Peer reviewed

Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis

Victor M. Calo, Nathaniel O. Collier, David Pardo and Maciej R. Paszynski
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (ICCS), Vol.4, pp.1854-1861
Procedia Computer Science
01/01/2011
DOI: https://doi.org/10.1016/j.procs.2011.04.201

Abstract

Computer Science Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology
The multi-frontal direct solver is the state of the art for the direct solution of linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from p finite elements. Specifically we provide the estimates for systems resulting from C-0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis.
url
https://doi.org/10.1016/j.procs.2011.04.201View
Published (Version of record) Open

Metrics

1 Record Views

Details