Work

Applications of Integer and Semi-Infinite Programming to the Integer Chebyshev Problem

Year: 2018

Type: preprint

Abstract: We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to improve on previous methods for finding integer Chebyshev polynomials of degree $n$. Using our new method, we found 16 new integer Chebyshev polynomials of degrees in the range 147 to 244.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1804.05985

Authors: Hare, Kevin G., Hodges, Philip W.

Language: English

Topic: Mathematical functions and polynomials

Subfield: Applied Mathematics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: University of Waterloo, Natural Sciences and Engineering Research Council of Canada

OpenAlex ID: W2797276658

Cites: 11

Cited by:

Related to: 20