Spectacularly large expansion coefficients in Müntz's theorem

08/08/2022
by   Lloyd N. Trefethen, et al.
0

Müntz's theorem asserts, for example, that the even powers 1, x^2, x^4,… are dense in C([0,1]). We show that the associated expansions are so inefficient as to have no conceivable relevance to any actual computation. For example, approximating f(x)=x to accuracy ε = 10^-6 in this basis requires powers larger than x^280,000 and coefficients larger than 10^107,000. We present a theorem establishing exponential growth of coefficients with respect to 1/ε.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2023

Engel's theorem in Mathlib

We discuss the theory of Lie algebras in Lean's Mathlib library. Using n...
research
09/14/2020

The Frisch–Waugh–Lovell Theorem for Standard Errors

The Frisch–Waugh–Lovell Theorem states the equivalence of the coefficien...
research
06/09/2022

A computational framework for weighted simplicial homology

We provide a bottom up construction of torsion generators for weighted h...
research
06/08/2019

A Characterization of q-binomials and its Application to Coding Theory

We present a new perspective on q-binomials, also known as Gaussian bino...
research
10/02/2021

Efficiently transforming from values of a function on a sparse grid to basis coefficients

In many contexts it is necessary to determine coefficients of a basis ex...
research
02/12/2021

User manual for bch, a program for the fast computation of the Baker-Campbell-Hausdorff and similar series

This manual describes bch, an efficient program written in the C program...

Please sign up or login with your details

Forgot password? Click here to reset