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

Victor M. Calo, Nathan Collier, David Pardo, Maciej R. Paszyński

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

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.
Original languageEnglish (US)
Title of host publicationProcedia Computer Science
PublisherElsevier BV
Pages1854-1861
Number of pages8
DOIs
StatePublished - May 22 2011

Fingerprint

Dive into the research topics of 'Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis'. Together they form a unique fingerprint.

Cite this