A Discrete Chebyshev Approximation Problem by Means of Several Polynomials
From MaRDI portal
Recommendations
- Chebyshev multivariate polynomial approximation and point reduction procedure
- Chebyshev multivariate polynomial approximation: alternance interpretation
- Chebyshev approximation of functions of several variables
- scientific article; zbMATH DE number 4099859
- Chebyshev approximation by the sum of polynomial and nonlinear expression with Hermite interpolation at the end points of an interval
Cites work
Cited in
(17)- On covering radius and discrete Chebyshev polynomials
- Optimal scheduling and the Chebyshev approximation
- Chebyshev multivariate polynomial approximation: alternance interpretation
- Application of Chebyshev, and Legendre polynomials on discrete point set to function interpolation and solving Fredholm integral equations
- Chebyshev approximation of functions of several variables
- Approximation of a two-valued function by an algebraic polynomial
- scientific article; zbMATH DE number 4205873 (Why is no real title available?)
- scientific article; zbMATH DE number 4099859 (Why is no real title available?)
- scientific article; zbMATH DE number 4107375 (Why is no real title available?)
- scientific article; zbMATH DE number 89022 (Why is no real title available?)
- scientific article; zbMATH DE number 1102600 (Why is no real title available?)
- Minmaxmin problems revisited
- Support cones and convexity of sets in ℝⁿ
- Chebyshev approximation by S^0_1() over some special triangulations
- Asymptotics of the Discrete Chebyshev Polynomials
- Alternance form of optimality conditions in the finite-dimensional space
- A note on total degree polynomial optimization by Chebyshev grids
This page was built for publication: A Discrete Chebyshev Approximation Problem by Means of Several Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707434)
