View Item 

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

Access Status
Open access
Authors
Calo, Victor
Collier, N.
Pardo, D.
Paszynski, M.
Date
2011
Type
Conference Paper

Metadata
Show full item record
Citation
Calo, V. and Collier, N. and Pardo, D. and Paszynski, M. 2011. Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis. Procedia Computer Science. 4: pp. 1854-1861.
Source Title
Procedia Computer Science
DOI
ISSN
School
Department of Applied Geology
Rights
Remarks

Paper presented at International Conference on Computational Science, ICCS 2011

URI
Collection
Abstract

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 C0 polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis. © 2011 Published by Elsevier Ltd.

http://creativecommons.org/licenses/by-nc-nd/3.0/
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-nd/3.0/