Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
MetadataShow full item record
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.
Paper presented at International Conference on Computational Science, ICCS 2011
Showing items related by title, author, creator and subject.
Sabzalisenejani, Ali (1998)The effective shear strength of artificially overconsolidated clays with continuous fissures, or with discontinuous or partial fissuring, has been discussed from both the experimental and numerical points of view.Direct ...
Directional fractal signature methods for trabecular bone texture in hand radiographs: Data from the Osteoarthritis InitiativeWolski, M.; Podsiadlo, P.; Stachowiak, Gwidon (2014)Purpose: To develop directional fractal signature methods for the analysis of trabecular bone (TB) texture in hand radiographs. Problems associated with the small size of hand bones and the orientation of fingers were ...
Tuthill, John D. (1995)In antenna array processing it is generally required to enhance the reception or detection of a signal from a particular direction while suppressing noise and interference signals from other directions. An optimisation ...