Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
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...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
-
2012
|
| Online Access: | http://hdl.handle.net/20.500.11937/57841 |
| _version_ | 1848760111961473024 |
|---|---|
| author | Collier, N. Pardo, D. Paszynski, M. Calo, Victor |
| author_facet | Collier, N. Pardo, D. Paszynski, M. Calo, Victor |
| author_sort | Collier, N. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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^0$ spaces. |
| first_indexed | 2025-11-14T10:10:35Z |
| format | Journal Article |
| id | curtin-20.500.11937-57841 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:10:35Z |
| publishDate | 2012 |
| publisher | - |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-578412017-11-20T08:49:16Z Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements Collier, N. Pardo, D. Paszynski, M. Calo, Victor 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^0$ spaces. 2012 Journal Article http://hdl.handle.net/20.500.11937/57841 - restricted |
| spellingShingle | Collier, N. Pardo, D. Paszynski, M. Calo, Victor Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title | Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title_full | Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title_fullStr | Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title_full_unstemmed | Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title_short | Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| title_sort | computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements |
| url | http://hdl.handle.net/20.500.11937/57841 |