A fast randomized algorithm for the approximation of matrices
From MaRDI portal
(Redirected from Publication:952399)
Recommendations
- A randomized algorithm for the decomposition of matrices
- Fast low rank approximations of matrices and tensors
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast monte-carlo algorithms for finding low-rank approximations
- Randomized algorithms for the low-rank approximation of matrices
Cites work
- scientific article; zbMATH DE number 5764801 (Why is no real title available?)
- scientific article; zbMATH DE number 274379 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A fast algorithm for the inversion of general Toeplitz matrices
- A fast randomized algorithm for the approximation of matrices
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Checking approximate computations over the reals
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient computation of the DFT with only a subset of input or output points
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Incomplete cross approximation in the mosaic-skeleton method
- On interpolation and integration in finite-dimensional spaces of bounded functions
- On the Compression of Low Rank Matrices
- Row Reduction of a Matrix and A = CaB
- Some Applications of the Rank Revealing QR Factorization
- The maximal-volume concept in approximation by low-rank matrices
Cited in
(only showing first 100 items - show all)- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Fast algorithm for the multiplication of a row vector by a randomly selected matrixA
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Randomized sketching algorithms for low-memory dynamic optimization
- A fast block low-rank dense solver with applications to finite-element matrices
- Literature survey on low rank approximation of matrices
- Randomized LU decomposition
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
- A model reduction method for multiscale elliptic PDEs with random coefficients using an optimization approach
- Randomized local model order reduction
- Random sampling and efficient algorithms for multiscale PDEs
- Principled interpolation of Green's functions learned from data
- Randomized model order reduction
- Krylov subspace recycling with randomized sketching for matrix functions
- Using randomization to make recursive matrix algorithms practical
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- An adaptive fast direct solver for boundary integral equations in two dimensions
- Randomized QR with column pivoting
- The stability of the first Neumann Laplacian eigenfunction under domain deformations and applications
- Interpolative Decomposition Butterfly Factorization
- Sketched approximation of regularized canonical correlation analysis
- Streaming low-rank matrix approximation with an application to scientific simulation
- RidgeSketch: a fast sketching based solver for large scale ridge regression
- Fast monte-carlo algorithms for finding low-rank approximations
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Butterfly factorization
- A new fast direct solver for the boundary element method
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Stochastic iterative projection methods for large linear systems
- A randomized algorithm for principal component analysis
- Randomized algorithms in numerical linear algebra
- Sampling from large matrices
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Randomized estimation of spectral densities of large matrices made accurate
- randUTV: a blocked randomized algorithm for computing a rank-revealing UTV factorization
- On low rank approximation of linear operators in \(p\)-norms and some algorithms
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Adaptively compressed polarizability operator for accelerating large scale ab initio phonon calculations
- Cluster-based generalized multiscale finite element method for elliptic PDEs with random coefficients
- Fast dimension reduction using Rademacher series on dual BCH codes
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- An efficient algorithm for computing the approximate t-URV and its applications
- Fast approximation of matrix coherence and statistical leverage
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Randomized algorithms for the low-rank approximation of matrices
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- scientific article; zbMATH DE number 1953870 (Why is no real title available?)
- Randomized QLP decomposition
- Randomized block Krylov methods for approximating extreme eigenvalues
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Matrix probing: a randomized preconditioner for the wave-equation Hessian
- Matrix decompositions using sub-Gaussian random matrices
- SVD-based algorithms for fully-connected tensor network decomposition
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Far-field compression for fast kernel summation methods in high dimensions
- Randomized core reduction for discrete ill-posed problem
- An ACA-SBM for some 2D steady-state heat conduction problems
- Compression of the electron repulsion integral tensor in tensor hypercontraction format with cubic scaling cost
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Stochastic boundary methods of fundamental solutions for solving PDEs
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- A randomized algorithm for the decomposition of matrices
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- scientific article; zbMATH DE number 2232794 (Why is no real title available?)
- A simple filter for detecting low-rank submatrices
- Detecting low-rank clusters via random sampling
- Efficient methods for grouping vectors into low-rank clusters
- A bootstrap method for error estimation in randomized matrix multiplication
- Randomized numerical linear algebra: Foundations and algorithms
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Randomized LU decomposition using sparse projections
- A fast randomized algorithm for the approximation of matrices
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Randomized complete pivoting for solving symmetric indefinite linear systems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
- Fast randomized numerical rank estimation for numerically low-rank matrices
- A fast randomized algorithm for orthogonal projection
- A robust randomized indicator method for accurate symmetric eigenvalue detection
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- A sketch-and-select Arnoldi process
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Approximation error in regularized SVD-based Fourier continuations
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Efficient algorithms for CUR and interpolative matrix decompositions
- A fast randomized algorithm for computing an approximate null space
- Simulation of two-dimensional steady-state heat conduction problems by a fast singular boundary method
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Randomized interpolative decomposition of separated representations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
This page was built for publication: A fast randomized algorithm for the approximation of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952399)
