About the Project

rotation matrices

AdvancedHelp

(0.003 seconds)

1—10 of 70 matching pages

1: Philip J. Davis
After receiving an overview of the project and watching a short demo that included a few preliminary colorful, but static, 3D graphs constructed for the first Chapter, “Airy and Related Functions”, written by Olver, Davis expressed the hope that designing a web-based resource would allow the team to incorporate interesting computer graphics, such as function surfaces that could be rotated and examined. 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. … DLMF users can rotate, rescale, zoom and otherwise explore mathematical function surfaces. …
2: 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. … …
3: 34.3 Basic Properties: 3 j Symbol
Equations (34.3.19)–(34.3.22) are particular cases of more general results that relate rotation matrices to 3 j symbols, for which see Edmonds (1974, Chapter 4). …
4: 35.1 Special Notation
All matrices are of order m × m , unless specified otherwise. …
a , b complex variables.
𝓢 space of all real symmetric matrices.
𝛀 space of positive-definite real symmetric matrices.
𝐗 > 𝐓 𝐗 𝐓 is positive definite. Similarly, 𝐓 < 𝐗 is equivalent.
𝐎 ( m ) space of orthogonal matrices.
5: 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 n 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). …
6: 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 F q p , with p 2 and q 1 . … 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).
7: Viewing DLMF Interactive 3D Graphics
Users can render a 3D scene and interactively rotate, scale, and otherwise explore a function surface. …
8: 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. …
9: 32.14 Combinatorics
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). …
10: 10.42 Zeros
The distribution of the zeros of K n ( n z ) in the sector 3 2 π ph z 1 2 π in the cases n = 1 , 5 , 10 is obtained on rotating Figures 10.21.2, 10.21.4, 10.21.6, respectively, through an angle 1 2 π so that in each case the cut lies along the positive imaginary axis. …