The construction of suitable mesh configurations for spline models that provide local refinement capabilities is one of the fundamental components for the analysis and development of adaptive isogeometric methods. We investigate the design and implementation of refinement algorithms for hierarchical B-spline spaces that enable the construction of locally graded meshes. The refinement rules properly control the interaction of basis functions at different refinement levels. This guarantees a bounded number of nonvanishing (truncated) hierarchical B-splines on any mesh element. The performances of the algorithms are validated with standard benchmark problems.
1 January 2019 in Discrete and Continuous Dynamical Systems
We consider an adaptive isogeometric method (AIGM) based on (truncated) hierarchical B-splines and present the study of its numerical properties. By following [10,12,11], optimal convergence rates of the AIGM can be proved when suitable approximation classes are considered. This is in line with the theory of adaptive methods developed for finite elements, recently well reviewed in [43]. The important output of our analysis is the definition of classes of admissibility for meshes underlying hierarchical splines and the design of an optimal adaptive strategy based on these classes of meshes. The adaptivity analysis is validated on a selection of numerical tests. We also compare the results obtained with suitably graded meshes related to different classes of admissibility for 2D and 3D configurations.