Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/20.500.11937/51496 |
| _version_ | 1848758712588566528 |
|---|---|
| author | Calo, Victor Collier, N. Pardo, D. Paszynski, M. |
| author_facet | Calo, Victor Collier, N. Pardo, D. Paszynski, M. |
| author_sort | Calo, Victor |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T09:48:21Z |
| format | Conference Paper |
| id | curtin-20.500.11937-51496 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:48:21Z |
| publishDate | 2011 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-514962017-09-13T15:41:42Z Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis Calo, Victor Collier, N. Pardo, D. Paszynski, M. 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. 2011 Conference Paper http://hdl.handle.net/20.500.11937/51496 10.1016/j.procs.2011.04.201 http://creativecommons.org/licenses/by-nc-nd/3.0/ fulltext |
| spellingShingle | Calo, Victor Collier, N. Pardo, D. Paszynski, M. Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title_full | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title_fullStr | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title_full_unstemmed | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title_short | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| title_sort | computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis |
| url | http://hdl.handle.net/20.500.11937/51496 |