Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

2012/04/08 by Collier, Nathan, Pardo, David, Paszynski, Maciej +1
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1204.1718

Abstract

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse 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 B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from C^p-1 polynomial B-spline spaces and compare them to those obtained using C⁰ spaces.

Related

• A Fast and Memory Efficient Sparse Solver with Applications to Finite-Element Matrices
• The cost of continuity: performance of iterative solvers on isogeometric finite elements
• A study of concurrent multi-frontal solvers for modern massively parallel architectures
• A two-scale approach for efficient on-the-fly operator assembly in massively parallel high performance multigrid codes
• Multi-resolution Isogeometric Analysis -- Efficient adaptivity utilizing the multi-patch structure