About the Project

of%20one%20variable

AdvancedHelp

(0.003 seconds)

11—20 of 30 matching pages

11: 36.4 Bifurcation Sets
This is the codimension-one surface in 𝐱 space where critical points coalesce, satisfying (36.4.1) and … This is the codimension-one surface in 𝐱 space where critical points coalesce, satisfying (36.4.2) and …
x = 9 20 z 2 .
x = 3 20 z 2 ,
12: Bibliography G
  • W. Gautschi (1965) Algorithm 259: Legendre functions for arguments larger than one. Comm. ACM 8 (8), pp. 488–492.
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • B. N. Gupta (1970) On Mill’s ratio. Proc. Cambridge Philos. Soc. 67, pp. 363–364.
  • 13: 20.11 Generalizations and Analogs
    In the case z = 0 identities for theta functions become identities in the complex variable q , with | q | < 1 , that involve rational functions, power series, and continued fractions; see Adiga et al. (1985), McKean and Moll (1999, pp. 156–158), and Andrews et al. (1988, §10.7). … However, in this case q is no longer regarded as an independent complex variable within the unit circle, because k is related to the variable τ = τ ( k ) of the theta functions via (20.9.2). … For specialization to the one-dimensional theta functions treated in the present chapter, see Rauch and Lebowitz (1973) and §21.7(iii). … A further development on the lines of Neville’s notation (§20.1) is as follows. … Such sets of twelve equations include derivatives, differential equations, bisection relations, duplication relations, addition formulas (including new ones for theta functions), and pseudo-addition formulas. …
    14: 36.5 Stokes Sets
    Stokes sets are surfaces (codimension one) in 𝐱 space, across which Ψ K ( 𝐱 ; k ) or Ψ ( U ) ( 𝐱 ; k ) acquires an exponentially-small asymptotic contribution (in k ), associated with a complex critical point of Φ K or Φ ( U ) . … In the following subsections, only Stokes sets involving at least one real saddle are included unless stated otherwise. …
    36.5.4 80 x 5 40 x 4 55 x 3 + 5 x 2 + 20 x 1 = 0 ,
    36.5.7 X = 9 20 + 20 u 4 Y 2 20 u 2 + 6 u 2 sign ( z ) ,
    One of the sheets is symmetrical under reflection in the plane y = 0 , and is given by …
    15: 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.
  • L. V. Ahlfors (1966) Complex Analysis: An Introduction of the Theory of Analytic Functions of One Complex Variable. 2nd edition, McGraw-Hill Book Co., New York.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • R. Askey (1982b) Commentary on the Paper “On certain special sets of orthogonal polynomials”. Contemporary Mathematicians, Birkhäuser, Boston, Mass..
  • 16: Bibliography D
  • C. de la Vallée Poussin (1896b) Recherches analytiques sur la théorie des nombres premiers. Deuxième partie. Les fonctions de Dirichlet et les nombres premiers de la forme linéaire M x + N . Ann. Soc. Sci. Bruxelles 20, pp. 281–397 (French).
  • H. Delange (1988) On the real roots of Euler polynomials. Monatsh. Math. 106 (2), pp. 115–138.
  • Delft Numerical Analysis Group (1973) On the computation of Mathieu functions. J. Engrg. Math. 7, pp. 39–61.
  • B. Döring (1966) Complex zeros of cylinder functions. Math. Comp. 20 (94), pp. 215–222.
  • T. M. Dunster (1989) Uniform asymptotic expansions for Whittaker’s confluent hypergeometric functions. SIAM J. Math. Anal. 20 (3), pp. 744–760.
  • 17: 26.3 Lattice Paths: Binomial Coefficients
    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 ) .
    Table 26.3.1: Binomial coefficients ( m n ) .
    m n
    6 1 6 15 20 15 6 1
    Table 26.3.2: Binomial coefficients ( m + n m ) for lattice paths.
    m n
    3 1 4 10 20 35 56 84 120 165
    26.3.3 n = 0 m ( m n ) x n = ( 1 + x ) m , m = 0 , 1 , ,
    26.3.4 m = 0 ( m + n m ) x m = 1 ( 1 x ) n + 1 , | x | < 1 .
    18: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    (The empty set is considered to have one permutation consisting of no cycles.) …
    Table 26.4.1: Multinomials and partitions.
    n m λ M 1 M 2 M 3
    5 2 2 1 , 3 1 10 20 10
    5 3 1 2 , 3 1 20 20 10
    26.4.9 ( x 1 + x 2 + + x k ) n = ( n n 1 , n 2 , , n k ) x 1 n 1 x 2 n 2 x k n k ,
    19: 18.39 Applications in the Physical Sciences
    Introduction and One-Dimensional (1D) Systems
    As in classical dynamics this sum is the total energy of the one particle system. …
    1D Quantum Systems with Analytically Known Stationary States
    Derivations of (18.39.42) appear in Bethe and Salpeter (1957, pp. 12–20), and Pauling and Wilson (1985, Chapter V and Appendix VII), where the derivations are based on (18.39.36), and is also the notation of Piela (2014, §4.7), typifying the common use of the associated Coulomb–Laguerre polynomials in theoretical quantum chemistry. … The discrete variable representations (DVR) analysis is simplest when based on the classical OP’s with their analytically known recursion coefficients (Table 3.5.17_5), or those non-classical OP’s which have analytically known recursion coefficients, making stable computation of the x i and w i , from the J-matrix as in §3.5(vi), straightforward. …
    20: Bibliography K
  • E. G. Kalnins and W. Miller (1993) Orthogonal Polynomials on n -spheres: Gegenbauer, Jacobi and Heun. In Topics in Polynomials of One and Several Variables and their Applications, pp. 299–322.
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • T. H. Koornwinder (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.