An adaptive isogeometric method based on d-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop (Buffa and Giannelli, 2016). In this paper we provide a complexity estimate, i.e., an estimate on how the number of mesh elements grows with respect to the number of elements that are marked for refinement by the adaptive strategy. Our estimate is in the line of the similar ones proved in the context of adaptive finite element methods.
Complexity of hierarchical refinement for a class of admissible mesh configurations
A Buffa;C Giannelli;
2016
Abstract
An adaptive isogeometric method based on d-variate hierarchical spline constructions can be derived by considering a refine module that preserves a certain class of admissibility between two consecutive steps of the adaptive loop (Buffa and Giannelli, 2016). In this paper we provide a complexity estimate, i.e., an estimate on how the number of mesh elements grows with respect to the number of elements that are marked for refinement by the adaptive strategy. Our estimate is in the line of the similar ones proved in the context of adaptive finite element methods.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_366780-doc_121171.pdf
non disponibili
Descrizione: Complexity of hierarchical refinement for a class of admissible mesh configurations
Tipologia:
Versione Editoriale (PDF)
Dimensione
361 kB
Formato
Adobe PDF
|
361 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
prod_366780-doc_151564.pdf
accesso aperto
Descrizione: Complexity of hierarchical refinement for a class of admissible mesh configurations
Tipologia:
Versione Editoriale (PDF)
Dimensione
170.84 kB
Formato
Adobe PDF
|
170.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
