The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
From MaRDI portal
Publication:3886743
DOI10.1137/0717034zbMath0443.65027OpenAlexW2086351984WikidataQ56115602 ScholiaQ56115602MaRDI QIDQ3886743
Publication date: 1980
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0717034
random matricesHouseholder transformationsHaar distributiongeneration of random orthogonal matricesestimating the condition number of a matrix
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Random matrices (algebraic aspects) (15B52) Random number generation in numerical analysis (65C10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A probabilistic framework for problems with real structured uncertainty in systems and control, Error analysis of an algorithm for equality-constrained quadratic programming problems, Principal component analysis using frequency components of multivariate time series, Optimal Low-rank Approximations of Bayesian Linear Inverse Problems, Computation of generalized matrix functions with rational Krylov methods, Zero-Knowledge Interactive Proof Systems for New Lattice Problems, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Rotation‐based multiple testing in the multivariate linear model, A new method for simultaneous estimation of the factor model parameters, factor scores, and unique parts, A topological view on the identification of structural vector autoregressions, Generating polycrystalline microstructures with prescribed tensorial texture coefficients, Numerical solution of linear least-squares problems with linear equality constraints, Quantum random state generation with predefined entanglement constraint, On the weighting method for least squares problems with linear equality constraints, A QR algorithm with variable iteration multiplicity, The growth factor and efficiency of Gaussian elimination with rook pivoting, The arithmetic mean preconditioner for multivector computers, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Some methods for generating both an NT-net and the uniform distribution on a Stiefel manifold and their applications, A unified performance analysis of likelihood-informed subspace methods, Effective population size in simple infectious disease models, Matchgate shadows for fermionic quantum simulation, Simulating realistic correlation matrices for financial applications: correlation matrices with the Perron–Frobenius property, Numerical Computation of Multivariate Normal Probabilities Using Bivariate Conditioning, Toward Single Particle Reconstruction without Particle Picking: Breaking the Detection Limit, Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting, A unified approach to synchronization problems over subgroups of the orthogonal group, Determinantal reinforcement learning with techniques to avoid poor local optima, Least-squares bilinear clustering of three-way data, Correlation matrices with average constraints, Factor modeling of multivariate time series: a frequency components approach, Fully symmetric interpolatory rules for multiple integrals over hyper-spherical surfaces, Bayesian semiparametric multivariate density deconvolution via stochastic rotation of replicates, Mesh adaptive direct search with second directional derivative-based Hessian update, Evaluating nearly singular multinormal expectations with application to wave distributions, Quantum circuits synthesis using Householder transformations, Hurwitz and the origins of random matrix theory in mathematics, Local Procrustes for manifold embedding: a measure of embedding quality and embedding algorithms, On estimating the least singular value of a matrix, Quasi-stochastic integration filter for nonlinear estimation, A stochastic algorithm for high-dimensional integrals over unbounded regions with Gaussian weight, Fast computation of robust subspace estimators, A class of methods for solving large, convex quadratic programs subject to box constraints, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Fast linear algebra is stable, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, Random Matrices Generating Large Growth in LU Factorization with Pivoting, On the distribution of order types, Modified Cholesky algorithms: A catalog with new approaches, Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems, Unsupervised streaming anomaly detection for instrumented infrastructure, Control design with hard/soft performance specifications: aQ-parameter randomization approach, Direct search methods on reductive homogeneous spaces, Computational complexity of a piecewise linear homotopy algorithm, Uniformly distributed sequences in the orthogonal group and on the Grassmannian manifold, An arithmetic for matrix pencils: theory and new algorithms, Sampling the eigenvalues of random orthogonal and unitary matrices, On spectral and numerical properties of random butterfly matrices, How to pick a random integer matrix? (and other questions), An efficient LDU algorithm for the minimal least squares solution of linear systems, Mesh adaptive direct search with simplicial Hessian update, Marginal likelihood for parallel series, Constrained definite Hessians tend to be well conditioned, An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm, Block Modified Gram--Schmidt Algorithms and Their Analysis, The Subgroup Algorithm for Generating Uniform Random Variables, A modified projection algorithm for large strictly-convex quadratic programs, Hierarchical-block conditioning approximations for high-dimensional multivariate normal probabilities, Equivariant mappings: A new approach in stochastic simulations, Generating Extreme-Scale Matrices With Specified Singular Values or Condition Number, Sampling unitary ensembles, Report on test matrices for generalized inverses, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, Primes in arithmetic progressions, Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections, Generating MCMC proposals by randomly rotating the regular simplex, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗, Bivariate conditioning approximations for multivariate normal probabilities
