Element-based B-spline basis function spaces: construction and application in isogeometric analysis
Peng Yang, Maodong Pan, Falai Chen, Zhimin Zhang
TL;DR
The paper introduces an element-based construction of B-spline spaces, termed B-spline elements, that unifies the local, elementwise viewpoint of finite elements with the global, CAD-driven B-spline framework used in isogeometric analysis. By representing the global basis as explicit linear combinations of local element bases and employing Hermite interpolation, the method enables node- and derivative-matching without solving global systems, while maintaining optimal approximation properties even at maximal smoothness. The framework extends naturally to isogeometric analysis by decomposing geometric mappings into element contributions and enabling FEM-like assembly with nonuniform knot vectors, supported by explicit basis representations and a rigorous error theory. Numerical experiments in 2D show optimal convergence and superconvergence phenomena under uniform knots, and 3D tests demonstrate substantial computational gains with nonuniform knot configurations, validating both accuracy and efficiency. The work offers a practical, theoretically sound path to more efficient IgA implementations and provides a foundation for further adaptive refinement and higher-dimensional extensions.
Abstract
This paper develops a unified theoretical framework for constructing B-spline basis function spaces with structural equivalence to finite element spaces. The theory rigorously establishes that these bases emerge as explicit linear combinations of B-spline element bases. For any prescribed smoothness requirements, this element-wise formulation enables the Hermite interpolation at nodes, which directly utilizes function values and derivatives without solving global linear systems. By focusing on explicit interpolation properties, element-wise analysis establishes optimal approximation errors, even when the space smoothness attains its theoretical maximum for the space degree. In isogeometric analysis (IgA), the construction naturally decomposes geometric mappings into element-level representations, allowing efficient computations across elements regardless of node distribution. Notably, the same Hermite interpolation framework simultaneously handles domain parameterization and IgA solutions, allowing direct imposition of boundary conditions through function and derivative matching. Numerical tests demonstrate optimal convergence rates and superconvergence properties in 2D IgA under uniform knot configurations, and improved computational efficiency in 3D IgA with non-uniform knot distributions.
