About the Project

in%20arithmetic%20progressions

AdvancedHelp

(0.002 seconds)

21—30 of 921 matching pages

21: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • A. Adelberg (1992) On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.
  • S. V. Aksenov, M. A. Savageau, U. D. Jentschura, J. Becher, G. Soff, and P. J. Mohr (2003) Application of the combined nonlinear-condensation transformation to problems in statistical analysis and theoretical physics. Comput. Phys. Comm. 150 (1), pp. 1–20.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • Arblib (C) Arb: A C Library for Arbitrary Precision Ball Arithmetic.
  • 22: 24.20 Tables
    Wagstaff (1978) gives complete prime factorizations of N n and E n for n = 20 ( 2 ) 60 and n = 8 ( 2 ) 42 , respectively. In Wagstaff (2002) these results are extended to n = 60 ( 2 ) 152 and n = 40 ( 2 ) 88 , respectively, with further complete and partial factorizations listed up to n = 300 and n = 200 , respectively. …
    23: 3.8 Nonlinear Equations
    Results appear in Table 3.8.1. … has n zeros in , counting each zero according to its multiplicity. … However, when the coefficients are all real, complex arithmetic can be avoided by the following iterative process. … Consider x = 20 and j = 19 . We have p ( 20 ) = 19 ! and a 19 = 1 + 2 + + 20 = 210 . …
    24: 10.75 Tables
  • Makinouchi (1966) tabulates all values of j ν , m and y ν , m in the interval ( 0 , 100 ) , with at least 29S. These are for ν = 0 ( 1 ) 5 , 10, 20; ν = 3 2 , 5 2 ; ν = m / n with m = 1 ( 1 ) n 1 and n = 3 ( 1 ) 8 , except for ν = 1 2 .

  • The main tables in Abramowitz and Stegun (1964, Chapter 9) give e x I n ( x ) , e x K n ( x ) , n = 0 , 1 , 2 , x = 0 ( .1 ) 10 ( .2 ) 20 , 8D–10D or 10S; x e x I n ( x ) , ( x / π ) e x K n ( x ) , n = 0 , 1 , 2 , 1 / x = 0 ( .002 ) 0.05 ; K 0 ( x ) + I 0 ( x ) ln x , x ( K 1 ( x ) I 1 ( x ) ln x ) , x = 0 ( .1 ) 2 , 8D; e x I n ( x ) , e x K n ( x ) , n = 3 ( 1 ) 9 , x = 0 ( .2 ) 10 ( .5 ) 20 , 5S; I n ( x ) , K n ( x ) , n = 0 ( 1 ) 20 ( 10 ) 50 , 100 , x = 1 , 2 , 5 , 10 , 50 , 100 , 9–10S.

  • Kerimov and Skorokhodov (1984c) tabulates all zeros of I n 1 2 ( z ) and I n 1 2 ( z ) in the sector 0 ph z 1 2 π for n = 1 ( 1 ) 20 , 9S.

  • The main tables in Abramowitz and Stegun (1964, Chapter 10) give 𝗃 n ( x ) , 𝗒 n ( x ) n = 0 ( 1 ) 8 , x = 0 ( .1 ) 10 , 5–8S; 𝗃 n ( x ) , 𝗒 n ( x ) n = 0 ( 1 ) 20 ( 10 ) 50 , 100, x = 1 , 2 , 5 , 10 , 50 , 100 , 10S; 𝗂 n ( 1 ) ( x ) , 𝗄 n ( x ) , n = 0 , 1 , 2 , x = 0 ( .1 ) 5 , 4–9D; 𝗂 n ( 1 ) ( x ) , 𝗄 n ( x ) , n = 0 ( 1 ) 20 ( 10 ) 50 , 100, x = 1 , 2 , 5 , 10 , 50 , 100 , 10S. (For the notation see §10.1 and §10.47(ii).)

  • Olver (1960) tabulates a n , m , 𝗃 n ( a n , m ) , b n , m , 𝗒 n ( b n , m ) , n = 1 ( 1 ) 20 , m = 1 ( 1 ) 50 , 8D. Also included are tables of the coefficients in the uniform asymptotic expansions of these zeros and associated values as n .

  • 25: 6.20 Approximations
    §6.20(i) Approximations in Terms of Elementary Functions
  • 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.

  • §6.20(ii) Expansions in Chebyshev Series
    26: Bibliography S
  • K. L. Sala (1989) Transformations of the Jacobian amplitude function and its calculation via the arithmetic-geometric mean. SIAM J. Math. Anal. 20 (6), pp. 1514–1528.
  • J.-P. Serre (1973) A Course in Arithmetic. Graduate Texts in Mathematics, Vol. 7, Springer-Verlag, New York.
  • A. Sharples (1967) Uniform asymptotic forms of modified Mathieu functions. Quart. J. Mech. Appl. Math. 20 (3), pp. 365–380.
  • J. R. Stembridge (1995) A Maple package for symmetric functions. J. Symbolic Comput. 20 (5-6), pp. 755–768.
  • F. Stenger (1993) Numerical Methods Based on Sinc and Analytic Functions. Springer Series in Computational Mathematics, Vol. 20, Springer-Verlag, New York.
  • 27: Bibliography O
  • J. Oliver (1977) An error analysis of the modified Clenshaw method for evaluating Chebyshev and Fourier series. J. Inst. Math. Appl. 20 (3), pp. 379–391.
  • F. W. J. Olver (1970) A paradox in asymptotics. SIAM J. Math. Anal. 1 (4), pp. 533–534.
  • F. W. J. Olver (1983) Error Analysis of Complex Arithmetic. In Computational Aspects of Complex Analysis (Braunlage, 1982), H. Werner, L. Wuytack, E. Ng, and H. J. Bünger (Eds.), NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., Vol. 102, pp. 279–292.
  • J. M. Ortega and W. C. Rheinboldt (1970) Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
  • M. L. Overton (2001) Numerical Computing with IEEE Floating Point Arithmetic. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  • 28: Bibliography F
  • FDLIBM (free C library)
  • S. Fempl (1960) Sur certaines sommes des intégral-cosinus. Bull. Soc. Math. Phys. Serbie 12, pp. 13–20 (French).
  • H. E. Fettis and J. C. Caslin (1964) Tables of Elliptic Integrals of the First, Second, and Third Kind. Technical report Technical Report ARL 64-232, Aerospace Research Laboratories, Wright-Patterson Air Force Base, Ohio.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • B. R. Frieden (1971) Evaluation, design and extrapolation methods for optical signals, based on use of the prolate functions. In Progress in Optics, E. Wolf (Ed.), Vol. 9, pp. 311–407.
  • 29: Publications
  • D. W. Lozier (2000) The DLMF Project: A New Initiative in Classical Special Functions, in Special Functions—Proceedings of the International Workshop, Hong Kong, June 21-25, 1999 (C. Dunkl, M. Ismail, R. Wong, eds.), World Scientific, pp. 207–220. PDF
  • R. F. Boisvert and D. W. Lozier (2001) Handbook of Mathematical Functions, in A Century of Excellence in Measurements Standards and Technology (D. R. Lide, ed.), CRC Press, pp. 135–139. PDF
  • A. Youssef (2006) Roles of Math Search in Mathematics, in Mathematical Knowledge Management, Proceedings of the 5th International Conference on Mathematical Knowledge Management, Lecture Notes in Computer Science, Vol. 4108, Springer-Verlag, 2006. PDF
  • A. Youssef (2007) Advances in Math Search, Proceedings 6th International Congress on Industrial and Applied Mathematics, Zürich, Switzerland, July 17, 2007. PDF
  • B. I. Schneider, B. R. Miller and B. V. Saunders (2018) NIST’s Digital Library of Mathematial Functions, Physics Today 71, 2, 48 (2018), pp. 48–53. PDF
  • 30: 4.48 Software
    All scientific programming languages, libraries, and systems support computation of at least some of the elementary functions in standard floating-point arithmetic3.1(i)). … Here we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter when the arithmetic is nonstandard. …References to research software that is available in other ways is listed separately. A more complete list of available software for computing these functions is found in the Software Index; again, software that uses only standard floating-point arithmetic is excluded. …
    §4.48(ii) Interval Arithmetic