Related papers: Improved error bound for multivariate Chebyshev po…
In this paper we analyze the use of Chebyshev polynomials in distributed consensus applications. We study the properties of these polynomials to propose a distributed algorithm that reaches the consensus in a fast way. The algorithm is…
Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…
The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing…
The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a…
A New Error Bound for shifted surface spline interpolation is presented. This error bound probably is the most powerful one up to now.
In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
We obtain estimates of the $L_p$-error of the bivariate polynomial interpolation on the Lissajous-Chebyshev node points for wide classes of functions including non-smooth functions of bounded variation in the sense of Hardy-Krause. The…
A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
A family of exact upper bounds interpolating between Chebyshev's and Cantelli's is presented.
This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an…
The interaction between two particles with shape or interaction anisotropy can be modeled using a pairwise potential energy function that depends on their relative position and orientation; however, this function is often challenging to…
The idea of the restricted mean has been used to establish a significantly improved version of Markov's inequality that does not require any new assumptions. The result immediately extends on Chebyshev's inequalities and Chernoff's bound.…
We extend the univariate Newton interpolation algorithm to arbitrary spatial dimensions and for any choice of downward-closed polynomial space, while preserving its quadratic runtime and linear storage cost. The generalisation supports any…
Explicit pointwise error bounds for the interpolation of a smooth function by piecewise exponential splines of order four are given. Estimates known for cubic splines are extended to a natural class of piecewise exponential splines which…
We develop a simple two-step algorithm for enclosing Chebyshev expansions whose cost is linear in terms of the polynomial degree. The algorithm first transforms the expansion from Chebyshev to the Laurent basis and then applies the interval…
We calculate the minimal surface bounded by four-sided figures whose projection on a plane is a rectangle, starting with the bilinear interpolation and using, for smoothness, the Chebyshev polynomial expansion in our discretized numerical…
It's well known that in the high-level error bound for multiquadric interpolation there is a crucial constant lambda lying between 0 and 1 which connot be calculated or even approximated. The purpose of this paper is to answer this…
We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values for the variable when $\le E$ of the evaluations can be erroneous. Our algorithms perform exact arithmetic in…