Related papers: Interpolation synthesis for quadratic polynomial i…
We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
Nonsymmetric interpolation Laurent polynomials in $n$ variables are introduced, with the interpolation points depending on $q$ and on a $n$-tuple of parameters $\tau=(\tau_1,\ldots,\tau_n)$. When $\tau_i=st^{n-i}$ Okounkov's $3$-parameter…
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields…
In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate…
We show that interpolation results in the $S$-nodes theory may be considered as Khrushchev-type formulas. If separation of the well-known Verblunsky (Schur) coefficients occurs in Khrushchev formulas, the separation of the so the called new…
A method for 3D interpolation between hard spheres is described. The function to be interpolated could be the charge density between atoms in condensed matter. Its electrostatic potential is found analytically, and so are various integrals.…
The polynomial kernels are widely used in machine learning and they are one of the default choices to develop kernel-based classification and regression models. However, they are rarely used and considered in numerical analysis due to their…
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…
The fundamental purpose of the present work is to constitute an enhanced Euler method with adaptive inverse-quadratic and inverse-multi-quadratic radial basis function (RBF) interpolation technique to solve initial value problems. These…
One of the main challenges in software verification is efficient and precise compositional analysis of programs with procedures and loops. Interpolation methods remain one of the most promising techniques for such verification, and are…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…
In [18] Fournier and Printems establish a methodology which allows to prove the absolute continuity of the law of the solution of some stochastic equations with H\"{o}lder continuous coefficients. This is of course out of reach by using…
We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the…
This paper gives a general interpretation of Linear Prediction (LP) by interpolation framework different from the perspective of statistics. This interpretation is proved to be useful by several following results, such as: The mechanism of…