Searching for "On integer Chebyshev polynomials." – sorted by Relevance.
-
On integer Chebyshev Polynomials
- On integer Chebyshev Polynomials Bruno Salvy INRIA Rocquencourt January 29, 1996 [summary
- Add To MetaCart
-
On Integer Chebyshev Polynomials
- AUTOMATIQUE On Integer Chebyshev Polynomials Laurent HABSIEGER Bruno SALVY N 2648 Aout 1995 PROGRAMME
- Cited by 13 (0 self) – Add To MetaCart
-
The integer Chebyshev problem
- “integer Chebyshev” polynomials, showing for example that on small intevals [0,δ]andforsmall degrees d, x d
- Cited by 16 (6 self) – Add To MetaCart
-
THE MULTIVARIATE INTEGER CHEBYSHEV PROBLEM
- . The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize
- Add To MetaCart
-
Chebyshev Polynomials and Primality Tests
- factorization, irreducibility, and relations between Chebyshev polynomials and integer factoring. By extending a
- Add To MetaCart
-
Small Polynomials With Integer Coefficients
- )0000-0 SMALL POLYNOMIALS WITH INTEGER COEFFICIENTS IGOR E. PRITSKER 1. Integer Chebyshev problem
- Cited by 7 (5 self) – Add To MetaCart
-
The Gelfond-Schnirelman Method In Prime Number Theory
- -called integer Chebyshev problem on polynomials with integer coefficients minimizing the sup norm (see, e
- Cited by 3 (3 self) – Add To MetaCart
-
The monic integer transfinite diameter
- polynomial P(x) is an optimal monic integer Chebyshev polynomial for I if �P � ∗ I = tM(I). If I has a maxi
- Cited by 2 (0 self) – Add To MetaCart
-
A Padé-Chebyshev Reconstruction of Functions with Jump Discontinuities
- .1)–(2.2). 3 Padé-Chebyshev Reconstruction Let x ∈ [−1, 1] and n be a nonnegative integer. The Chebyshev
- Add To MetaCart

