Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
dc.contributor.author | Calo, Victor | |
dc.contributor.author | Collier, N. | |
dc.contributor.author | Pardo, D. | |
dc.contributor.author | Paszynski, M. | |
dc.date.accessioned | 2017-03-24T11:53:44Z | |
dc.date.available | 2017-03-24T11:53:44Z | |
dc.date.created | 2017-03-23T06:59:53Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | Calo, V. and Collier, N. and Pardo, D. and Paszynski, M. 2011. Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis. Procedia Computer Science. 4: pp. 1854-1861. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/51496 | |
dc.identifier.doi | 10.1016/j.procs.2011.04.201 | |
dc.description.abstract |
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. | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | |
dc.title | Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis | |
dc.type | Conference Paper | |
dcterms.source.volume | 4 | |
dcterms.source.startPage | 1854 | |
dcterms.source.endPage | 1861 | |
dcterms.source.issn | 1877-0509 | |
dcterms.source.title | Procedia Computer Science | |
dcterms.source.series | Procedia Computer Science | |
curtin.note |
Paper presented at International Conference on Computational Science, ICCS 2011 | |
curtin.department | Department of Applied Geology | |
curtin.accessStatus | Open access |