Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well suited for the representation of complex geometries, and to maintain high continuity on general domains special constructions on multi-patch geometries must be used. In this paper we focus on adaptive isogeometric methods with hierarchical splines, and extend the construction of C^1 isogeometric spline spaces on multi-patch planar domains to the hierarchical setting. We replace the hypothesis of local linear independence for the basis of each level by a weaker assumption, which still ensures the linear independence of hierarchical splines. We also develop a refinement algorithm that guarantees that the assumption is fulfilled by C^1 splines on certain suitably graded hierarchical multi-patch mesh configurations, and prove that it has linear complexity. The performance of the adaptive method is tested by solving the Poisson and the biharmonic problems.
Adaptive isogeometric methods with C^1 (truncated) hierarchical splines on planar multi-patch domains / Cesare Bracco; Carlotta Giannelli; Mario Kapl; Rafael Vàzquez. - In: MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES. - ISSN 0218-2025. - STAMPA. - 33:(2023), pp. 1829-1874. [10.1142/S0218202523500434]
Adaptive isogeometric methods with C^1 (truncated) hierarchical splines on planar multi-patch domains
Cesare Bracco;Carlotta Giannelli;
2023
Abstract
Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well suited for the representation of complex geometries, and to maintain high continuity on general domains special constructions on multi-patch geometries must be used. In this paper we focus on adaptive isogeometric methods with hierarchical splines, and extend the construction of C^1 isogeometric spline spaces on multi-patch planar domains to the hierarchical setting. We replace the hypothesis of local linear independence for the basis of each level by a weaker assumption, which still ensures the linear independence of hierarchical splines. We also develop a refinement algorithm that guarantees that the assumption is fulfilled by C^1 splines on certain suitably graded hierarchical multi-patch mesh configurations, and prove that it has linear complexity. The performance of the adaptive method is tested by solving the Poisson and the biharmonic problems.File | Dimensione | Formato | |
---|---|---|---|
paper_MultiPatch-m3as.pdf
accesso aperto
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Solo lettura
Dimensione
6.02 MB
Formato
Adobe PDF
|
6.02 MB | Adobe PDF | |
Adaptive_C1_multi-patch_domains.pdf
Accesso chiuso
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Solo lettura
Dimensione
9.65 MB
Formato
Adobe PDF
|
9.65 MB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.