About the Project
NIST

combined

AdvancedHelp

(0.001 seconds)

1—10 of 154 matching pages

1: 20.11 Generalizations and Analogs
§20.11(v) Permutation Symmetry
For m = 1 , 2 , 3 , 4 , n = 1 , 2 , 3 , 4 , and m n , define twelve combined theta functions φ m , n ( z , q ) by
20.11.6 φ m , 1 ( z , q ) = θ 1 ( 0 , q ) θ m ( z , q ) θ m ( 0 , q ) θ 1 ( z , q ) , m = 2 , 3 , 4 ,
20.11.9 φ m , n ( z , q ) = φ m , 1 ( z , q ) φ 1 , n ( z , q ) = 1 φ n , m ( z , q ) = φ m , 1 ( z , q ) φ n , 1 ( z , q ) = φ 1 , n ( z , q ) φ 1 , m ( z , q ) .
The importance of these combined theta functions is that sets of twelve equations for the theta functions often can be replaced by corresponding sets of three equations of the combined theta functions, plus permutation symmetry. …
2: 27.22 Software
  • Maple. isprime combines a strong pseudoprime test and a Lucas pseudoprime test. ifactor uses cfrac27.19) after exhausting trial division. Brent–Pollard rho, Square Forms Factorization, and ecm are available also; see §27.19.

  • Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below 10 16 . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard p - 1 , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.

    For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).

  • 3: 21.8 Abelian Functions
    For every Abelian function, there is a positive integer n , such that the Abelian function can be expressed as a ratio of linear combinations of products with n factors of Riemann theta functions with characteristics that share a common period lattice. …
    4: 35.11 Tables
    Each table expresses the zonal polynomials as linear combinations of monomial symmetric functions.
    5: 4.44 Other Applications
    The Einstein functions and Planck’s radiation function are elementary combinations of exponentials, or exponentials and logarithms. …
    6: 34.10 Zeros
    However, the 3 j and 6 j symbols may vanish for certain combinations of the angular momenta and projective quantum numbers even when the triangle conditions are fulfilled. …
    7: 33.18 Limiting Forms for Large
    8: 33.21 Asymptotic Approximations for Large | r |
  • (a)

    When r ± with ϵ > 0 , Equations (33.16.4)–(33.16.7) are combined with (33.10.1).

  • (b)

    When r ± with ϵ < 0 , Equations (33.16.10)–(33.16.13) are combined with

    33.21.1
    ζ ( ν , r ) e - r / ν ( 2 r / ν ) ν ,
    ξ ( ν , r ) e r / ν ( 2 r / ν ) - ν , r ,
    33.21.2
    ζ ( - ν , r ) e r / ν ( - 2 r / ν ) - ν ,
    ξ ( - ν , r ) e - r / ν ( - 2 r / ν ) ν , r - .

    Corresponding approximations for s ( ϵ , ; r ) and c ( ϵ , ; r ) as r can be obtained via (33.16.17), and as r - via (33.16.18).

  • (c)

    When r ± with ϵ = 0 , combine (33.20.1), (33.20.2) with §§10.7(ii), 10.30(ii).

  • 9: 33.23 Methods of Computation
    Combined with the Wronskians (33.2.12), the values of F , G , and their derivatives can be extracted. … Thompson and Barnett (1985, 1986) and Thompson (2004) use combinations of series, continued fractions, and Padé-accelerated asymptotic expansions (§3.11(iv)) for the analytic continuations of Coulomb functions. Noble (2004) obtains double-precision accuracy for W - η , μ ( 2 ρ ) for a wide range of parameters using a combination of recurrence techniques, power-series expansions, and numerical quadrature; compare (33.2.7). …
    10: 10.53 Power Series
    For h n ( 1 ) ( z ) and h n ( 2 ) ( z ) combine (10.47.10), (10.53.1), and (10.53.2). For k n ( z ) combine (10.47.11), (10.53.3), and (10.53.4).