triangular matrices
(0.001 seconds)
1—10 of 43 matching pages
1: 13.27 Mathematical Applications
§13.27 Mathematical Applications
►Confluent hypergeometric functions are connected with representations of the group of third-order triangular matrices. …Vilenkin (1968, Chapter 8) constructs irreducible representations of this group, in which the diagonal matrices correspond to operators of multiplication by an exponential function. … …2: 3.2 Linear Algebra
…
►This yields a lower triangular matrix of the form
…If we denote by the upper triangular matrix comprising the elements in (3.2.3), then we have the factorization, or triangular decomposition,
…
►We solve the system for , taking advantage of the existing triangular decomposition of to obtain an improved solution .
…
►Tridiagonal matrices are ones in which the only nonzero elements occur on the main diagonal and two adjacent diagonals.
…
►The
-norm of a matrix
is
…
3: 1.2 Elementary Algebra
…
►
Multiplication of Matrices
… ►§1.2(vi) Square Matrices
… ►Special Forms of Square Matrices
… ►Norms of Square Matrices
… ►Non-Defective Square Matrices
…4: 1.3 Determinants, Linear Operators, and Spectral Expansions
…
►
Determinants of Upper/Lower Triangular and Diagonal Matrices
►The determinant of an upper or lower triangular, or diagonal, square matrix is the product of the diagonal elements . … ►§1.3(iv) Matrices as Linear Operators
… ►Real symmetric () and Hermitian () matrices are self-adjoint operators on . … ►For Hermitian matrices is unitary, and for real symmetric matrices is an orthogonal transformation. …5: 3.11 Approximation Techniques
…
►Starting with the first column , , and initializing the preceding column by , , we can compute the lower triangular part of the table via (3.11.25).
Similarly, the upper triangular part follows from the first row , , by initializing , .
…
►If , then can be factored into
matrices, the rows of which contain only a few nonzero entries and the nonzero entries are equal apart from signs.
…
6: 35.1 Special Notation
…
►All matrices are of order , unless specified otherwise.
…
►
►
…
complex variables. | |
… | |
space of all real symmetric matrices. | |
… | |
space of positive-definite real symmetric matrices. | |
… | |
is positive definite. Similarly, is equivalent. | |
… | |
space of orthogonal matrices. | |
… |
7: 29.20 Methods of Computation
…
►A third method is to approximate eigenvalues and Fourier coefficients of Lamé functions by eigenvalues and eigenvectors of finite matrices using the methods of §§3.2(vi) and 3.8(iv).
These matrices are the same as those provided in §29.15(i) for the computation of Lamé polynomials with the difference that has to be chosen sufficiently large.
…
►The eigenvalues corresponding to Lamé polynomials are computed from eigenvalues of the finite tridiagonal matrices
given in §29.15(i), using methods described in §3.2(vi) and Ritter (1998).
…
8: 35.9 Applications
…
►In multivariate statistical analysis based on the multivariate normal distribution, the probability density functions of many random matrices are expressible in terms of generalized hypergeometric functions of matrix argument , with and .
…
►In the nascent area of applications of zonal polynomials to the limiting probability distributions of symmetric random matrices, one of the most comprehensive accounts is Rains (1998).
9: Morris Newman
…
►Newman wrote the book Matrix Representations of Groups, published by the National Bureau of Standards in 1968, and the book Integral Matrices, published by Academic Press in 1972, which became a classic.
…