Related papers: Fundamental trigonometric interpolation and approx…
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…
We establish interpolation analogues of Lebesgue type inequalities on the sets of $C^{\psi}_{\beta}L_{1}$ $2\pi$-periodic functions $f$, which are representable as convolutions of generating kernel $\Psi_{\beta}(t) =…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
We deal with a problem of the reconstruction of any holomorphic function $f$ on the unit ball of $\mathbb{C}^2$ from its restricions on a union of complex lines. We give an explicit formula of Lagrange interpolation's type that is…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
In this paper a general theory for interpolation methods on a rectangular grid is introduced. By the use of this theory an efficient B-spline based interpolation method for spectral codes is presented. The theory links the order of the…
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…
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…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
Some questions of application of trigonometric splines in problems of spectral analysis are considered. The known effects of overlay in the frequency and time domains are discussed; deployment effects in these areas are firstly considered.…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
This paper is dedicated to providing an introduction into multidimensional integer trigonometry. We start with an exposition of integer trigonometry in two dimensions, which was introduced in 2008, and use this to generalise these integer…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
In this paper, we present new quasi-interpolating spline schemes defined on 3D bounded domains, based on trivariate $C^2$ quartic box splines on type-6 tetrahedral partitions and with approximation order four. Such methods can be used for…
Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf,…
This paper begins by reviewing numerous theoretical advancements in the field of multivariate splines, primarily contributed by Professor Larry L. Schumaker. These foundational results have paved the way for a wide range of applications and…