arXiv subjects

Hendrik Speleers

Publications and source records attributed to Hendrik Speleers.

26 records · Page 2Linked to original sources

arXiv2020

A general class of $C^1$ smooth rational splines: Application to construction of exact ellipses and ellipsoids

In this paper, we describe a general class of $C^1$ smooth rational splines that enables, in particular, exact descriptions of ellipses and ellipsoids - some of the most important primitives for CAD and CAE. The univariate rational splines are assembled by transforming multiple sets of NURBS basis functions via so-called design-through-analysis compatible extraction matrices; different sets of NURBS are allowed to have different polynomial degrees and weight functions. Tensor products of the univariate splines yield multivariate splines. In the bivariate setting, we describe how similar design-through-analysis compatible transformations of the tensor-product splines enable the construction of smooth surfaces containing one or two polar singularities. The material is self-contained, and is presented such that all tools can be easily implemented by CAD or CAE practitioners within existing software that support NURBS. To this end, we explicitly present the matrices (a) that describe our splines in terms of NURBS, and (b) that help refine the splines by performing (local) degree elevation and knot insertion. Finally, all $C^1$ spline constructions yield spline basis functions that are locally supported and form a convex partition of unity.

math.NA↗

arXiv2020

Explicit error estimates for spline approximation of arbitrary smoothness in isogeometric analysis

In this paper we provide a priori error estimates with explicit constants for both the $L^2$-projection and the Ritz projection onto spline spaces of arbitrary smoothness defined on arbitrary grids. This extends the results recently obtained for spline spaces of maximal smoothness. The presented error estimates are in agreement with the numerical evidence found in the literature that smoother spline spaces exhibit a better approximation behavior per degree of freedom, even for low smoothness of the functions to be approximated. First we introduce results for univariate spline spaces, and then we address multivariate tensor-product spline spaces and isogeometric spline spaces generated by means of a mapped geometry, both in the single-patch and in the multi-patch case.

math.NA↗

arXiv2020

Adaptive refinement with locally linearly independent LR B-splines: Theory and applications

In this paper we describe an adaptive refinement strategy for LR B-splines. The presented strategy ensures, at each iteration, local linear independence of the obtained set of LR B-splines. This property is then exploited in two applications: the construction of efficient quasi-interpolation schemes and the numerical solution of elliptic problems using the isogeometric Galerkin method.

math.NA↗

arXiv2020

A Tchebycheffian extension of multi-degree B-splines: Algorithmic computation and properties

In this paper we present an efficient and robust approach to compute a normalized B-spline-like basis for spline spaces with pieces drawn from extended Tchebycheff spaces. The extended Tchebycheff spaces and their dimensions are allowed to change from interval to interval. The approach works by constructing a matrix that maps a generalized Bernstein-like basis to the B-spline-like basis of interest. The B-spline-like basis shares many characterizing properties with classical univariate B-splines and may easily be incorporated in existing spline codes. This may contribute to the full exploitation of Tchebycheffian splines in applications, freeing them from the restricted role of an elegant theoretical extension of polynomial splines. Numerical examples are provided that illustrate the procedure described.

math.NA↗

arXiv2019

Sharp error estimates for spline approximation: explicit constants, $n$-widths, and eigenfunction convergence

In this paper we provide a priori error estimates in standard Sobolev (semi-)norms for approximation in spline spaces of maximal smoothness on arbitrary grids. The error estimates are expressed in terms of a power of the maximal grid spacing, an appropriate derivative of the function to be approximated, and an explicit constant which is, in many cases, sharp. Some of these error estimates also hold in proper spline subspaces, which additionally enjoy inverse inequalities. Furthermore, we address spline approximation of eigenfunctions of a large class of differential operators, with a particular focus on the special case of periodic splines. The results of this paper can be used to theoretically explain the benefits of spline approximation under $k$-refinement by isogeometric discretization methods. They also form a theoretical foundation for the outperformance of smooth spline discretizations of eigenvalue problems that has been numerically observed in the literature, and for optimality of geometric multigrid solvers in the isogeometric analysis context.

math.NA↗

arXiv2019

Computation of multi-degree B-splines

Multi-degree splines are smooth piecewise-polynomial functions where the pieces can have different degrees. We describe a simple algorithmic construction of a set of basis functions for the space of multi-degree splines, with similar properties to standard B-splines. These basis functions are called multi-degree B-splines (or MDB-splines). The construction relies on an extraction operator that represents all MDB-splines as linear combinations of local B-splines of different degrees. This enables the use of existing efficient algorithms for B-spline evaluations and refinements in the context of multi-degree splines. A Matlab implementation is provided to illustrate the computation and use of MDB-splines.

math.NA↗

arXiv2018

Isogeometric analysis for 2D and 3D curl-div problems: Spectral symbols and fast iterative solvers

Alfvén-like operators are of interest in magnetohydrodynamics, which is used in plasma physics to study the macroscopic behavior of plasma. Motivated by this important and complex application, we focus on a parameter-dependent curl-div problem that can be seen as a prototype of an Alfvén-like operator, and we discretize it using isogeometric analysis based on tensor-product B-splines. The involved coefficient matrices can be very ill-conditioned, so that standard numerical solution methods perform quite poorly here. In order to overcome the difficulties caused by such ill-conditioning, a two-step strategy is proposed. First, we conduct a detailed spectral study of the coefficient matrices, highlighting the critical dependence on the different physical and approximation parameters. Second, we exploit such spectral information to design fast iterative solvers for the corresponding linear systems. For the first goal we apply the theory of (multilevel block) Toeplitz and generalized locally Toeplitz sequences, while for the second we use a combination of multigrid techniques and preconditioned Krylov solvers. Several numerical tests are provided both for the study of the spectral problem and for the solution of the corresponding linear systems.

math.NA↗

arXiv2018

Adaptive isogeometric analysis with hierarchical box splines

Isogeometric analysis is a recently developed framework based on finite element analysis, where the simple building blocks in geometry and solution space are replaced by more complex and geometrically-oriented compounds. Box splines are an established tool to model complex geometry, and form an intermediate approach between classical tensor-product B-splines and splines over triangulations. Local refinement can be achieved by considering hierarchically nested sequences of box spline spaces. Since box splines do not offer special elements to impose boundary conditions for the numerical solution of partial differential equations (PDEs), we discuss a weak treatment of such boundary conditions. Along the domain boundary, an appropriate domain strip is introduced to enforce the boundary conditions in a weak sense. The thickness of the strip is adaptively defined in order to avoid unnecessary computations. Numerical examples show the optimal convergence rate of box splines and their hierarchical variants for the solution of PDEs.

math.NA↗