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)- A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement
- Broadband recursive skeletonization
- A robust randomized indicator method for accurate symmetric eigenvalue detection
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- SVD-based algorithms for tensor wheel decomposition
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- scientific article; zbMATH DE number 2232794 (Why is no real title available?)
- Deterministic APSP, Orthogonal Vectors, and More
- Interpolative Decomposition Butterfly Factorization
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- Effective matrix-free preconditioning for the augmented immersed interface method
- Low-rank Tucker approximation of a tensor from streaming data
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Cluster-based generalized multiscale finite element method for elliptic PDEs with random coefficients
- Split representation of adaptively compressed polarizability operator
- The stability of the first Neumann Laplacian eigenfunction under domain deformations and applications
- On low rank approximation of linear operators in \(p\)-norms and some algorithms
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Randomized QLP decomposition
- An efficient algorithm for computing the approximate t-URV and its applications
- An accelerated, high-order accurate direct solver for the Lippmann-Schwinger equation for acoustic scattering in the plane
- Far-field compression for fast kernel summation methods in high dimensions
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices
- Principled interpolation of Green's functions learned from data
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Matrix decompositions using sub-Gaussian random matrices
- Simulation of two-dimensional steady-state heat conduction problems by a fast singular boundary method
- Randomized algorithms for the low multilinear rank approximations of tensors
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Randomized core reduction for discrete ill-posed problem
- Fast algorithm for the multiplication of a row vector by a randomly selected matrixA
- SVD-based algorithms for fully-connected tensor network decomposition
- Using randomization to make recursive matrix algorithms practical
- A fast block low-rank dense solver with applications to finite-element matrices
- Randomized QR with column pivoting
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- Efficient Identification of Butterfly Sparse Matrix Factorizations
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Randomized sketching algorithms for low-memory dynamic optimization
- Randomized local model order reduction
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- A randomized method for one-step extrapolation in reverse time migration
- Fast randomized numerical rank estimation for numerically low-rank matrices
- A fast randomized algorithm for computing an approximate null space
- A sketch-and-select Arnoldi process
- Randomized LU decomposition using sparse projections
- Practical sketching algorithms for low-rank matrix approximation
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Krylov subspace recycling with randomized sketching for matrix functions
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- A fast direct solver for the integral equations of scattering theory on planar curves with corners
- Fast algorithms for Brownian matrices
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Stochastic iterative projection methods for large linear systems
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
- Butterfly factorization
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Fast O(n) complexity algorithms for diagonal innovation matrices
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- A fast randomized algorithm for the approximation of matrices
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Improved analysis of the subsampled randomized Hadamard transform
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Sketched approximation of regularized canonical correlation analysis
- A model reduction method for multiscale elliptic PDEs with random coefficients using an optimization approach
- Randomized LU decomposition
- Approximation error in regularized SVD-based Fourier continuations
- A simple filter for detecting low-rank submatrices
- Tikhonov regularization and randomized GSVD
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Efficient methods for grouping vectors into low-rank clusters
- Matrix probing: a randomized preconditioner for the wave-equation Hessian
- Detecting low-rank clusters via random sampling
- Randomized algorithms for the low-rank approximation of matrices
- An adaptive fast direct solver for boundary integral equations in two dimensions
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Randomized algorithms in numerical linear algebra
- Adaptively compressed polarizability operator for accelerating large scale ab initio phonon calculations
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- scientific article; zbMATH DE number 741152 (Why is no real title available?)
- Efficient algorithms for CUR and interpolative matrix decompositions
- Multidimensional butterfly factorization
- Subspace Iteration Randomization and Singular Value Problems
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Random sampling and efficient algorithms for multiscale PDEs
- A Fast Random Sampling Algorithm for Sparsifying Matrices
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)
