About the Project

unstable pairs

AdvancedHelp

(0.002 seconds)

1—10 of 87 matching pages

1: 28.17 Stability as x ±
§28.17 Stability as x ±
If all solutions of (28.2.1) are bounded when x ± along the real axis, then the corresponding pair of parameters ( a , q ) is called stable. All other pairs are unstable. For example, positive real values of a with q = 0 comprise stable pairs, as do values of a and q that correspond to real, but noninteger, values of ν . However, if ν 0 , then ( a , q ) always comprises an unstable pair. …
2: 29.9 Stability
The Lamé equation (29.2.1) with specified values of k , h , ν is called stable if all of its solutions are bounded on ; otherwise the equation is called unstable. If ν is not an integer, then (29.2.1) is unstable iff h a ν 0 ( k 2 ) or h lies in one of the closed intervals with endpoints a ν m ( k 2 ) and b ν m ( k 2 ) , m = 1 , 2 , . If ν is a nonnegative integer, then (29.2.1) is unstable iff h a ν 0 ( k 2 ) or h [ b ν m ( k 2 ) , a ν m ( k 2 ) ] for some m = 1 , 2 , , ν .
3: 16.25 Methods of Computation
In these cases integration, or recurrence, in either a forward or a backward direction is unstable. …
4: 17.12 Bailey Pairs
§17.12 Bailey Pairs
Bailey Pairs
When (17.12.5) is iterated the resulting infinite sequence of Bailey pairs is called a Bailey Chain. … The Bailey pair that implies the Rogers–Ramanujan identities §17.2(vi) is: … The Bailey pair and Bailey chain concepts have been extended considerably. …
5: 28.33 Physical Applications
  • Boundary-values problems arising from solution of the two-dimensional wave equation in elliptical coordinates. This yields a pair of equations of the form (28.2.1) and (28.20.1), and the appropriate solution of (28.2.1) is usually a periodic solution of integer order. See §28.33(ii).

  • Hence from §28.17 the corresponding Mathieu equation is stable or unstable according as ( q , a ) is in the intersection of with the colored or the uncolored open regions depicted in Figure 28.17.1. …
    6: 24.19 Methods of Computation
    For number-theoretic applications it is important to compute B 2 n ( mod p ) for 2 n p 3 ; in particular to find the irregular pairs ( 2 n , p ) for which B 2 n 0 ( mod p ) . We list here three methods, arranged in increasing order of efficiency. …
  • A method related to “Stickelberger codes” is applied in Buhler et al. (2001); in particular, it allows for an efficient search for the irregular pairs ( 2 n , p ) . Discrete Fourier transforms are used in the computations. See also Crandall (1996, pp. 120–124).

  • 7: 11.13 Methods of Computation
    For 𝐌 ν ( x ) both forward and backward integration are unstable, and boundary-value methods are required (§3.7(iii)). …
    8: 32.4 Isomonodromy Problems
    P I P VI  can be expressed as the compatibility condition of a linear system, called an isomonodromy problem or Lax pair. Suppose …
    9: 10.25 Definitions
    §10.25(iii) Numerically Satisfactory Pairs of Solutions
    Table 10.25.1 lists numerically satisfactory pairs of solutions (§2.7(iv)) of (10.25.1). …
    Table 10.25.1: Numerically satisfactory pairs of solutions of the modified Bessel’s equation.
    Pair Region
    10: 27.5 Inversion Formulas
    27.5.3 g ( n ) = d | n f ( d ) f ( n ) = d | n g ( d ) μ ( n d ) .
    Special cases of Möbius inversion pairs are: …