The paper characterizes when discrete best uniform approximants alternate, proves a Sturm oscillation bound for Jacobi-matrix eigenfunctions, and derives monotone Fourier coefficients for polynomials with removed largest zeros.
Dunham, Discrete Chebyshev approximation: alternation and the Reme z algorithm , Z
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
math.CA 1years
2025 1verdicts
ACCEPT 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Chebyshev systems and Sturm oscillation theory for discrete polynomials
The paper characterizes when discrete best uniform approximants alternate, proves a Sturm oscillation bound for Jacobi-matrix eigenfunctions, and derives monotone Fourier coefficients for polynomials with removed largest zeros.