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

Victor M. Calo; Nathaniel O. Collier; David Pardo; Maciej R. Paszynski

doi:10.1016/j.procs.2011.04.201

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

Victor M. Calo, Nathaniel O. Collier, David Pardo, Maciej R. Paszynski

Research output: Contribution to journal › Conference article › peer-review

31 Scopus citations

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 C⁰ polynomial spaces spanned by B-splines. The structured grid and uniform polynomial order used in isogeometric meshes simplifies the analysis.

Original language	English
Pages (from-to)	1854-1861
Number of pages	8
Journal	Procedia Computer Science
Volume	4
DOIs	https://doi.org/10.1016/j.procs.2011.04.201
State	Published - 2011
Externally published	Yes
Event	11th International Conference on Computational Science, ICCS 2011 - Singapore, Singapore Duration: Jun 1 2011 → Jun 3 2011

Funding

DP has been partially supported by the Spanish Ministry of Sciences and Innovation Grant MTM2010-16511. MRP has been partially supported by the Polish MNiSW grant no. NN 519 405737 and NN519 447 739.

Keywords

Computational complexity, memory usage
Multi-frontal direct solver

Access to Document

10.1016/j.procs.2011.04.201

Cite this

@article{f551c257afdc4426b85c8839b1b82ab1,

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

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.",

keywords = "Computational complexity, memory usage, Multi-frontal direct solver",

author = "Calo, \{Victor M.\} and Collier, \{Nathaniel O.\} and David Pardo and Paszynski, \{Maciej R.\}",

year = "2011",

doi = "10.1016/j.procs.2011.04.201",

language = "English",

volume = "4",

pages = "1854--1861",

journal = "Procedia Computer Science",

issn = "1877-0509",

publisher = "Elsevier",

note = "11th International Conference on Computational Science, ICCS 2011 ; Conference date: 01-06-2011 Through 03-06-2011",

}

TY - JOUR

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

AU - Calo, Victor M.

AU - Collier, Nathaniel O.

AU - Pardo, David

AU - Paszynski, Maciej R.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Computational complexity, memory usage

KW - Multi-frontal direct solver

UR - https://www.scopus.com/pages/publications/79958294063

U2 - 10.1016/j.procs.2011.04.201

DO - 10.1016/j.procs.2011.04.201

M3 - Conference article

AN - SCOPUS:79958294063

SN - 1877-0509

VL - 4

SP - 1854

EP - 1861

JO - Procedia Computer Science

JF - Procedia Computer Science

T2 - 11th International Conference on Computational Science, ICCS 2011

Y2 - 1 June 2011 through 3 June 2011

ER -

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

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this