Show simple item record

dc.contributor.authorCollier, N.
dc.contributor.authorPardo, D.
dc.contributor.authorPaszynski, M.
dc.contributor.authorCalo, Victor
dc.date.accessioned2017-11-20T08:49:16Z
dc.date.available2017-11-20T08:49:16Z
dc.date.created2017-11-20T08:13:40Z
dc.date.issued2012
dc.identifier.citationCollier, N. and Pardo, D. and Paszynski, M. and Calo, V. 2012. Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements. -. -.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/57841
dc.description.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 $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces.

dc.publisher-
dc.titleComputational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements
dc.typeJournal Article
dcterms.source.volume-
dcterms.source.title-
curtin.departmentDepartment of Applied Geology
curtin.accessStatusFulltext not available


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record