Near minimax polynomial approximation
From MaRDI portal
Let \(f\in C^{n+1} [-1,1]\) and \(p\in P_n\) be the best approximation on \([-1,1]\) to \(f\). A near minimax approximation to \(f\in C^{n+1} [-1,1]\) is a polynomial \(p\in P_n\) satisfying \[ \| f-p\|= {1\over 2^n (n+1)!} \bigl | f(n+1) (\xi)\bigr |, \] where \(\xi\in(-1,1)\) and \(\| \cdot \|\) denotes the Chebyshev norm. In this paper the author gives a representation for linear projection and shows that the near approximation problem is equivalent to a problem of the best approximation of bivariate functions.
Recommendations
Cites work
Cited in
(11)- Improved error bounds for near-minimax approximations
- Master-slave strategy and polynomial approximation
- Error bounds for a near-minimax approximation
- Finding exact minimal polynomial by approximations
- scientific article; zbMATH DE number 3886492 (Why is no real title available?)
- Polygonal approximation by the minimax method
- scientific article; zbMATH DE number 3925451 (Why is no real title available?)
- scientific article; zbMATH DE number 65771 (Why is no real title available?)
- Minimizer Extraction in Polynomial Optimization Is Robust
- Polynomially bounded minimization problems which are hard to approximate
- The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method
This page was built for publication: Near minimax polynomial approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387529)
