About the Project
NIST

values at infinity

AdvancedHelp

(0.003 seconds)

21—30 of 119 matching pages

21: 13.2 Definitions and Basic Properties
This equation has a regular singularity at the origin with indices 0 and 1 - b , and an irregular singularity at infinity of rank one. …In effect, the regular singularities of the hypergeometric differential equation at b and coalesce into an irregular singularity at . … In general, U ( a , b , z ) has a branch point at z = 0 . The principal branch corresponds to the principal value of z - a in (13.2.6), and has a cut in the z -plane along the interval ( - , 0 ] ; compare §4.2(i). …
22: 1.10 Functions of a Complex Variable
The singularities of f ( z ) at infinity are classified in the same way as the singularities of f ( 1 / z ) at z = 0 . … A function whose only singularities, other than the point at infinity, are poles is called a meromorphic function. … In any neighborhood of an isolated essential singularity, however small, an analytic function assumes every value in with at most one exception. … Functions which have more than one value at a given point z are called multivalued (or many-valued) functions. … Then the value of F ( z ) at any other point is obtained by analytic continuation. …
23: 28.5 Second Solutions fe n , ge n
As a consequence of the factor z on the right-hand sides of (28.5.1), (28.5.2), all solutions of Mathieu’s equation that are linearly independent of the periodic solutions are unbounded as z ± on . …
24: 13.4 Integral Representations
At the point where the contour crosses the interval ( 1 , ) , t - b and the F 1 2 function assume their principal values; compare §§15.1 and 15.2(i). …
25: 32.11 Asymptotic Approximations for Real Variables
Next, for given initial conditions w ( 0 ) = 0 and w ( 0 ) = k , with k real, w ( x ) has at least one pole on the real axis. There are two special values of k , k 1 and k 2 , with the properties - 0.45142 8 < k 1 < - 0.45142 7 , 1.85185 3 < k 2 < 1.85185 5 , and such that: … Conversely, for any nonzero real k , there is a unique solution w k ( x ) of (32.11.4) that is asymptotic to k Ai ( x ) as x + . … If | k | > 1 , then w k ( x ) has a pole at a finite point x = c 0 , dependent on k , and … Now suppose x - . …
26: 22.11 Fourier and Hyperbolic Series
22.11.1 sn ( z , k ) = 2 π K k n = 0 q n + 1 2 sin ( ( 2 n + 1 ) ζ ) 1 - q 2 n + 1 ,
22.11.2 cn ( z , k ) = 2 π K k n = 0 q n + 1 2 cos ( ( 2 n + 1 ) ζ ) 1 + q 2 n + 1 ,
22.11.3 dn ( z , k ) = π 2 K + 2 π K n = 1 q n cos ( 2 n ζ ) 1 + q 2 n .
In (22.11.7)–(22.11.12) the left-hand sides are replaced by their limiting values at the poles of the Jacobian functions. …
27: 2.10 Sums and Sequences
In both expansions the remainder term is bounded in absolute value by the first neglected term in the sum, and has the same sign, provided that in the case of (2.10.7), truncation takes place at s = 2 m - 1 , where m is any positive integer satisfying m 1 2 ( α + 1 ) . For extensions of the Euler–Maclaurin formula to functions f ( x ) with singularities at x = a or x = n (or both) see Sidi (2004, 2012b, 2012a). … For an extension to integrals with Cauchy principal values see Elliott (1998). … The singularities of f ( z ) on the unit circle are branch points at z = e ± i α . To match the limiting behavior of f ( z ) at these points we set …
28: 9.19 Approximations
  • Martín et al. (1992) provides two simple formulas for approximating Ai ( x ) to graphical accuracy, one for - < x 0 , the other for 0 x < .

  • Moshier (1989, §6.14) provides minimax rational approximations for calculating Ai ( x ) , Ai ( x ) , Bi ( x ) , Bi ( x ) . They are in terms of the variable ζ , where ζ = 2 3 x 3 / 2 when x is positive, ζ = 2 3 ( - x ) 3 / 2 when x is negative, and ζ = 0 when x = 0 . The approximations apply when 2 ζ < , that is, when 3 2 / 3 x < or - < x - 3 2 / 3 . The precision in the coefficients is 21S.

  • These expansions are for real arguments x and are supplied in sets of four for each function, corresponding to intervals - < x a , a x 0 , 0 x b , b x < . …
  • Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of Ai ( z ) , Ai ( z ) stored at the nodes. Ai ( z ) and Ai ( z ) are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of Ai ( z ) , Ai ( z ) at the node. Similarly for Bi ( z ) , Bi ( z ) .

  • MacLeod (1994) supplies Chebyshev-series expansions to cover Gi ( x ) for 0 x < and Hi ( x ) for - < x 0 . The Chebyshev coefficients are given to 20D.

  • 29: 14.16 Zeros
    For uniform asymptotic approximations for the zeros of P n - m ( x ) in the interval - 1 < x < 1 when n with m ( 0 ) fixed, see Olver (1997b, p. 469).
    §14.16(iii) Interval 1 < x <
    P ν μ ( x ) has exactly one zero in the interval ( 1 , ) if either of the following sets of conditions holds: … For all other values of μ and ν (with ν - 1 2 ) P ν μ ( x ) has no zeros in the interval ( 1 , ) . Q ν μ ( x ) has no zeros in the interval ( 1 , ) when ν > - 1 , and at most one zero in the interval ( 1 , ) when ν < - 1 .
    30: 4.2 Definitions
    This is a multivalued function of z with branch point at z = 0 . … ln z is a single-valued analytic function on ( - , 0 ] and real-valued when z ranges over the positive real numbers. … The principal value is …This is an analytic function of z on ( - , 0 ] , and is two-valued and discontinuous on the cut shown in Figure 4.2.1, unless a . …