About the Project

matrix

AdvancedHelp

(0.001 seconds)

31—40 of 74 matching pages

31: 1.3 Determinants, Linear Operators, and Spectral Expansions
1.3.6 det ( 𝐀 1 ) = 1 det ( 𝐀 ) ,
The determinant of an upper or lower triangular, or diagonal, square matrix 𝐀 is the product of the diagonal elements det ( 𝐀 ) = i = 1 n a i i . … The adjoint of a matrix 𝐀 is the matrix 𝐀 such that 𝐀 𝐚 , 𝐛 = 𝐚 , 𝐀 𝐛 for all 𝐚 , 𝐛 𝐄 n . In the case of a real matrix 𝐀 = 𝐀 T and in the complex case 𝐀 = 𝐀 H . … Let the columns of matrix 𝐒 be these eigenvectors 𝐚 1 , , 𝐚 n , then 𝐒 1 = 𝐒 H , and the similarity transformation (1.2.73) is now of the form 𝐒 H 𝐀 𝐒 = λ i δ i , j . …
32: 19.31 Probability Distributions
19.31.1 𝐱 T 𝐀 𝐱 = r = 1 n s = 1 n a r , s x r x s ,
19.31.2 n ( 𝐱 T 𝐀 𝐱 ) μ exp ( 𝐱 T 𝐁 𝐱 ) d x 1 d x n = π n / 2 Γ ( μ + 1 2 n ) det 𝐁 Γ ( 1 2 n ) R μ ( 1 2 , , 1 2 ; λ 1 , , λ n ) , μ > 1 2 n .
33: Bibliography Y
  • H. A. Yamani and L. Fishman (1975) J -matrix method: Extensions to arbitrary angular momentum and to Coulomb scattering. J. Math. Phys. 16, pp. 410–420.
  • 34: Philip J. Davis
    At CalTech, John Todd dedicated himself to the training of new researchers in numerical analysis, and Olga Taussky, who had been a full-time NBS consultant influential in establishing the field of matrix theory, became the first woman at CalTech to attain the academic rank of full professor. … 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. …
    35: Mathematical Introduction
    ( a , b ] or [ a , b ) half-closed intervals.
    [ a j , k ] or [ a j k ] matrix with ( j , k ) th element a j , k or a j k .
    𝐀 1 inverse of matrix 𝐀 .
    tr 𝐀 trace of matrix 𝐀 .
    𝐀 T transpose of matrix 𝐀 .
    𝐈 unit matrix.
    36: 18.36 Miscellaneous Polynomials
    §18.36(iv) Orthogonal Matrix Polynomials
    These are matrix-valued polynomials that are orthogonal with respect to a square matrix of measures on the real line. Classes of such polynomials have been found that generalize the classical OP’s in the sense that they satisfy second order matrix differential equations with coefficients independent of the degree. …
    37: 15.17 Mathematical Applications
    First, as spherical functions on noncompact Riemannian symmetric spaces of rank one, but also as associated spherical functions, intertwining functions, matrix elements of SL ( 2 , ) , and spherical functions on certain nonsymmetric Gelfand pairs. …
    38: 31.5 Solutions Analytic at Three Singularities: Heun Polynomials
    Let α = n , n = 0 , 1 , 2 , , and q n , m , m = 0 , 1 , , n , be the eigenvalues of the tridiagonal matrix
    39: 18.38 Mathematical Applications
    Random Matrix Theory
    Hermite polynomials (and their Freud-weight analogs (§18.32)) play an important role in random matrix theory. …
    40: 21.9 Integrable Equations
    21.9.4 u ( x , y , t ) = c + 2 2 x 2 ln ( θ ( 𝐤 x + 𝐥 y + 𝝎 t + ϕ | 𝛀 ) ) ,
    Furthermore, the solutions of the KP equation solve the Schottky problem: this is the question concerning conditions that a Riemann matrix needs to satisfy in order to be associated with a Riemann surface (Schottky (1903)). …