On the Computational Complexity of Best L1-approximation

DOI10.1002/1521-3870(200210)48:1+%3C66::AID-MALQ66%3E3.0.CO;2-YMaRDI QIDQ4787858zbMATH OpenOpenAlexFDO

Authors Paulo Oliva

Publication date 29 May 2003

Full work available at URL https://doi.org/10.1002/1521-3870(200210)48:1+%3C66::aid-malq66%3E3.0.co;2-y

zbMATH Keywords

computable analysisstrong unicity\(L_1\) approximation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Functionals in proof theory (03F10)

Recommendations

• Proof mining in \(L_{1}\)-approximation
• On uniqueness of best \(L_ 1\)-approximation on disjoint intervals
• On the computational complexity of best Chebyshev approximations
• Best Approximations in L 1 are Near Best in L p , p < 1
• On uniqueness of bestL₁-approximation in sobolev spaces

Cited in

(3)

• Proof mining in \(L_{1}\)-approximation
• On the computational complexity of best Chebyshev approximations
• Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation

This page was built for publication: On the Computational Complexity of Best L1-approximation

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