DeepAI AI Chat
Log In Sign Up

Weighted Lagrange Interpolation Using Orthogonal Polynomials: Stenger's Conjecture, Numerical Approach

10/18/2019
by   Maha Youssef, et al.
0

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 estimation for such kinds of approximations. Later, we introduce the sufficient condition of Stenger's conjecture for orthogonal polynomials and numerical verification for such conjecture.

READ FULL TEXT

page 14

page 16

page 18

page 20

page 21

page 22

page 23

page 25

10/18/2019

Lagrange Interpolation Using Orthogonal Polynomials: Stenger's Conjecture, Numerical Approach

In this paper we investigate polynomial interpolation using orthogonal p...
05/21/2019

A polynomial approach to the Collatz conjecture

The Collatz conjecture is explored using polynomials based on a binary n...
02/24/2023

A Riemann–Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals

We develop a numerical method for computing with orthogonal polynomials ...
02/08/2021

On (β,γ)-Chebyshev functions and points of the interval

In this paper, we introduce the class of (β,γ)-Chebyshev functions and c...
08/14/2022

On the Gasca-Maeztu conjecture for n=6

A two-dimensional n-correct set is a set of nodes admitting unique bivar...
03/28/2023

Continued fractions and orthogonal polynomials in several variables

We extend the close interplay between continued fractions, orthogonal po...
04/08/2020

PolyChaos.jl – A Julia Package for Polynomial Chaos in Systems and Control

Polynomial chaos expansion (PCE) is an increasingly popular technique fo...