DeepAI AI Chat
Log In Sign Up

An improved bound on Legendre approximation

by   M. Hamzehnejad, et al.
Shahid Bahonar University of Kerman

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.


page 1

page 2

page 3

page 4


New error bounds for Legendre approximations of differentiable functions

In this paper we present a new perspective on error analysis of Legendre...

Some Sharp Error Bounds for Multivariate Linear Interpolation and Extrapolation

We study in this paper the function approximation error of linear interp...

On the bit-size of non-radical triangular sets

We present upper bounds on the bit-size of coefficients of non-radical l...

Approximation and quadrature by weighted least squares polynomials on the sphere

Given a sequence of Marcinkiewicz-Zygmund inequalities in L_2 on a usual...

Robust normalizing flows using Bernstein-type polynomials

Normalizing flows (NFs) are a class of generative models that allows exa...

Stable approximation of functions from equispaced samples via Jacobi frames

In this paper, we study the Jacobi frame approximation with equispaced s...

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

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