About the Project

Floquet theorem

AdvancedHelp

(0.002 seconds)

1—10 of 123 matching pages

1: 28.29 Definitions and Basic Properties
§28.29(ii) Floquet’s Theorem and the Characteristic Exponent
A solution satisfying (28.29.7) is called a Floquet solution with respect to ν (or Floquet solution). …
28.29.10 F ν ( z ) = e i ν z P ν ( z ) ,
A nontrivial solution w ( z ) is either a Floquet solution with respect to ν , or w ( z + π ) e i ν π w ( z ) is a Floquet solution with respect to ν . …
2: 28.2 Definitions and Basic Properties
§28.2(iii) Floquet’s Theorem and the Characteristic Exponents
If q 0 , then for a given value of ν the corresponding Floquet solution is unique, except for an arbitrary constant factor (Theorem of Ince; see also 28.5(i)). The Fourier series of a Floquet solution …leads to a Floquet solution. …
3: 28.27 Addition Theorems
§28.27 Addition Theorems
Addition theorems provide important connections between Mathieu functions with different parameters and in different coordinate systems. They are analogous to the addition theorems for Bessel functions (§10.23(ii)) and modified Bessel functions (§10.44(ii)). …
4: 28.34 Methods of Computation
§28.34(iii) Floquet Solutions
5: 27.15 Chinese Remainder Theorem
§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. This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod m 1 ), (mod m 2 ), (mod m 3 ), and (mod m 4 ), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
6: Bibliography D
  • B. Deconinck and J. N. Kutz (2006) Computing spectra of linear operators using the Floquet-Fourier-Hill method. J. Comput. Phys. 219 (1), pp. 296–321.
  • S. C. Dhar (1940) Note on the addition theorem of parabolic cylinder functions. J. Indian Math. Soc. (N. S.) 4, pp. 29–30.
  • H. Ding, K. I. Gross, and D. St. P. Richards (1996) Ramanujan’s master theorem for symmetric cones. Pacific J. Math. 175 (2), pp. 447–490.
  • J. Dougall (1907) On Vandermonde’s theorem, and some more general expansions. Proc. Edinburgh Math. Soc. 25, pp. 114–132.
  • 7: 30.10 Series and Integrals
    For an addition theorem, see Meixner and Schäfke (1954, p. 300) and King and Van Buren (1973). …
    8: 10.44 Sums
    §10.44(i) Multiplication Theorem
    §10.44(ii) Addition Theorems
    Neumann’s Addition Theorem
    Graf’s and Gegenbauer’s Addition Theorems
    9: 19.35 Other Applications
    §19.35(i) Mathematical
    Generalizations of elliptic integrals appear in analysis of modular theorems of Ramanujan (Anderson et al. (2000)); analysis of Selberg integrals (Van Diejen and Spiridonov (2001)); use of Legendre’s relation (19.7.1) to compute π to high precision (Borwein and Borwein (1987, p. 26)). …
    10: 13.13 Addition and Multiplication Theorems
    §13.13 Addition and Multiplication Theorems
    §13.13(i) Addition Theorems for M ( a , b , z )
    §13.13(ii) Addition Theorems for U ( a , b , z )
    13.13.12 e y ( x + y x ) 1 b n = 0 ( y ) n n ! x n U ( a n , b n , x ) , | y | < | x | .
    §13.13(iii) Multiplication Theorems for M ( a , b , z ) and U ( a , b , z )