A randomized algorithm for the decomposition of matrices
From MaRDI portal
Publication:617703
DOI10.1016/J.ACHA.2010.02.003zbMATH Open1210.65095OpenAlexW2057261601MaRDI QIDQ617703FDOQ617703
Authors: Vladimir Rokhlin, Mark Tygert, P. G. Martinsson 
Publication date: 13 January 2011
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2010.02.003
Recommendations
- A fast randomized algorithm for the approximation of matrices
- Randomized algorithms for the low-rank approximation of matrices
- scientific article; zbMATH DE number 741152
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast monte-carlo algorithms for finding low-rank approximations
Cites Work
- Algorithm 844
- Title not available (Why is that?)
- Latent semantic indexing: A probabilistic analysis
- A theory of pseudoskeleton approximations
- Incomplete cross approximation in the mosaic-skeleton method
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- The maximal-volume concept in approximation by low-rank matrices
- Numerical Inverting of Matrices of High Order. II
- Pseudo-skeleton approximations by matrices of maximal volume
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast algorithm for the inversion of general Toeplitz matrices
- Numerics of Gram-Schmidt orthogonalization
- Some Applications of the Rank Revealing QR Factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Condition Numbers of Gaussian Random Matrices
- On the Compression of Low Rank Matrices
- On interpolation and integration in finite-dimensional spaces of bounded functions
Cited In (95)
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Randomized algorithms for the low-rank approximation of matrices
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- Title not available (Why is that?)
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction
- Matrix decompositions using sub-Gaussian random matrices
- Randomized block Krylov methods for approximating extreme eigenvalues
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Randomized core reduction for discrete ill-posed problem
- Stochastic boundary methods of fundamental solutions for solving PDEs
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
- A simple filter for detecting low-rank submatrices
- Detecting low-rank clusters via random sampling
- A randomized singular value decomposition for third-order oriented tensors
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence
- Efficient methods for grouping vectors into low-rank clusters
- Randomized complete pivoting for solving symmetric indefinite linear systems
- Randomized LU decomposition using sparse projections
- Randomized matrix-free trace and log-determinant estimators
- A fast randomized algorithm for the approximation of matrices
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
- Updating kernel methods in spectral decomposition by affinity perturbations
- Randomized interpolative decomposition of separated representations
- The method of polarized traces for the 2D Helmholtz equation
- A locally optimal rank revealing product decomposition
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures
- Title not available (Why is that?)
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Practical sketching algorithms for low-rank matrix approximation
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems
- Randomized methods for matrix computations
- Geometric component analysis and its applications to data analysis
- Algorithm 844
- Randomized Algorithms for Matrices and Data
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- Randomized generalized singular value decomposition
- Tikhonov regularization and randomized GSVD
- Single-pass randomized algorithms for LU decomposition
- Multidimensional butterfly factorization
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Randomized algorithms for the low multilinear rank approximations of tensors
- Generalized multiscale finite element methods for space-time heterogeneous parabolic equations
- Nested Domain Decomposition with Polarized Traces for the 2D Helmholtz Equation
- On the Compression of Low Rank Matrices
- Effective algorithms for decomplexifying a matrix by unitary similarities or congruences
- Literature survey on low rank approximation of matrices
- Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen-Loève expansion.
- Randomized LU decomposition
- Randomized local model order reduction
- A dynamical polynomial chaos approach for long-time evolution of SPDEs
- Compressing Rank-Structured Matrices via Randomized Sampling
- Sublinear-time quadratic minimization via spectral decomposition of matrices
- Randomized model order reduction
- Randomized QR with column pivoting
- Streaming low-rank matrix approximation with an application to scientific simulation
- Dense fast random projections and Lean Walsh transforms
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- A new fast direct solver for the boundary element method
- randUTV: a blocked randomized algorithm for computing a rank-revealing UTV factorization
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Householder QR factorization with randomization for column pivoting (HQRRP)
- Accelerated matrix completion algorithm using continuation strategy and randomized SVD
- A matrix completion algorithm using randomized SVD
- Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
- Far-field compression for fast kernel summation methods in high dimensions
- Genetic programming and randomized algorithms for estimation of singulars values of large matrices
- A geometric mapping cross approximation method
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Accurate and fast matrix factorization for low-rank learning.
- An L-DEIM induced high order tensor interpolatory decomposition
- A fast direct boundary element method for 3D acoustic problems based on hierarchical matrices
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- A fast solver for the narrow capture and narrow escape problems in the sphere
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Fast structured LU factorization for nonsymmetric matrices
- Broadband recursive skeletonization
- Title not available (Why is that?)
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- A hybrid stochastic interpolation and compression method for kernel matrices
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- Fast Algorithms for Hyperspectral Diffuse Optical Tomography
- Randomized Quasi-Optimal Local Approximation Spaces in Time
- Using randomization to make recursive matrix algorithms practical
- Localized Model Reduction for Nonlinear Elliptic Partial Differential Equations: Localized Training, Partition of Unity, and Adaptive Enrichment
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
Uses Software
This page was built for publication: A randomized algorithm for the decomposition of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617703)
