About the Project

relation%20to%20minimax%20polynomials

AdvancedHelp

(0.003 seconds)

11—20 of 922 matching pages

11: 25.12 Polylogarithms
The remainder of the equations in this subsection apply to principal branches. … The special case z = 1 is the Riemann zeta function: ζ ( s ) = Li s ( 1 ) . … Further properties include …and … In terms of polylogarithms …
12: 20 Theta Functions
Chapter 20 Theta Functions
13: 6.20 Approximations
  • Hastings (1955) gives several minimax polynomial and rational approximations for E 1 ( x ) + ln x , x e x E 1 ( x ) , and the auxiliary functions f ( x ) and g ( x ) . These are included in Abramowitz and Stegun (1964, Ch. 5).

  • Cody and Thacher (1968) provides minimax rational approximations for E 1 ( x ) , with accuracies up to 20S.

  • Cody and Thacher (1969) provides minimax rational approximations for Ei ( x ) , with accuracies up to 20S.

  • MacLeod (1996b) provides rational approximations for the sine and cosine integrals and for the auxiliary functions f and g , with accuracies up to 20S.

  • Luke (1969b, pp. 321–322) covers Ein ( x ) and Ein ( x ) for 0 x 8 (the Chebyshev coefficients are given to 20D); E 1 ( x ) for x 5 (20D), and Ei ( x ) for x 8 (15D). Coefficients for the sine and cosine integrals are given on pp. 325–327.

  • 14: 16.7 Relations to Other Functions
    §16.7 Relations to Other Functions
    For orthogonal polynomials see Chapter 18. …
    15: Tom M. Apostol
    Apostol was born on August 20, 1923. … He was also a coauthor of three textbooks written to accompany the physics telecourse The Mechanical Universe …and Beyond. … In 1998, the Mathematical Association of America (MAA) awarded him the annual Trevor Evans Award, presented to authors of an exceptional article that is accessible to undergraduates, for his piece entitled “What Is the Most Surprising Result in Mathematics?” (Answer: the prime number theorem). … Ford Award, given to recognize authors of articles of expository excellence. …
  • 16: 26.3 Lattice Paths: Binomial Coefficients
    §26.3(i) Definitions
    ( m n ) is the number of ways of choosing n objects from a collection of m distinct objects without regard to order. ( m + n n ) is the number of lattice paths from ( 0 , 0 ) to ( m , n ) . …The number of lattice paths from ( 0 , 0 ) to ( m , n ) , m n , that stay on or above the line y = x is ( m + n m ) ( m + n m 1 ) .
    §26.3(iii) Recurrence Relations
    17: 27.2 Functions
    ( ν ( 1 ) is defined to be 0.) Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. …They tend to thin out among the large integers, but this thinning out is not completely regular. … the sum of the k th powers of the positive integers m n that are relatively prime to n . … is the number of k -tuples of integers n whose greatest common divisor is relatively prime to n . …
    18: 26.5 Lattice Paths: Catalan Numbers
    §26.5(i) Definitions
    It counts the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x . …
    §26.5(iii) Recurrence Relations
    26.5.7 lim n C ( n + 1 ) C ( n ) = 4 .
    19: Bibliography I
  • K. Inkeri (1959) The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.
  • M. E. H. Ismail, D. R. Masson, and M. Rahman (Eds.) (1997) Special Functions, q -Series and Related Topics. Fields Institute Communications, Vol. 14, American Mathematical Society, Providence, RI.
  • M. E. H. Ismail and D. R. Masson (1991) Two families of orthogonal polynomials related to Jacobi polynomials. Rocky Mountain J. Math. 21 (1), pp. 359–375.
  • M. E. H. Ismail and M. E. Muldoon (1995) Bounds for the small real and purely imaginary zeros of Bessel and related functions. Methods Appl. Anal. 2 (1), pp. 1–21.
  • A. R. Its and A. A. Kapaev (1987) The method of isomonodromic deformations and relation formulas for the second Painlevé transcendent. Izv. Akad. Nauk SSSR Ser. Mat. 51 (4), pp. 878–892, 912 (Russian).
  • 20: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    §26.4(i) Definitions
    It is also the number of k -dimensional lattice paths from ( 0 , 0 , , 0 ) to ( n 1 , n 2 , , n k ) . For k = 0 , 1 , the multinomial coefficient is defined to be 1 . … (The empty set is considered to have one permutation consisting of no cycles.) …
    §26.4(iii) Recurrence Relation