About the Project

Lax%20pairs

AdvancedHelp

(0.002 seconds)

1—10 of 170 matching pages

1: 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 …
2: 18.38 Mathematical Applications
Integrable Systems
It has elegant structures, including N -soliton solutions, Lax pairs, and Bäcklund transformations. …
3: 27.15 Chinese Remainder Theorem
The Chinese remainder theorem states that a system of congruences x a 1 ( mod m 1 ) , , x a k ( mod m k ) , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod m ), where m is the product of the moduli. … Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
4: 20 Theta Functions
Chapter 20 Theta Functions
5: 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. …
6: 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. …
7: 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.

  • Kerimov and Skorokhodov (1985a) tabulates 5 (nonreal) complex conjugate pairs of zeros of the principal branches of Y n ( z ) and Y n ( z ) for n = 0 ( 1 ) 5 , 8D.

  • 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.

  • 8: 3.8 Nonlinear Equations
    Let z 2 s z t be an approximation to the real quadratic factor of p ( z ) that corresponds to a pair of conjugate complex zeros or to a pair of real zeros. …
    3.8.15 p ( x ) = ( x 1 ) ( x 2 ) ( x 20 )
    Consider x = 20 and j = 19 . We have p ( 20 ) = 19 ! and a 19 = 1 + 2 + + 20 = 210 . …
    3.8.16 d x d a 19 = 20 19 19 ! = ( 4.30 ) × 10 7 .
    9: 36.5 Stokes Sets
    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 ) ,
    They generate a pair of cusp-edged sheets connected to the cusped sheets of the swallowtail bifurcation set (§36.4). …
    10: 26.14 Permutations: Order Notation
    As an example, 35247816 is an element of 𝔖 8 . The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … A descent of a permutation is a pair of adjacent elements for which the first is larger than the second. …