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
R Vazquez
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 | |
---|---|---|---|
prod_486128-doc_201633.pdf
Open Access dal 01/06/2024
Descrizione: Adaptive isogeometric methods with C1 (truncated) hierarchical splines on planar multi-patch domains
Tipologia:
Documento in Post-print
Licenza:
Altro tipo di licenza
Dimensione
5.91 MB
Formato
Adobe PDF
|
5.91 MB | Adobe PDF | Visualizza/Apri |
prod_486128-doc_201634.pdf
solo utenti autorizzati
Descrizione: Adaptive isogeometric methods with C1 (truncated) hierarchical splines on planar multi-patch domains
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
9.52 MB
Formato
Adobe PDF
|
9.52 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.