Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
Numerical Analysis
2012-04-10 v1 Numerical Analysis
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 polynomial B-spline spaces and compare them to those obtained using spaces.
Cite
@article{arxiv.1204.1718,
title = {Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements},
author = {Nathan Collier and David Pardo and Maciej Paszynski and Victor M. Calo},
journal= {arXiv preprint arXiv:1204.1718},
year = {2012}
}
Comments
8 pages, 2 figures