Related papers: Geometric Estimates in Linear Interpolation on a C…
We prove the optimal convergence estimate for first order interpolants used in finite element methods based on three major approaches for generalizing barycentric interpolation functions to convex planar polygonal domains. The Wachspress…
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there…
The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
The complex method of interpolation, going back to Calder\'on and Coifman et al., on the one hand, and the Alexander-Wermer-Slodkowski theorem on polynomial hulls with convex fibers, on the other hand, are generalized to a method of…
The aim of this paper is to study the approximation of functions using a higher order Hermite-Fejer interpolation process on the unit circle. The system of nodes is composed of vertically projected zeros of Jacobi polynomials onto the unit…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
This paper applies a complete parametric set for approximating the geometry of a quadrilateral element. The approximation basis used is a complete Pascal polynomial of second order with six free parameters. The interpolation procedure is a…
This paper contains a review of available methods for establishing improved interpolation inequalities on the sphere for subcritical exponents. Pushing further these techniques we also establish some new results, clarify the range of…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
The density matrix formalism is a fundamental tool in studying various problems in quantum information processing. In the space of density matrices, the most well-known measures are the Hilbert-Schmidt and Bures-Hall ensembles. In this…
We construct polynomial approximations of Dzjadyk type (in terms of the k-th modulus of continuity, $k \ge 1$) for analytic functions defined on a continuum E in the complex plane, which simultaneously interpolate at given points of E.…
We study polynomial approximation on a $d$-cube, where $d$ is large, and compare interpolation on sparse grids, aka Smolyak's algorithm (SA), with a simple least squares method based on randomly generated points (LS) using standard…
This paper presents a complete Pascal interpolation scheme for use in the plane geometry mapping applied in association with numerical methods. The geometry of a domain element is approximated by a complete Pascal polynomial. The…
Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…
Eigenvalue analysis based methods are well suited for the reconstruction of finitely supported measures from their moments up to a certain degree. We give a precise description when Prony's method succeeds in terms of an interpolation…
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) =…
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized)…
Interpolated multiple $q$-zeta values are deformation of multiple $q$-zeta values with one parameter, $t$, and restore classical multiple zeta values as $t = 0$ and $q \to 1$. In this paper, we discuss generating functions for sum of…