Show simple item record

dc.contributor.authorCalo, Victor
dc.contributor.authorCollier, N.
dc.contributor.authorPardo, D.
dc.contributor.authorPaszynski, M.
dc.date.accessioned2017-03-24T11:53:44Z
dc.date.available2017-03-24T11:53:44Z
dc.date.created2017-03-23T06:59:53Z
dc.date.issued2011
dc.identifier.citationCalo, 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.urihttp://hdl.handle.net/20.500.11937/51496
dc.identifier.doi10.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.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/
dc.titleComputational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
dc.typeConference Paper
dcterms.source.volume4
dcterms.source.startPage1854
dcterms.source.endPage1861
dcterms.source.issn1877-0509
dcterms.source.titleProcedia Computer Science
dcterms.source.seriesProcedia Computer Science
curtin.note

Paper presented at International Conference on Computational Science, ICCS 2011

curtin.departmentDepartment of Applied Geology
curtin.accessStatusOpen access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc-nd/3.0/
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-nd/3.0/