Related papers: Fundamental trigonometric interpolation and approx…
The LC method described in this work seeks to approximate the roots of polynomial equations in one variable. This book allows you to explore the LC method, which uses geometric structures of Lines L and Circumferences C in the plane of…
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…
Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate…
We analyze the space of geometrically continuous piecewise polynomial functions or splines for quadrangular and triangular patches with arbitrary topology and general rational transition maps. To define these spaces of G 1 spline functions,…
The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order…
Observations made in continuous time are often irregular and contain the missing values across different channels. One approach to handle the missing data is imputing it using splines, by fitting the piecewise polynomials to the observed…
In this paper, we propose an interpolation formula for periodic functions. This formula can be regarded as an analog of the Sinc approximation, which is an interpolation formula for functions defined on the entire infinite interval.…
Recently, in [Electronic Transaction on Numerical Analysis, 41 (2014), pp. 420-442] authors introduced a new class of rational cubic fractal interpolation functions with linear denominators via fractal perturbation of traditional…
In this document we present the construction of a radial functions that have the objective of emulating the behavior of the radial basis function thin plate spline (TPS), which we will name as function TPS, we propose a way to partially and…
We consider approximation by functions with finite support and characterize its approximation spaces in terms of interpolation spaces and Lorentz spaces.
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
The need to approximate functions is ubiquitous in science, either due to empirical constraints or high computational cost of accessing the function. In high-energy physics, the precise computation of the scattering cross-section of a…
We obtain a result concerning the stability under the interpolation with functional parameter method for the approximation spaces of Lorentz-Marcinkiewicz type and also for the approximation spaces generated by symmetric norming functions…
Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…
Polynomial interpolation is an important component of many computational problems. In several of these computational problems, failure to preserve positivity when using polynomials to approximate or map data values between meshes can lead…
Generalizing tensor-product splines to smooth functions whose control nets outline topological polyhedra, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each…
The paper is concerned with three types of cubic splines over a triangulation that are characterized by three degrees of freedom associated with each vertex of the triangulation. The splines differ in computational complexity, polynomial…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
There is proposed a method for improving the convergence of Fourier series by function systems, orthogonal at the segment, the application of which allows for smooth functions to receive uniformly convergent series. There is also proposed…
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…