Related papers: Real-time, local spline interpolation schemes on b…
The method of constructing trigonometric Hermite splines, which interpolate the values of some periodic function and its derivatives in the nodes of a uniform grid, is considered. The proposed method is based on the periodicity properties…
The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…
Splines and subdivision curves are flexible tools in the design and manipulation of curves in Euclidean space. In this paper we study generalizations of interpolating splines and subdivision schemes to the Riemannian manifold of shell…
In this paper, we present an approach to enhance interpolation and approximation error estimates. Based on a previously derived first-order Taylor-like formula, we demonstrate its applicability in improving the $P_1$-interpolation error…
In this paper we present a method for direct evaluation of generalized B-splines (GB-splines) via the local representation of these curves as piecewise functions. To accomplish this we introduce a local structure that makes GB-spline curves…
In this paper, we propose a closed-form solution to the inverse problem in interpolation with periodic uniform B-spline curves. This solution is obtained by modifying the one we have established to a similar problem with relaxed uniform…
Mean value interpolation is a method for fitting a smooth function to piecewise-linear data prescribed on the boundary of a polygon of arbitrary shape, and has applications in computer graphics and curve and surface modelling. The method…
We introduce an adaptive scattered data fitting scheme as extension of local least squares approximations to hierarchical spline spaces. To efficiently deal with non-trivial data configurations, the local solutions are described in terms of…
In this work, we investigate a model order reduction scheme for polynomial parametric systems. We begin with defining the generalized multivariate transfer functions for the system. Based on this, we aim at constructing a reduced-order…
Existing and extremal property of periodic perfect spline, which interpolates given function in the mean were proved.
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
Standard interpolation techniques are implicitly based on the assumption that the signal lies on a homogeneous domain. In this letter, the proposed interpolation method instead exploits prior information about domain inhomogeneity,…
We revisit the stochastic collocation method using the exponential of a quadratic spline. In particular, we look in details whether it is more appropriate to fix the ordinates and optimize the abscissae of an interpolating spline or to fix…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
We classify all possible local linear procedures over triangular meshes resulting in polynomial $C^1$-spline functions with affinely uniform shape for the basic functions at the edges, and fitting the 9 value- and gradient data at the…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
This note concerns the interpolation problem with two parametrized families of splines related to polynomial spline interpolation. We address the questions of uniqueness and establish basic convergence rates for splines of the form $…
Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for…
A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…
The fast Ewald methods are widely used to compute the point-charge electrostatic interactions in molecular simulations. The key step that introduces errors in the computation is the particle-mesh interpolation. In this work, the optimal…