Sampling the eigenvalues of random orthogonal and unitary matrices
From MaRDI portal
Publication:2020693
Abstract: We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such matrices, and then computes their eigenvalues with a tailored core-chasing algorithm. This approach requires a number of floating-point operations that is quadratic in the order of the matrix being sampled, and can be adapted to other matrix groups. In particular, we explain how it can be used to sample the Haar measure over the special orthogonal and unitary groups and the conditional probability distribution obtained by requiring the determinant of the sampled matrix be a given complex number on the complex unit circle.
Recommendations
Cites work
- scientific article; zbMATH DE number 2187386 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 2003146 (Why is no real title available?)
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- scientific article; zbMATH DE number 3069216 (Why is no real title available?)
- A CMV-Based Eigensolver for Companion Matrices
- A divide and conquer method for unitary and orthogonal eigenproblems
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- An implementation of a divide and conquer algorithm for the unitary eigen problem
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
- Core-Chasing Algorithms for the Eigenvalue Problem
- Determinantal random point fields
- Developments in random matrix theory
- Eigenvalue distributions of large Hermitian matrices; Wigner's semi- circle law and a theorem of Kac, Murdock, and Szegö
- Fast Hessenberg reduction of some rank structured matrices
- Fast and backward stable computation of roots of polynomials. II: Backward error analysis; companion matrix and companion pencil
- Fast and stable unitary QR algorithm
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- How to generate random matrices from the classical compact groups
- Isotropic distributions of test matrices
- Lie Groups, Lie Algebras, and Representations
- Log-gases and random matrices.
- Numerical inverting of matrices of high order
- On the Eigenvalues of Random Matrices
- Random matrix methods for wireless communications.
- Random matrix theory
- Random matrix theory, numerical computation and applications
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The Matrix Eigenvalue Problem
- The QR algorithm for unitary Hessenberg matrices
- The Subgroup Algorithm for Generating Uniform Random Variables
- The eigenvalues of random symmetric matrices
Cited in
(8)- Sturm sequences and random eigenvalue distributions
- Algorithm and software for defining the distribution of eigenvalues of random symmetric matrices via simulation
- scientific article; zbMATH DE number 1390107 (Why is no real title available?)
- On spectral and numerical properties of random butterfly matrices
- Random orthogonal matrix simulation
- How long does it take to compute the eigenvalues of a random symmetric matrix?
- Sampling unitary ensembles
- Factorization, invariant measure, and random selection of matrices in SU(n) and other groups
This page was built for publication: Sampling the eigenvalues of random orthogonal and unitary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020693)