About the Project

of matrices

AdvancedHelp

(0.000 seconds)

11—20 of 41 matching pages

11: 21.1 Special Notation
g , h positive integers.
g × h set of all g × h matrices with integer elements.
Uppercase boldface letters are g × g real or complex matrices. …
12: 35.2 Laplace Transform
35.2.1 g ( 𝐙 ) = 𝛀 etr ( 𝐙 𝐗 ) f ( 𝐗 ) d 𝐗 ,
35.2.3 f 1 f 2 ( 𝐓 ) = 𝟎 < 𝐗 < 𝐓 f 1 ( 𝐓 𝐗 ) f 2 ( 𝐗 ) d 𝐗 .
13: 21.6 Products
21.6.1 𝒦 = g × h 𝐓 / ( g × h 𝐓 g × h ) ,
that is, 𝒦 is the set of all g × h matrices that are obtained by premultiplying 𝐓 by any g × h matrix with integer elements; two such matrices in 𝒦 are considered equivalent if their difference is a matrix with integer elements. …
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 | 𝛀 ) ,
14: 35.4 Partitions and Zonal Polynomials
15: 1.3 Determinants, Linear Operators, and Spectral Expansions
Determinants of Upper/Lower Triangular and Diagonal Matrices
§1.3(iv) Matrices as Linear Operators
Real symmetric ( 𝐀 = 𝐀 T ) and Hermitian ( 𝐀 = 𝐀 H ) matrices are self-adjoint operators on 𝐄 n . … For Hermitian matrices 𝐒 is unitary, and for real symmetric matrices 𝐒 is an orthogonal transformation. …
16: 35.6 Confluent Hypergeometric Functions of Matrix Argument
35.6.2 Ψ ( a ; b ; 𝐓 ) = 1 Γ m ( a ) 𝛀 etr ( 𝐓 𝐗 ) | 𝐗 | a 1 2 ( m + 1 ) | 𝐈 + 𝐗 | b a 1 2 ( m + 1 ) d 𝐗 , ( a ) > 1 2 ( m 1 ) , 𝐓 𝛀 .
35.6.6 B m ( b 1 , b 2 ) | 𝐓 | b 1 + b 2 1 2 ( m + 1 ) F 1 1 ( a 1 + a 2 b 1 + b 2 ; 𝐓 ) = 𝟎 < 𝐗 < 𝐓 | 𝐗 | b 1 1 2 ( m + 1 ) F 1 1 ( a 1 b 1 ; 𝐗 ) | 𝐓 𝐗 | b 2 1 2 ( m + 1 ) F 1 1 ( a 2 b 2 ; 𝐓 𝐗 ) d 𝐗 , ( b 1 ) , ( b 2 ) > 1 2 ( m 1 ) .
35.6.8 𝛀 | 𝐓 | c 1 2 ( m + 1 ) Ψ ( a ; b ; 𝐓 ) d 𝐓 = Γ m ( c ) Γ m ( a c ) Γ m ( c b + 1 2 ( m + 1 ) ) Γ m ( a ) Γ m ( a b + 1 2 ( m + 1 ) ) , ( a ) > ( c ) + 1 2 ( m 1 ) > m 1 , ( c b ) > 1 .
17: 19.31 Probability Distributions
More generally, let 𝐀 ( = [ a r , s ] ) and 𝐁 ( = [ b r , s ] ) be real positive-definite matrices with n rows and n columns, and let λ 1 , , λ n be the eigenvalues of 𝐀 𝐁 1 . …
18: 28.34 Methods of Computation
  • (d)

    Solution of the matrix eigenvalue problem for each of the five infinite matrices that correspond to the linear algebraic equations (28.4.5)–(28.4.8) and (28.14.4). See Zhang and Jin (1996, pp. 479–482) and §3.2(iv).

  • 19: Philip J. Davis
    This immediately led to discussions among some of the project members about what might be possible, and the discovery that some interactive graphics work had already been done for the NIST Matrix Market, a publicly available repository of test matrices for comparing the effectiveness of numerical linear algebra algorithms. …
    20: 35.8 Generalized Hypergeometric Functions of Matrix Argument