Upper bound for the degree of an approximating monomial
From MaRDI portal
The author investigates the best approximation of polynomials P of degree \(\leq n\) by quasi-monomials \(m(x)=cx^ k\) (i.e. k is real and \(\geq n)\) and proves, for the case of the \(L^ 2\)-norm on the interval [0,1], the following estimate \((n+1)^ 3/4\leq M_ n\leq 6(n+1)^ 3,\) where \(M_ n\) is the best bound \(K_ n\) such that \(K_ n\) are greater than or equal to the orders of the monomials of the best approximation of P \((K_ n\) are independent of P).
Recommendations
Cites work
- An Improvement Theorem for Descartes Systems
- Best uniform approximation from a collection of subspaces
- scientific article; zbMATH DE number 3897516 (Why is no real title available?)
- scientific article; zbMATH DE number 4038421 (Why is no real title available?)
- scientific article; zbMATH DE number 3595687 (Why is no real title available?)
- scientific article; zbMATH DE number 3191390 (Why is no real title available?)
- On best partial bases
- On incomplete polynomials
- On incomplete polynomials. II
- Rational approximation to \(e^{-x}\)
- Tchebycheff systems and best partial bases
Cited in
(2)
This page was built for publication: Upper bound for the degree of an approximating monomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912326)