On Integer Chebyshev Polynomials - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1995

On Integer Chebyshev Polynomials

, (1)
Laurent Habsieger
  • Function : Author
Bruno Salvy


We are concerned with the problem of minimizing the supremum norm on [0,1] of a nonzero polynomial of degree at most $n$ with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem and improve a lower bound from~[3]
Fichier principal
Vignette du fichier
RR-2648.pdf (243.55 Ko) Télécharger le fichier

Dates and versions

inria-00074042 , version 1 (24-05-2006)


  • HAL Id : inria-00074042 , version 1


Laurent Habsieger, Bruno Salvy. On Integer Chebyshev Polynomials. [Research Report] RR-2648, INRIA. 1995. ⟨inria-00074042⟩
36 View
176 Download


Gmail Facebook Twitter LinkedIn More