Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
From MaRDI portal
Publication:6232172
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.
This page was built for publication: Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232172)
