Pages that link to "Item:Q952399"
From MaRDI portal
The following pages link to A fast randomized algorithm for the approximation of matrices (Q952399):
Displayed 17 items.
- Matrix probing: a randomized preconditioner for the wave-equation Hessian (Q412395) (← links)
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
- A simple filter for detecting low-rank submatrices (Q419636) (← links)
- A fast direct solver for the integral equations of scattering theory on planar curves with corners (Q423010) (← links)
- Detecting low-rank clusters via random sampling (Q425614) (← links)
- Fast construction of hierarchical matrix representation from matrix-vector multiplication (Q544585) (← links)
- Efficient methods for grouping vectors into low-rank clusters (Q550984) (← links)
- An adaptive fast direct solver for boundary integral equations in two dimensions (Q643637) (← links)
- A fast randomized algorithm for the approximation of matrices (Q952399) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Approximation error in regularized SVD-based Fourier continuations (Q1760113) (← links)
- Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation (Q2441120) (← links)
- Stochastic iterative projection methods for large linear systems (Q3068189) (← links)
- Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme (Q3075261) (← links)
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM (Q3101550) (← links)
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439) (← links)