Pages that link to "Item:Q5254699"
From MaRDI portal
The following pages link to Subspace Iteration Randomization and Singular Value Problems (Q5254699):
Displaying 47 items.
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- Accuracy of singular vectors obtained by projection-based SVD methods (Q1689319) (← links)
- A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction (Q1995941) (← links)
- Randomized block Krylov subspace methods for trace and log-determinant estimators (Q2045172) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems (Q2129320) (← links)
- Randomized quaternion QLP decomposition for low-rank approximation (Q2162234) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- Randomized QLP decomposition (Q2176120) (← links)
- A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? (Q2220600) (← links)
- Single-pass randomized algorithms for LU decomposition (Q2306297) (← links)
- Randomized core reduction for discrete ill-posed problem (Q2309262) (← links)
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
- ALORA: affine low-rank approximations (Q2312001) (← links)
- Randomized matrix-free trace and log-determinant estimators (Q2408935) (← links)
- Estimating the Largest Elements of a Matrix (Q2830567) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems (Q4556022) (← links)
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization (Q4569361) (← links)
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices (Q4588944) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
- Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms (Q4615298) (← links)
- (Q4637072) (← links)
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
- Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification (Q5038410) (← links)
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation (Q5094223) (← links)
- Subspaces Analysis for Random Projection UTV Framework (Q5099408) (← links)
- Singular Values of Dual Quaternion Matrices and Their Low-Rank Approximations (Q5099773) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction (Q5112642) (← links)
- Regularized Linear Inversion with Randomized Singular Value Decomposition (Q5117954) (← links)
- Analytical Low-Rank Compression via Proxy Point Selection (Q5146610) (← links)
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
- Randomized Dynamic Mode Decomposition (Q5207530) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- Accurate Low-Rank Approximations Via a Few Iterations of Alternating Least Squares (Q5270414) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation (Q6039249) (← links)
- A literature survey of matrix methods for data science (Q6068265) (← links)
- An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation (Q6101124) (← links)
- Pass-efficient truncated UTV for low-rank approximations (Q6125416) (← links)
- Admissible subspaces and the subspace iteration method (Q6149879) (← links)