About the Project

matrix exponential

AdvancedHelp

(0.002 seconds)

11—20 of 35 matching pages

11: 21.5 Modular Transformations
21.5.4 θ ( [ [ 𝐂 𝛀 + 𝐃 ] 1 ] T 𝐳 | [ 𝐀 𝛀 + 𝐁 ] [ 𝐂 𝛀 + 𝐃 ] 1 ) = ξ ( 𝚪 ) det [ 𝐂 𝛀 + 𝐃 ] e π i 𝐳 [ [ 𝐂 𝛀 + 𝐃 ] 1 𝐂 ] 𝐳 θ ( 𝐳 | 𝛀 ) .
21.5.9 θ [ 𝐃 𝜶 𝐂 𝜷 + 1 2 diag [ 𝐂 𝐃 T ] 𝐁 𝜶 + 𝐀 𝜷 + 1 2 diag [ 𝐀 𝐁 T ] ] ( [ [ 𝐂 𝛀 + 𝐃 ] 1 ] T 𝐳 | [ 𝐀 𝛀 + 𝐁 ] [ 𝐂 𝛀 + 𝐃 ] 1 ) = κ ( 𝜶 , 𝜷 , 𝚪 ) det [ 𝐂 𝛀 + 𝐃 ] e π i 𝐳 [ [ 𝐂 𝛀 + 𝐃 ] 1 𝐂 ] 𝐳 θ [ 𝜶 𝜷 ] ( 𝐳 | 𝛀 ) ,
12: Bibliography D
  • P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou (1999b) Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory. Comm. Pure Appl. Math. 52 (11), pp. 1335–1425.
  • 13: 21.6 Products
    21.6.3 j = 1 h θ ( k = 1 h T j k 𝐳 k | 𝛀 ) = 1 𝒟 g 𝐀 𝒦 𝐁 𝒦 e 2 π i tr [ 1 2 𝐀 T 𝛀 𝐀 + 𝐀 T [ 𝐙 + 𝐁 ] ] j = 1 h θ ( 𝐳 j + 𝛀 𝐚 j + 𝐛 j | 𝛀 ) ,
    21.6.4 j = 1 h θ [ k = 1 h T j k 𝐜 k k = 1 h T j k 𝐝 k ] ( k = 1 h T j k 𝐳 k | 𝛀 ) = 1 𝒟 g 𝐀 𝒦 𝐁 𝒦 e 2 π i j = 1 h 𝐛 j 𝐜 j j = 1 h θ [ 𝐚 j + 𝐜 j 𝐛 j + 𝐝 j ] ( 𝐳 j | 𝛀 ) ,
    21.6.6 θ ( 𝐱 + 𝐲 + 𝐮 + 𝐯 2 | 𝛀 ) θ ( 𝐱 + 𝐲 𝐮 𝐯 2 | 𝛀 ) θ ( 𝐱 𝐲 + 𝐮 𝐯 2 | 𝛀 ) θ ( 𝐱 𝐲 𝐮 + 𝐯 2 | 𝛀 ) = 1 2 g 𝜶 1 2 g / g 𝜷 1 2 g / g e 2 π i ( 2 𝜶 𝛀 𝜶 + 𝜶 [ 𝐱 + 𝐲 + 𝐮 + 𝐯 ] ) θ ( 𝐱 + 𝛀 𝜶 + 𝜷 | 𝛀 ) θ ( 𝐲 + 𝛀 𝜶 + 𝜷 | 𝛀 ) θ ( 𝐮 + 𝛀 𝜶 + 𝜷 | 𝛀 ) θ ( 𝐯 + 𝛀 𝜶 + 𝜷 | 𝛀 ) ,
    21.6.7 θ [ 1 2 [ 𝐜 1 + 𝐜 2 + 𝐜 3 + 𝐜 4 ] 1 2 [ 𝐝 1 + 𝐝 2 + 𝐝 3 + 𝐝 4 ] ] ( 𝐱 + 𝐲 + 𝐮 + 𝐯 2 | 𝛀 ) θ [ 1 2 [ 𝐜 1 + 𝐜 2 𝐜 3 𝐜 4 ] 1 2 [ 𝐝 1 + 𝐝 2 𝐝 3 𝐝 4 ] ] ( 𝐱 + 𝐲 𝐮 𝐯 2 | 𝛀 ) θ [ 1 2 [ 𝐜 1 𝐜 2 + 𝐜 3 𝐜 4 ] 1 2 [ 𝐝 1 𝐝 2 + 𝐝 3 𝐝 4 ] ] ( 𝐱 𝐲 + 𝐮 𝐯 2 | 𝛀 ) θ [ 1 2 [ 𝐜 1 𝐜 2 𝐜 3 + 𝐜 4 ] 1 2 [ 𝐝 1 𝐝 2 𝐝 3 + 𝐝 4 ] ] ( 𝐱 𝐲 𝐮 + 𝐯 2 | 𝛀 ) = 1 2 g 𝜶 1 2 g / g 𝜷 1 2 g / g e 2 π i 𝜷 [ 𝐜 1 + 𝐜 2 + 𝐜 3 + 𝐜 4 ] θ [ 𝐜 1 + 𝜶 𝐝 1 + 𝜷 ] ( 𝐱 | 𝛀 ) θ [ 𝐜 2 + 𝜶 𝐝 2 + 𝜷 ] ( 𝐲 | 𝛀 ) θ [ 𝐜 3 + 𝜶 𝐝 3 + 𝜷 ] ( 𝐮 | 𝛀 ) θ [ 𝐜 4 + 𝜶 𝐝 4 + 𝜷 ] ( 𝐯 | 𝛀 ) .
    14: 28.29 Definitions and Basic Properties
    iff e π i ν is an eigenvalue of the matrix
    15: 28.2 Definitions and Basic Properties
    iff e π i ν is an eigenvalue of the matrix
    16: 35.3 Multivariate Gamma and Beta Functions
    35.3.2 Γ m ( s 1 , , s m ) = 𝛀 etr ( 𝐗 ) | 𝐗 | s m 1 2 ( m + 1 ) j = 1 m 1 | ( 𝐗 ) j | s j s j + 1 d 𝐗 , s j , ( s j ) > 1 2 ( j 1 ) , j = 1 , , m .
    17: 35.4 Partitions and Zonal Polynomials
    18: 33.22 Particle Scattering and Atomic and Molecular Spectra
    With e denoting here the elementary charge, the Coulomb potential between two point particles with charges Z 1 e , Z 2 e and masses m 1 , m 2 separated by a distance s is V ( s ) = Z 1 Z 2 e 2 / ( 4 π ε 0 s ) = Z 1 Z 2 α c / s , where Z j are atomic numbers, ε 0 is the electric constant, α is the fine structure constant, and is the reduced Planck’s constant. … For Z 1 Z 2 = 1 and m = m e , the electron mass, the scaling factors in (33.22.5) reduce to the Bohr radius, a 0 = / ( m e c α ) , and to a multiple of the Rydberg constant, R = m e c α 2 / ( 2 ) . … For scattering problems, the interior solution is then matched to a linear combination of a pair of Coulomb functions, F ( η , ρ ) and G ( η , ρ ) , or f ( ϵ , ; r ) and h ( ϵ , ; r ) , to determine the scattering S -matrix and also the correct normalization of the interior wave solutions; see Bloch et al. (1951). …
  • Searches for resonances as poles of the S -matrix in the complex half-plane 𝗄 < 𝟢 . See for example Csótó and Hale (1997).

  • 19: 3.11 Approximation Techniques
    The matrix is symmetric and positive definite, but the system is ill-conditioned when n is large because the lower rows of the matrix are approximately proportional to one another. … Since X k = X k , the matrix is again symmetric. … We take n complex exponentials ϕ k ( x ) = e i k x , k = 0 , 1 , , n 1 , and approximate f ( x ) by the linear combination (3.11.31). …
    ω n = e 2 π i / n , j = 0 , 1 , , n 1 ,
    The method of the fast Fourier transform (FFT) exploits the structure of the matrix 𝛀 with elements ω n j k , j , k = 0 , 1 , , n 1 . …
    20: 32.14 Combinatorics
    32.14.2 F ( s ) = exp ( s ( x s ) w 2 ( x ) d x ) ,
    The distribution function F ( s ) given by (32.14.2) arises in random matrix theory where it gives the limiting distribution for the normalized largest eigenvalue in the Gaussian Unitary Ensemble of n × n Hermitian matrices; see Tracy and Widom (1994). … See Forrester and Witte (2001, 2002) for other instances of Painlevé equations in random matrix theory.