|
Circular Ensembles
In the theory of random matrices, the circular ensembles are measures on spaces of unitary matrices introduced by Freeman Dyson as modifications of the Gaussian matrix ensembles. The three main examples are the circular orthogonal ensemble (COE) on symmetric unitary matrices, the circular unitary ensemble (CUE) on unitary matrices, and the circular symplectic ensemble (CSE) on self dual unitary quaternionic matrices. Probability distributions The distribution of the unitary circular ensemble CUE(''n'') is the Haar measure on the unitary group ''U(n)''. If ''U'' is a random element of CUE(''n''), then ''UTU'' is a random element of COE(''n''); if ''U'' is a random element of CUE(''2n''), then ''URU'' is a random element of CSE(''n''), where : U^R = \left( \begin 0 & -1 & & & & & \\ 1 & 0 & & & & & \\ & & 0 & -1 & & & \\ & & 1 & 0 & & & \\ & & & & \ddots & & \\ & & & & & 0& -1\\ & & & & & 1 & 0 \end \right) U^T \left( \begin 0 & 1 & & & & & \\ -1 & 0 & & & & & \\ & & 0 & ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Matrix
In probability theory and mathematical physics, a random matrix is a matrix-valued random variable—that is, a matrix in which some or all elements are random variables. Many important properties of physical systems can be represented mathematically as matrix problems. For example, the thermal conductivity of a lattice can be computed from the dynamical matrix of the particle-particle interactions within the lattice. Applications Physics In nuclear physics, random matrices were introduced by Eugene Wigner to model the nuclei of heavy atoms. Wigner postulated that the spacings between the lines in the spectrum of a heavy atom nucleus should resemble the spacings between the eigenvalues of a random matrix, and should depend only on the symmetry class of the underlying evolution. In solid-state physics, random matrices model the behaviour of large disordered Hamiltonians in the mean-field approximation. In quantum chaos, the Bohigas–Giannoni–Schmit (BGS) conjecture asserts ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symplectic Group
In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted and for positive integer ''n'' and field F (usually C or R). The latter is called the compact symplectic group and is also denoted by \mathrm(n). Many authors prefer slightly different notations, usually differing by factors of . The notation used here is consistent with the size of the most common matrices which represent the groups. In Cartan's classification of the simple Lie algebras, the Lie algebra of the complex group is denoted , and is the compact real form of . Note that when we refer to ''the'' (compact) symplectic group it is implied that we are talking about the collection of (compact) symplectic groups, indexed by their dimension . The name "symplectic group" is due to Hermann Weyl as a replacement for the previous confusing names (line) complex group and Abelian linear group, and is the Greek analog of "complex". The metaplect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Matrices
In probability theory and mathematical physics, a random matrix is a matrix-valued random variable—that is, a matrix in which some or all elements are random variables. Many important properties of physical systems can be represented mathematically as matrix problems. For example, the thermal conductivity of a lattice can be computed from the dynamical matrix of the particle-particle interactions within the lattice. Applications Physics In nuclear physics, random matrices were introduced by Eugene Wigner to model the nuclei of heavy atoms. Wigner postulated that the spacings between the lines in the spectrum of a heavy atom nucleus should resemble the spacings between the eigenvalues of a random matrix, and should depend only on the symmetry class of the underlying evolution. In solid-state physics, random matrices model the behaviour of large disordered Hamiltonians in the mean-field approximation. In quantum chaos, the Bohigas–Giannoni–Schmit (BGS) conjecture asserts ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pypi
The Python Package Index, abbreviated as PyPI () and also known as the Cheese Shop (a reference to the ''Monty Python's Flying Circus'' sketch " Cheese Shop"), is the official third-party software repository for Python. It is analogous to the CPAN repository for Perl and to the CRAN repository for R. PyPI is run by the Python Software Foundation, a charity. Some package managers, including pip, use PyPI as the default source for packages and their dependencies. more than 350,000 Python packages can be accessed through PyPI. PyPI primarily hosts Python packages in the form of archives called (source distributions) or precompiled "wheels." PyPI as an index allows users to search for packages by keywords or by filters against their metadata, such as free software license or compatibility with POSIX. A single entry on PyPI is able to store, aside from just a package and its metadata, previous releases of the package, precompiled wheels (e.g. containing DLLs on Windows), as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wolfram Language
The Wolfram Language ( ) is a general multi-paradigm programming language developed by Wolfram Research. It emphasizes symbolic computation, functional programming, and rule-based programming and can employ arbitrary structures and data. It is the programming language of the mathematical symbolic computation program Mathematica. History The Wolfram Language was a part of the initial version of Mathematica in 1988. Symbolic aspects of the engine make it a computer algebra system. The language can perform integration, differentiation, matrix manipulations, and solve differential equations using a set of rules. Also, the initial version introduced the notebook model and the ability to embed sound and images, according to Theodore Gray's patent. Wolfram also added features for more complex tasks, such as 3D modeling. A name was finally adopted for the language in 2013, as Wolfram Research decided to make a version of the language engine free for Raspberry Pi users, and they need ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
QR Decomposition
In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix ''A'' into a product ''A'' = ''QR'' of an orthogonal matrix ''Q'' and an upper triangular matrix ''R''. QR decomposition is often used to solve the linear least squares problem and is the basis for a particular eigenvalue algorithm, the QR algorithm. Cases and definitions Square matrix Any real square matrix ''A'' may be decomposed as : A = QR, where ''Q'' is an orthogonal matrix (its columns are orthogonal unit vectors meaning and ''R'' is an upper triangular matrix (also called right triangular matrix). If ''A'' is invertible, then the factorization is unique if we require the diagonal elements of ''R'' to be positive. If instead ''A'' is a complex square matrix, then there is a decomposition ''A'' = ''QR'' where ''Q'' is a unitary matrix (so If ''A'' has ''n'' linearly independent columns, then the first ''n'' columns of ''Q'' form an ortho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weingarten Function
In mathematics, Weingarten functions are rational functions indexed by partitions of integers that can be used to calculate integrals of products of matrix coefficients over classical groups. They were first studied by who found their asymptotic behavior, and named by , who evaluated them explicitly for the unitary group. Unitary groups Weingarten functions are used for evaluating integrals over the unitary group ''U''''d'' of products of matrix coefficients of the form :\int_ U_\cdots U_U^*_\cdots U^*_dU, where * denotes complex conjugation. Note that U^*_=(U^\dagger)_ where U^\dagger is the conjugate transpose of U, so one can interpret the above expression as being for the i_1j_1\ldots i_qj_qj'_1i'_1\ldots j'_qi'_q matrix element of U\otimes\cdots\otimes U\otimes U^\dagger\otimes\cdots\otimes U^\dagger. This integral is equal to :\sum_\delta_\cdots\delta_ \delta_\cdots\delta_W\!g(\sigma\tau^,d) where ''Wg'' is the Weingarten function, given by : W\!g(\sigma,d) = \frac\sum_\f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jacobi Polynomials
In mathematics, Jacobi polynomials (occasionally called hypergeometric polynomials) P_n^(x) are a class of Classical orthogonal polynomials, classical orthogonal polynomials. They are orthogonal with respect to the weight (1-x)^\alpha(1+x)^\beta on the interval [-1,1]. The Gegenbauer polynomials, and thus also the Legendre polynomials, Legendre, Zernike polynomials, Zernike and Chebyshev polynomials, are special cases of the Jacobi polynomials. The definition is in IV.1; the differential equation – in IV.2; Rodrigues' formula is in IV.3; the generating function is in IV.4; the recurrent relation is in IV.5. The Jacobi polynomials were introduced by Carl Gustav Jacob Jacobi. Definitions Via the hypergeometric function The Jacobi polynomials are defined via the hypergeometric function as follows: :P_n^(z)=\frac\,_2F_1\left(-n,1+\alpha+\beta+n;\alpha+1;\tfrac(1-z)\right), where (\alpha+1)_n is Pochhammer symbol, Pochhammer's symbol (for the rising factorial). In this case, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quaternion
In mathematics, the quaternion number system extends the complex numbers. Quaternions were first described by the Irish mathematician William Rowan Hamilton in 1843 and applied to mechanics in three-dimensional space. Hamilton defined a quaternion as the quotient of two '' directed lines'' in a three-dimensional space, or, equivalently, as the quotient of two vectors. Multiplication of quaternions is noncommutative. Quaternions are generally represented in the form :a + b\ \mathbf i + c\ \mathbf j +d\ \mathbf k where , and are real numbers; and , and are the ''basic quaternions''. Quaternions are used in pure mathematics, but also have practical uses in applied mathematics, particularly for calculations involving three-dimensional rotations, such as in three-dimensional computer graphics, computer vision, and crystallographic texture analysis. They can be used alongside other methods of rotation, such as Euler angles and rotation matrices, or as an alternative to them ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unitary Matrix
In linear algebra, a complex square matrix is unitary if its conjugate transpose is also its inverse, that is, if U^* U = UU^* = UU^ = I, where is the identity matrix. In physics, especially in quantum mechanics, the conjugate transpose is referred to as the Hermitian adjoint of a matrix and is denoted by a dagger (†), so the equation above is written U^\dagger U = UU^\dagger = I. The real analogue of a unitary matrix is an orthogonal matrix. Unitary matrices have significant importance in quantum mechanics because they preserve norms, and thus, probability amplitudes. Properties For any unitary matrix of finite size, the following hold: * Given two complex vectors and , multiplication by preserves their inner product; that is, . * is normal (U^* U = UU^*). * is diagonalizable; that is, is unitarily similar to a diagonal matrix, as a consequence of the spectral theorem. Thus, has a decomposition of the form U = VDV^*, where is unitary, and is diagonal and uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthogonal Group
In mathematics, the orthogonal group in dimension , denoted , is the Group (mathematics), group of isometry, distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by Function composition, composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of orthogonal matrix, orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose invertible matrix, inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact group, compact. The orthogonal group in dimension has two connected component (topology), connected components. The one that contains the identity element is a normal subgroup, called the special orthogonal group, and denoted . It consists of all orthogonal matrices of determinant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Selberg Integral
In mathematics, the Selberg integral is a generalization of Euler beta function to ''n'' dimensions introduced by . Selberg's integral formula When Re(\alpha) > 0, Re(\beta) > 0, Re(\gamma) > -\min \left(\frac 1n , \frac, \frac\right), we have : \begin S_ (\alpha, \beta, \gamma) & = \int_0^1 \cdots \int_0^1 \prod_^n t_i^(1-t_i)^ \prod_ , t_i - t_j , ^\,dt_1 \cdots dt_n \\ & = \prod_^ \frac \end Selberg's formula implies Dixon's identity for well poised hypergeometric series, and some special cases of Dyson's conjecture In mathematics, the Dyson conjecture is a conjecture about the constant term of certain Laurent polynomials, proved independently in 1962 by Wilson and Gunson. Andrews generalized it to the q-Dyson conjecture, proved by Zeilberger and Bressou .... This is a corollary of Aomoto. Aomoto's integral formula proved a slightly more general integral formula. With the same conditions as Selberg's formula, : \int_0^1 \cdots \int_0^1 \left(\prod_^k t_i\right) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
