Polynomial interpolation in the monomial basis is stable after all

12/20/2022
by   Zewen Shen, et al.
0

Polynomial interpolation in the monomial basis is often considered to be a bad idea in numerical computations. In this paper, we show that this belief is wrong, in the sense that, despite the ill-conditioning of the Vandermonde matrix, polynomial interpolation in the monomial basis is as accurate as polynomial interpolation in a more well-conditioned basis in many cases of interest. Furthermore, we show that the monomial basis is superior to other polynomial bases in a number of applications.

READ FULL TEXT

page 9

page 23

research
01/10/2020

Linearizations for interpolation bases – a comparison I

One strategy to solve a nonlinear eigenvalue problem T(λ)x=0 is to solve...
research
09/01/2023

Polynomial Interpolation of Function Averages on Interval Segments

Motivated by polynomial approximations of differential forms, we study a...
research
07/22/2019

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolati...
research
11/22/2019

Vandermonde with Arnoldi

Vandermonde matrices are exponentially ill-conditioned, rendering the fa...
research
11/14/2021

Computing Groebner bases of ideal interpolation

We present algorithms for computing the reduced Gröbner basis of the van...
research
04/28/2023

Orthogonal polynomial bases in the Mixed Virtual Element Method

The use of orthonormal polynomial bases has been found to be efficient i...
research
04/04/2022

Polynomial mapped bases: theory and applications

In this paper, we collect the basic theory and the most important applic...

Please sign up or login with your details

Forgot password? Click here to reset