Multi-level Bézier extraction for hierarchical local refinement of Isogeometric Analysis

- We present a way to implement hierarchically refined Isogeometric Analysis.
- Our main focus is on (Truncated) Hierarchical B-Splines and Isogeometric Analysis.
- We present a concept applicable to different kinds of refinements and functions.
- The proposed local approach is suitable for parallel and non-linear simulations.
- Basic algorithms for knot insertion on spline spaces have been outlined and compared.

One of the main topics of research on Isogeometric Analysis is local refinement. Among the various techniques currently studied and developed, one of the most appealing, referred to as hierarchical B-Splines, consists of defining a suitable set of basis functions on different hierarchical levels. This strategy can also be improved, for example to recover partition of unity, resorting to a truncation operation, giving rise to the so-called truncated hierarchical B-Splines. Despite its conceptual simplicity, implementing the hierarchical definition of shape functions into an existing code can be rather involved. In this work we present a simple way to bring the hierarchical isogeometric concept closer to a standard finite element formulation. Practically speaking, the hierarchy of functions and knot spans is flattened into a sequence of elements being equipped with a standard single-level basis. In fact, the proposed multi-level extraction is a generalization of the classical Bézier extraction and analogously offers a standard element structure to the hierarchical overlay of functions. Moreover, this approach is suitable for an extension to non-linear problems and for a parallel implementation. The multi-level extraction is presented as a general concept that can be applied to different kinds of refinements and basis functions. Finally, few basic algorithms to compute the local multi-level extraction operator for knot insertion on spline spaces are outlined and compared, and some numerical examples are presented.