Polynomial degree reduction in the ℒ^2-norm on a symmetric interval for the canonical basis

05/15/2021
by   Habib Ben Abdallah, et al.
0

In this paper, we develop a direct formula for determining the coefficients in the canonical basis of the best polynomial of degree M that approximates a polynomial of degree N>M on a symmetric interval for the ℒ^2-norm. We also formally prove that using the formula is more computationally efficient than using a classical matrix multiplication approach and we provide an example to illustrate that it is more numerically stable than the classical approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2019

The distribution of the L_4 norm of Littlewood polynomials

Classical conjectures due to Littlewood, Erdős and Golay concern the asy...
research
02/05/2021

Stable numerical evaluation of multi-degree B-splines

Multi-degree splines are piecewise polynomial functions having sections ...
research
09/29/2022

Hard thresholding hyperinterpolation over general regions

We propose a fully discrete hard thresholding polynomial approximation o...
research
11/27/2018

A Note on Random Sampling for Matrix Multiplication

This paper extends the framework of randomised matrix multiplication to ...
research
01/31/2021

Computation of multi-degree Tchebycheffian B-splines

Multi-degree Tchebycheffian splines are splines with pieces drawn from e...
research
08/17/2017

Neville's algorithm revisited

Neville's algorithm is known to provide an efficient and numerically sta...
research
01/18/2021

Approximating monomials using Chebyshev polynomials

This paper considers the approximation of a monomial x^n over the interv...

Please sign up or login with your details

Forgot password? Click here to reset