Subspace Iteration Randomization and Singular Value Problems
From MaRDI portal
Publication:5254699
DOI10.1137/130938700zbMath1328.65088arXiv1408.2208OpenAlexW1925032196MaRDI QIDQ5254699
Publication date: 10 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2208
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (47)
Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems ⋮ Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems ⋮ Randomized quaternion QLP decomposition for low-rank approximation ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization ⋮ Randomized QLP decomposition ⋮ Randomized matrix-free trace and log-determinant estimators ⋮ A simple spectral algorithm for recovering planted partitions ⋮ Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation ⋮ Subspaces Analysis for Random Projection UTV Framework ⋮ Singular Values of Dual Quaternion Matrices and Their Low-Rank Approximations ⋮ A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices ⋮ Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation ⋮ A literature survey of matrix methods for data science ⋮ Accuracy of singular vectors obtained by projection-based SVD methods ⋮ An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation ⋮ Pass-efficient truncated UTV for low-rank approximations ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Admissible subspaces and the subspace iteration method ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction ⋮ Literature survey on low rank approximation of matrices ⋮ Regularized Linear Inversion with Randomized Singular Value Decomposition ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms ⋮ A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Randomized Dynamic Mode Decomposition ⋮ Randomized block Krylov subspace methods for trace and log-determinant estimators ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Single-pass randomized algorithms for LU decomposition ⋮ Randomized core reduction for discrete ill-posed problem ⋮ Exact recovery in the hypergraph stochastic block model: a spectral algorithm ⋮ ALORA: affine low-rank approximations ⋮ Estimating the Largest Elements of a Matrix ⋮ Randomized block Krylov methods for approximating extreme eigenvalues ⋮ Low-Rank Matrix Approximations Do Not Need a Singular Value Gap ⋮ Unnamed Item ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition ⋮ Single-pass randomized QLP decomposition for low-rank approximation ⋮ Accurate Low-Rank Approximations Via a Few Iterations of Alternating Least Squares ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- A fast direct solver for elliptic problems on general meshes in 2D
- Rang revealing QR factorizations
- Estimating the matrix \(p\)-norm
- A fast randomized algorithm for the approximation of matrices
- Preconditioned conjugate gradient methods. Proceedings of a conference held in Nijmegen, The Netherlands, June 19-21, 1989
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Low-rank revealing \(UTV\) decompositions
- On the existence and computation of rank-revealing LU factorizations
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Principal component analysis.
- Strong rank revealing LU factorizations
- The variation of the spectrum of a normal matrix
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Regularization with randomized SVD for large-scale discrete inverse problems
- The university of Florida sparse matrix collection
- Numerical Methods for Large Eigenvalue Problems
- Randomized algorithms for the low-rank approximation of matrices
- A fast randomized algorithm for overdetermined linear least-squares regression
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Randomized Algorithms for Matrices and Data
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Condition Estimates
- Dense Fast Random Projections and Lean Walsh Transforms
- A Randomized Algorithm for Principal Component Analysis
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Applications of statistical condition estimation to the solution of linear systems
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
- Relative-Error $CUR$ Matrix Decompositions
- A Survey of Condition Number Estimation for Triangular Matrices
- The Evolution of the Minimum Degree Ordering Algorithm
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Some Applications of the Rank Revealing QR Factorization
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- On Rank-Revealing Factorisations
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- Singular Value Decomposition, Eigenfaces, and 3D Reconstructions
- Experience with a Matrix Norm Estimator
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- Using Linear Algebra for Intelligent Information Retrieval
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
- A fast and efficient algorithm for low-rank approximation of a matrix
- Updating a Rank-Revealing ULV Decomposition
- On the Compression of Low Rank Matrices
- Fast monte-carlo algorithms for finding low-rank approximations
- Condition Numbers of Gaussian Random Matrices
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Methods of conjugate gradients for solving linear systems
- On the complexity of computing error bounds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subspace Iteration Randomization and Singular Value Problems
