Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis

Handle URI:
http://hdl.handle.net/10754/552533
Title:
Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis
Authors:
Calo, Victor M. ( 0000-0002-1805-4045 ) ; Collier, Nathaniel O.; Pardo, David; Paszyński, Maciej R.
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.
KAUST Department:
Applied Mathematics and Computational Science Program; Earth Science and Engineering Program
Citation:
Computational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis 2011, 4:1854 Procedia Computer Science
Journal:
Procedia Computer Science
Issue Date:
14-May-2011
DOI:
10.1016/j.procs.2011.04.201
Type:
Article
ISSN:
18770509
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S1877050911002596
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Earth Science and Engineering Program

Full metadata record

DC FieldValue Language
dc.contributor.authorCalo, Victor M.en
dc.contributor.authorCollier, Nathaniel O.en
dc.contributor.authorPardo, Daviden
dc.contributor.authorPaszyński, Maciej R.en
dc.date.accessioned2015-05-10T14:29:17Zen
dc.date.available2015-05-10T14:29:17Zen
dc.date.issued2011-05-14en
dc.identifier.citationComputational complexity and memory usage for multi-frontal direct solvers used in p finite element analysis 2011, 4:1854 Procedia Computer Scienceen
dc.identifier.issn18770509en
dc.identifier.doi10.1016/j.procs.2011.04.201en
dc.identifier.urihttp://hdl.handle.net/10754/552533en
dc.description.abstractThe 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.en
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1877050911002596en
dc.rightsArchived with thanks to Procedia Computer Science. http://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectMulti-frontal direct solveren
dc.subjectcomputational complexityen
dc.subjectmemory usageen
dc.titleComputational complexity and memory usage for multi-frontal direct solvers used in p finite element analysisen
dc.typeArticleen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentEarth Science and Engineering Programen
dc.identifier.journalProcedia Computer Scienceen
dc.eprint.versionPublisher's Version/PDFen
dc.contributor.institutionDepartment of Applied Mathematics, Statistics, and Operational Research, Univsersity of the Basque Country and Ikerbasque, Bilbao, Spainen
kaust.authorCalo, Victor M.en
kaust.authorCollier, Nathaniel Orenen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.