DeepAI

An improved bound on Legendre approximation

In this paper, new relations between the derivatives of the Legendre polynomials are obtained, and by these relations, new upper bounds for the Legendre coefficients of differentiable functions are presented. These upper bounds are sharp and cover more categories of differentiable functions. Moreover, new and sharper bounds for the approximation error of the partial sums of Legendre polynomials are provided. Numerical examples are given to validate our theoretical results.

• 1 publication
• 1 publication
• 1 publication
11/06/2021

New error bounds for Legendre approximations of differentiable functions

In this paper we present a new perspective on error analysis of Legendre...
09/26/2022

Some Sharp Error Bounds for Multivariate Linear Interpolation and Extrapolation

We study in this paper the function approximation error of linear interp...
10/17/2017

On the bit-size of non-radical triangular sets

We present upper bounds on the bit-size of coefficients of non-radical l...
01/11/2021

Approximation and quadrature by weighted least squares polynomials on the sphere

Given a sequence of Marcinkiewicz-Zygmund inequalities in L_2 on a usual...
02/06/2021

Robust normalizing flows using Bernstein-type polynomials

Normalizing flows (NFs) are a class of generative models that allows exa...
02/22/2022

Stable approximation of functions from equispaced samples via Jacobi frames

In this paper, we study the Jacobi frame approximation with equispaced s...
05/04/2022

Improved error bounds for the distance distribution of Reed-Solomon codes

We use the generating function approach to derive simple expressions for...