A Tchebycheffian extension of multi-degree B-splines: Algorithmic computation and properties
Abstract
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.
Keywords
Cite
@article{arxiv.2001.07967,
title = {A Tchebycheffian extension of multi-degree B-splines: Algorithmic computation and properties},
author = {Rene R. Hiemstra and Thomas J. R. Hughes and Carla Manni and Hendrik Speleers and Deepesh Toshniwal},
journal= {arXiv preprint arXiv:2001.07967},
year = {2020}
}