Construction of a normalized basis of a univariate quadratic $C^1$ spline space and application to the quasi-interpolation

In this paper, we use the finite element method to construct a new normalized basis of a univariate quadratic $C^1$ spline space. We give a new representation of Hermite interpolant of any piecewise polynomial of class at least $C^1$ in terms of its polar form. We use this representation for constructing several superconvergent and super-superconvergent discrete quasi-interpolants which have an optimal approximation order. This approach is simple and provides an interesting approximation. Numerical results are given to illustrate the theoretical ones.

On splitting for cubic spline wavelets with four zero moments on an interval

В пространстве кубических сплайнов построены вейвлеты, удовлетворяющие однородным граничным условиям Дирихле и обнулению первых четырех моментов. Получены неявные соотношения, связывающие сплайн-коэффициенты разложения на начальном уровне со сплайн-коэффициентами и вейвлет-коэффициентами на вложенном уровне ленточной системой линейных алгебраических уравнений с невырожденной матрицей. После расщепления на четные и нечетные уравнения матрица преобразования имеет пять (вместо трех в случае двух нулевых моментов) диагоналей. Доказано наличие строгого диагонального доминирования по столбцам. Для сравнения использованы вейвлеты с двумя нулевыми моментами и интерполяционные кубические сплайновые вейвлеты. Результаты численных экспериментов показывают, что схема с четырьмя нулевыми моментами точнее при аппроксимации функций, но грубее при аппроксимации второй производной. The article examines the problem of constructing a splitting algorithm for cubic spline wavelets. First, a cubic spline space is constructed for splines with homogeneous Dirichlet boundary conditions. Then, using the first four zero moments, the corresponding wavelet space is constructed. The resulting space consists of cubic spline wavelets that satisfy the orthogonality conditions for all thirddegree polynomials. The originality of the research lies in obtaining implicit relations connecting the coefficients of the spline expansion at the initial level with the spline coefficients and wavelet coefficients at the embedded level by a band system of linear algebraic equations with a nondegenerate matrix. Excluding the even rows of the system, the resulting transformation algorithm is obtained as a solution to a sequence of band systems of linear algebraic equations with five (instead of three in the case of two zero moments) diagonals. The presence of strict diagonal dominance over the columns is proved, which confirms the stability of the computational process. For comparison, we adopt the results of calculations using wavelets orthogonal to first-degree polynomials and interpolating cubic spline wavelets with the property of the best mean-square approximation of the second derivative of the function being approximated. The results of numerical experiments show that the scheme with four zero moments is more accurate in the approximation of functions, but becomes inferior in accuracy to the approximation of the second derivative.

Cs-smooth isogeometric spline spaces over planar bilinear multi-patch parameterizations

The design of globally Cs-smooth (s ≥ 1) isogeometric spline spaces over multi-patch geometries with possibly extraordinary vertices, i.e. vertices with valencies different from four, is a current and challenging topic of research in the framework of isogeometric analysis. In this work, we extend the recent methods Kapl et al. Comput. Aided Geom. Des. 52–53:75–89, 2017, Kapl et al. Comput. Aided Geom. Des. 69:55–75, 2019 and Kapl and Vitrih J. Comput. Appl. Math. 335:289–311, 2018, Kapl and Vitrih J. Comput. Appl. Math. 358:385–404, 2019 and Kapl and Vitrih Comput. Methods Appl. Mech. Engrg. 360:112684, 2020 for the construction of C1-smooth and C2-smooth isogeometric spline spaces over particular planar multi-patch geometries to the case of Cs-smooth isogeometric multi-patch spline spaces of degree p, inner regularity r and of a smoothness s ≥ 1, with p ≥ 2s + 1 and s ≤ r ≤ p − s − 1. More precisely, we study for s ≥ 1 the space of Cs-smooth isogeometric spline functions defined on planar, bilinearly parameterized multi-patch domains, and generate a particular Cs-smooth subspace of the entire Cs-smooth isogeometric multi-patch spline space. We further present the construction of a basis for this Cs-smooth subspace, which consists of simple and locally supported functions. Moreover, we use the Cs-smooth spline functions to perform L2 approximation on bilinearly parameterized multi-patch domains, where the obtained numerical results indicate an optimal approximation power of the constructed Cs-smooth subspace.

Polynomial spline spaces of non-uniform bi-degree on T-meshes: combinatorial bounds on the dimension

Polynomial splines are ubiquitous in the fields of computer-aided geometric design and computational analysis. Splines on T-meshes, especially, have the potential to be incredibly versatile since local mesh adaptivity enables efficient modeling and approximation of local features. Meaningful use of such splines for modeling and approximation requires the construction of a suitable spanning set of linearly independent splines, and a theoretical understanding of the spline space dimension can be a useful tool when assessing possible approaches for building such splines. Here, we provide such a tool. Focusing on T-meshes, we study the dimension of the space of bivariate polynomial splines, and we discuss the general setting where local mesh adaptivity is combined with local polynomial degree adaptivity. The latter allows for the flexibility of choosing non-uniform bi-degrees for the splines, i.e., different bi-degrees on different faces of the T-mesh. In particular, approaching the problem using tools from homological algebra, we generalize the framework and the discourse presented by Mourrain (Math. Comput. 83(286):847–871, 2014) for uniform bi-degree splines. We derive combinatorial lower and upper bounds on the spline space dimension and subsequently outline sufficient conditions for the bounds to coincide.

Counting the dimension of splines of mixed smoothness

In this paper, we study the dimension of bivariate polynomial splines of mixed smoothness on polygonal meshes. Here, “mixed smoothness” refers to the choice of different orders of smoothness across different edges of the mesh. To study the dimension of spaces of such splines, we use tools from homological algebra. These tools were first applied to the study of splines by Billera (Trans. Am. Math. Soc. 310(1), 325–340, 1988). Using them, estimation of the spline space dimension amounts to the study of the Billera-Schenck-Stillman complex for the spline space. In particular, when the homology in positions 1 and 0 of this complex is trivial, the dimension of the spline space can be computed combinatorially. We call such spline spaces “lower-acyclic.” In this paper, starting from a spline space which is lower-acyclic, we present sufficient conditions that ensure that the same will be true for the spline space obtained after relaxing the smoothness requirements across a subset of the mesh edges. This general recipe is applied in a specific setting: meshes of arbitrary topologies. We show how our results can be used to compute the dimensions of spline spaces on triangulations, polygonal meshes, and T-meshes with holes.

A priori error for unilateral contact problems with Lagrange multipliers and isogeometric analysis

In this paper we consider a unilateral contact problem without friction between a rigid body and a deformable one in the framework of isogeometric analysis. We present the theoretical analysis of the mixed problem. For the displacement, we use the pushforward of a nonuniform rational B-spline space of degree $p$ and for the Lagrange multiplier, the pushforward of a B-spline space of degree $p-2$. These choices of space ensure the proof of an inf–sup condition and so on, the stability of the method. We distinguish between contact and noncontact sets to avoid the classical geometrical hypothesis of the contact set. An optimal a priori error estimate is demonstrated without assumption on the unknown contact set. Several numerical examples in two and three dimensions and in small and large deformation frameworks demonstrate the accuracy of the proposed method.