The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements

Autores
Collier, Nathan; Dalcin, Lisandro Daniel; Calo, Victor; Pardo, David
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form. Specifically, we compare performance of linear solvers when discretizing using C0 B-splines, which span traditional finite element spaces, and Cp−1 B-splines, which represent maximum continuity. We provide theoretical estimates for the increase in cost of the matrix-vector product as well as for the construction and application of black-box preconditioners. We accompany these estimates with numerical results and study their sensitivity to various grid parameters such as element size hand polynomial order of approximation p in addition to the aforementioned continuity of the basis. Finally, we present timing results for a range of preconditioning options for the Laplace problem. We conclude that the matrix-vector product operation is at most 33p2/8 times more expensive for the more continuous space, although for moderately low p, this number is significantly reduced. Moreover, if static condensation is not employed, this number further reduces to at most a value of 8, even for high p. Preconditioning options can be up to p3 times more expensive to set up, although this difference significantly decreases for some popular preconditioners such as incomplete LU factorization.
Fil: Collier, Nathan. King Abdullah University of Science and Technology; Arabia Saudita
Fil: Dalcin, Lisandro Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); Argentina
Fil: Calo, Victor. The University of the Basque Country UPV/EHU and Ikerbasque; España
Fil: Pardo, David. King Abdullah University of Science and Technology; Arabia Saudita
Materia
Isogeometric Analysis
Iterative Solvers
Performance
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/8633

id CONICETDig_6a174a0e4a9ca1d00f4a661ac300b7e0
oai_identifier_str oai:ri.conicet.gov.ar:11336/8633
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite ElementsCollier, NathanDalcin, Lisandro DanielCalo, VictorPardo, DavidIsogeometric AnalysisIterative SolversPerformancehttps://purl.org/becyt/ford/2.3https://purl.org/becyt/ford/2In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form. Specifically, we compare performance of linear solvers when discretizing using C0 B-splines, which span traditional finite element spaces, and Cp−1 B-splines, which represent maximum continuity. We provide theoretical estimates for the increase in cost of the matrix-vector product as well as for the construction and application of black-box preconditioners. We accompany these estimates with numerical results and study their sensitivity to various grid parameters such as element size hand polynomial order of approximation p in addition to the aforementioned continuity of the basis. Finally, we present timing results for a range of preconditioning options for the Laplace problem. We conclude that the matrix-vector product operation is at most 33p2/8 times more expensive for the more continuous space, although for moderately low p, this number is significantly reduced. Moreover, if static condensation is not employed, this number further reduces to at most a value of 8, even for high p. Preconditioning options can be up to p3 times more expensive to set up, although this difference significantly decreases for some popular preconditioners such as incomplete LU factorization.Fil: Collier, Nathan. King Abdullah University of Science and Technology; Arabia SauditaFil: Dalcin, Lisandro Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); ArgentinaFil: Calo, Victor. The University of the Basque Country UPV/EHU and Ikerbasque; EspañaFil: Pardo, David. King Abdullah University of Science and Technology; Arabia SauditaSiam Publications2013-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/8633Collier, Nathan; Dalcin, Lisandro Daniel; Calo, Victor; Pardo, David; The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements; Siam Publications; Siam Journal On Scientific Computing; 35; 2; 3-2013; 767-7841064-8275enginfo:eu-repo/semantics/altIdentifier/doi/10.1137/120881038info:eu-repo/semantics/altIdentifier/url/http://epubs.siam.org/doi/abs/10.1137/120881038?journalCode=sjoce3info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:56:22Zoai:ri.conicet.gov.ar:11336/8633instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:56:22.811CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
title The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
spellingShingle The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
Collier, Nathan
Isogeometric Analysis
Iterative Solvers
Performance
title_short The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
title_full The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
title_fullStr The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
title_full_unstemmed The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
title_sort The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements
dc.creator.none.fl_str_mv Collier, Nathan
Dalcin, Lisandro Daniel
Calo, Victor
Pardo, David
author Collier, Nathan
author_facet Collier, Nathan
Dalcin, Lisandro Daniel
Calo, Victor
Pardo, David
author_role author
author2 Dalcin, Lisandro Daniel
Calo, Victor
Pardo, David
author2_role author
author
author
dc.subject.none.fl_str_mv Isogeometric Analysis
Iterative Solvers
Performance
topic Isogeometric Analysis
Iterative Solvers
Performance
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.3
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form. Specifically, we compare performance of linear solvers when discretizing using C0 B-splines, which span traditional finite element spaces, and Cp−1 B-splines, which represent maximum continuity. We provide theoretical estimates for the increase in cost of the matrix-vector product as well as for the construction and application of black-box preconditioners. We accompany these estimates with numerical results and study their sensitivity to various grid parameters such as element size hand polynomial order of approximation p in addition to the aforementioned continuity of the basis. Finally, we present timing results for a range of preconditioning options for the Laplace problem. We conclude that the matrix-vector product operation is at most 33p2/8 times more expensive for the more continuous space, although for moderately low p, this number is significantly reduced. Moreover, if static condensation is not employed, this number further reduces to at most a value of 8, even for high p. Preconditioning options can be up to p3 times more expensive to set up, although this difference significantly decreases for some popular preconditioners such as incomplete LU factorization.
Fil: Collier, Nathan. King Abdullah University of Science and Technology; Arabia Saudita
Fil: Dalcin, Lisandro Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico Para la Industria Química (i); Argentina
Fil: Calo, Victor. The University of the Basque Country UPV/EHU and Ikerbasque; España
Fil: Pardo, David. King Abdullah University of Science and Technology; Arabia Saudita
description In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form. Specifically, we compare performance of linear solvers when discretizing using C0 B-splines, which span traditional finite element spaces, and Cp−1 B-splines, which represent maximum continuity. We provide theoretical estimates for the increase in cost of the matrix-vector product as well as for the construction and application of black-box preconditioners. We accompany these estimates with numerical results and study their sensitivity to various grid parameters such as element size hand polynomial order of approximation p in addition to the aforementioned continuity of the basis. Finally, we present timing results for a range of preconditioning options for the Laplace problem. We conclude that the matrix-vector product operation is at most 33p2/8 times more expensive for the more continuous space, although for moderately low p, this number is significantly reduced. Moreover, if static condensation is not employed, this number further reduces to at most a value of 8, even for high p. Preconditioning options can be up to p3 times more expensive to set up, although this difference significantly decreases for some popular preconditioners such as incomplete LU factorization.
publishDate 2013
dc.date.none.fl_str_mv 2013-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/8633
Collier, Nathan; Dalcin, Lisandro Daniel; Calo, Victor; Pardo, David; The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements; Siam Publications; Siam Journal On Scientific Computing; 35; 2; 3-2013; 767-784
1064-8275
url http://hdl.handle.net/11336/8633
identifier_str_mv Collier, Nathan; Dalcin, Lisandro Daniel; Calo, Victor; Pardo, David; The Cost of Continuity: Performance of Iterative Solvers on Isogeometric Finite Elements; Siam Publications; Siam Journal On Scientific Computing; 35; 2; 3-2013; 767-784
1064-8275
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1137/120881038
info:eu-repo/semantics/altIdentifier/url/http://epubs.siam.org/doi/abs/10.1137/120881038?journalCode=sjoce3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Siam Publications
publisher.none.fl_str_mv Siam Publications
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846083098871070720
score 13.22299