About the Project

on%20finite%20point%20sets

AdvancedHelp

(0.002 seconds)

21—30 of 644 matching pages

21: 10.75 Tables
  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Bickley et al. (1952) tabulates x n I n ( x ) or e x I n ( x ) , x n K n ( x ) or e x K n ( x ) , n = 2 ( 1 ) 20 , x = 0 (.01 or .1) 10(.1) 20, 8S; I n ( x ) , K n ( x ) , n = 0 ( 1 ) 20 , x = 0 or 0.1 ( .1 ) 20 , 10S.

  • Kerimov and Skorokhodov (1984b) tabulates all zeros of the principal values of K n ( z ) and K n ( z ) , for n = 2 ( 1 ) 20 , 9S.

  • Zhang and Jin (1996, p. 322) tabulates ber x , ber x , bei x , bei x , ker x , ker x , kei x , kei x , x = 0 ( 1 ) 20 , 7S.

  • Zhang and Jin (1996, p. 323) tabulates the first 20 real zeros of ber x , ber x , bei x , bei x , ker x , ker x , kei x , kei x , 8D.

  • 22: Bibliography W
  • Z. Wang and R. Wong (2003) Asymptotic expansions for second-order linear difference equations with a turning point. Numer. Math. 94 (1), pp. 147–194.
  • Z. Wang and R. Wong (2005) Linear difference equations with transition points. Math. Comp. 74 (250), pp. 629–653.
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • W. Wasow (1985) Linear Turning Point Theory. Applied Mathematical Sciences No. 54, Springer-Verlag, New York.
  • R. Wong and T. Lang (1990) Asymptotic behaviour of the inflection points of Bessel functions. Proc. Roy. Soc. London Ser. A 431, pp. 509–518.
  • 23: Bibliography M
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • W. Magnus and S. Winkler (1966) Hill’s Equation. Interscience Tracts in Pure and Applied Mathematics, No. 20, Interscience Publishers John Wiley & Sons, New York-London-Sydney.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.
  • 24: Bibliography L
  • V. Laĭ (1994) The two-point connection problem for differential equations of the Heun class. Teoret. Mat. Fiz. 101 (3), pp. 360–368 (Russian).
  • P. W. Lawrence, R. M. Corless, and D. J. Jeffrey (2012) Algorithm 917: complex double-precision evaluation of the Wright ω function. ACM Trans. Math. Software 38 (3), pp. Art. 20, 17.
  • W. Lay and S. Yu. Slavyanov (1998) The central two-point connection problem for the Heun class of ODEs. J. Phys. A 31 (18), pp. 4249–4261.
  • D. J. Leeming (1977) An asymptotic estimate for the Bernoulli and Euler numbers. Canad. Math. Bull. 20 (1), pp. 109–111.
  • K. V. Leung and S. S. Ghaderpanah (1979) An application of the finite element approximation method to find the complex zeros of the modified Bessel function K n ( z ) . Math. Comp. 33 (148), pp. 1299–1306.
  • 25: 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.
  • B. I. Schneider, X. Guan, and K. Bartschat (2016) Time propagation of partial differential equations using the short iterative Lanczos method and finite-element discrete variable representation. Adv. Quantum Chem. 72, pp. 95–127.
  • 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.
  • 26: 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. …
    27: 3.4 Differentiation
    Two-Point Formula
    Three-Point Formula
    Four-Point Formula
    Five-Point Formula
    Six-Point Formula
    28: 26.13 Permutations: Cycle Notation
    𝔖 n denotes the set of permutations of { 1 , 2 , , n } . … Cycles of length one are fixed points. … An element of 𝔖 n with a 1 fixed points, a 2 cycles of length 2 , , a n cycles of length n , where n = a 1 + 2 a 2 + + n a n , is said to have cycle type ( a 1 , a 2 , , a n ) . … A derangement is a permutation with no fixed points. The derangement number, d ( n ) , is the number of elements of 𝔖 n with no fixed points: …
    29: 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.
  • T. Fort (1948) Finite Differences and Difference Equations in the Real Domain. Clarendon Press, Oxford.
  • G. Freud (1969) On weighted polynomial approximation on the whole real axis. Acta Math. Acad. Sci. Hungar. 20, pp. 223–225.
  • 30: 27.2 Functions
    Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … Gauss and Legendre conjectured that π ( x ) is asymptotic to x / ln x as x : … Such a set is a reduced residue system modulo n . …
    Table 27.2.2: Functions related to division.
    n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n ) n ϕ ( n ) d ( n ) σ ( n )
    5 4 2 6 18 6 6 39 31 30 2 32 44 20 6 84
    7 6 2 8 20 8 6 42 33 20 4 48 46 22 4 72