Related papers: Monotone cubic spline interpolation for functions …
It is well-known that univariate cubic spline interpolation, if carried out on point sets with fill distance $h$, converges only like ${\cal O}(h^2)$ in $L_2[a,b]$ for functions in $W_2^2[a,b]$ if no additional assumptions are made. But…
Due to properties such as interpolation, smoothness, and spline connections, Hermite subdivision schemes employ fast iterative algorithms for geometrically modeling curves/surfaces in CAGD and for building Hermite wavelets in numerical…
Numerical studies of lattice quantum field theories are conducted in finite spatial volumes, typically with cubic symmetry in the spatial coordinates. Motivated by these studies, this work presents a general algorithm to construct…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
A new global basis of B-splines is defined in the space of generalized quadratic splines (GQS) generated by Merrien subdivision algorithm. Then, refinement equations for these B-splines and the associated corner-cutting algorithm are given.…
The main contribution of this paper is twofold: On the one hand, a general framework for performing Hermite interpolation on Riemannian manifolds is presented. The method is applicable, if algorithms for the associated Riemannian…
In this paper we consider the approximation of functions by radial basis function interpolants. There is a plethora of results about the asymptotic behaviour of the error between appropriately smooth functions and their interpolants, as the…
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…
In this work we study a multi-step scheme on time-space grids proposed by W. Zhao et al. [28] for solving backward stochastic differential equations, where Lagrange interpolating polynomials are used to approximate the time-integrands with…
In this paper we derive approximate quasi-interpolants when the values of a function $u$ and of some of its derivatives are prescribed at the points of a uniform grid. As a byproduct of these formulas we obtain very simple approximants…
While students may find spline interpolation quite digestible, based on their familiarity with continuity of a function and its derivatives, some of its inherent value may be missed when students only see it applied to standard data…
The methods of approximation, regularization and smoothing of trigonometric interpolation splines are considered in the paper. It is shown that trigonometric splines can be considered from two points of view - as a trigonometric Fourier…
Let $q\ge 1$ be an integer. Given $M$ samples of a smooth function of $q$ variables, $2\pi$--periodic in each variable, we consider the problem of constructing a $q$--variate trigonometric polynomial of spherical degree $\O(M^{1/q})$ which…
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,…
Standard interpolation techniques are implicitly based on the assumption that the signal lies on a single homogeneous domain. In contrast, many naturally occurring signals lie on an inhomogeneous domain, such as brain activity associated to…
The goal of this paper is to design compact support basis spline functions that best approximate a given filter (e.g., an ideal Lowpass filter). The optimum function is found by minimizing the least square problem ($\ell$2 norm of the…
In this work, we present some new integration formulas for any order of accuracy as an application of the B-spline relations obtained in [1]. The resulting rules are defined as a perturbation of the trapezoidal integration method. We prove…
Flow matching is a scalable generative framework for characterizing continuous normalizing flows with wide-range applications. However, current state-of-the-art methods are not well-suited for modeling dynamical systems, as they construct…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
Fractal interpolation functions (FIFs) generated using iterated function systems (IFS) provide a powerful framework for modeling self-similar and irregular data, yet traditional constructions often neglect geometric fidelity such as…