An explicit solution of an L^ 1 approximation problem

DOI10.1016/0021-9045(85)90082-6MaRDI QIDQ1060370zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1985

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9045(85)90082-6

zbMATH Keywords

Chebyshev polynomial

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Review text

It is shown that \(\| 2^{1-n}T_ n\|_ 1=\int^{1}_{- 1}2^{1-n}| T_ n(x)| dx/\sqrt{1-x^ 2}<\| p_ n\|_ 1\) where \(T_ n\) is the nth degree Chebyshev polynomial of the first kind and \(p_ n\) is any other monic polynomial of degree n.

Recommendations

• A remark on best L^ 1-approximation by polynomials
• Best L^ 1-approximation by polynomials. II
• The minimality properties of Chebyshev polynomials and their lacunary series
• scientific article; zbMATH DE number 3975541
• scientific article; zbMATH DE number 4036363

Cited in

(6)

• A streamlined proof of Goodwillie's n-excisive approximation
• A scheme of approximation solution of problem 1 |r j|L max
• scientific article; zbMATH DE number 3851713 (Why is no real title available?)
• On an L 1 -Approximation Problem
• An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total l₁ Problem
• Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem

This page was built for publication: An explicit solution of an \(L^ 1\) approximation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060370)