Related papers: Cubic spline functions revisited
Explicit pointwise error bounds for the interpolation of a smooth function by piecewise exponential splines of order four are given. Estimates known for cubic splines are extended to a natural class of piecewise exponential splines which…
A New Error Bound for shifted surface spline interpolation is presented. This error bound probably is the most powerful one up to now.
This work presents a new interpolation tool, namely, cubic $q$-spline. Our new analogue generalizes a well known classical cubic spline. This analogue, based on the Jackson $q$-derivative, replaces an interpolating piecewise cubic…
In the context of cubic splines, the authors have contributed to a recent paper dealing with the computation of nonlinear derivatives at the interior nodes so that monotonicity is enforced while keeping the order of approximation of the…
The Numerical Recipes series of books are a useful resource, but all the algorithms they contain cannot be used within open-source projects. In this paper we develop drop-in alternatives to the two algorithms they present for cubic spline…
Given a non-uniform criss-cross partition of a rectangular domain $\Omega$, we analyse the error between a function $f$ defined on $\Omega$ and two types of $C^1$-quadratic spline quasi-interpolants (QIs) obtained as linear combinations of…
Spline interpolation has been used in several applications due to its favorable properties regarding smoothness and accuracy of the interpolant. However, when there exists a discontinuity or a steep gradient in the data, some artifacts can…
We present a Hermite interpolation problem via splines of odd-degree which, to the best knowledge of the authors, has not been considered in the literature on interpolation via odd-degree splines. In this new interpolation problem, we…
Coded computing has emerged as a key framework for addressing the impact of stragglers in distributed computation. While polynomial functions often admit exact recovery under existing coded computing schemes, non-polynomial functions…
We present a local interpolation method in four dimensions utilising cubic splines. An extension of the three-dimensional tricubic method, the interpolated function has C$^1$ continuity and its partial derivatives are analytically…
In this paper I uncover and explain---using contour integrals and residues---a connection between cubic splines and a popular compact finite difference formula. The connection is that on a uniform mesh the simplest Pad\'e scheme for…
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
Roughly speaking, a near-best (abbr. NB) quasi-interpolant (abbr. QI) is an approximation operator of the form $Q_af=\sum_{\alpha\in A} \Lambda_\alpha (f) B_\alpha$ where the $B_\alpha$'s are B-splines and the $\Lambda_\alpha (f)$'s are…
We prove quartic convergence of cubic spline interpolation for curves into Riemannian manifolds as the grid size of the interpolation grid tends to zero. In contrast to cubic spline interpolation in Euclidean space, where this result is…
Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing…
Radio-frequency pulses are widespread for the control of quantum bits and the execution of operations in quantum computers. The ability to tune key pulse parameters such as time-dependent amplitude, phase, and frequency is essential to…
A new error bound which is better than the current exponential-type error bound is presented in this paper.
Quantum Computing offers a new paradigm for efficient computing and many AI applications could benefit from its potential boost in performance. However, the main limitation is the constraint to linear operations that hampers the…
The question of adaptive mesh generation for approximation by splines has been studied for a number of years by various authors. The results have numerous applications in computational and discrete geometry, computer aided geometric design,…
We study a new simple quadrature rule based on integrating a $C^1$ quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions…