Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
KAUST DepartmentApplied Mathematics and Computational Science Program
Earth Science and Engineering Program
MetadataShow full item record
AbstractThe 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.
CitationComputational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis 2011, 4:1854 Procedia Computer Science
JournalProcedia Computer Science
Conference/Event name11th International Conference on Computational Science, ICCS 2011