Randomized algorithms for the low-rank approximation of matrices
From MaRDI portal
Recommendations
Cites work
- 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
Cited in
(only showing first 100 items - show all)- Randomized algorithms for distributed computation of principal component analysis and singular value decomposition
- Multidomain, sparse, spectral-tau method for helically symmetric flow
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
- Theory and implementation of \(\mathcal{H}\)-matrix based iterative and direct solvers for Helmholtz and elastodynamic oscillatory kernels
- A cubic scaling algorithm for excited states calculations in particle-particle random phase approximation
- Random perturbation of low rank matrices: improving classical bounds
- Randomized LU decomposition
- A new fast direct solver for the boundary element method
- A fast direct solver for boundary value problems on locally perturbed geometries
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- On computing distributions of products of non-negative independent random variables
- Post-buckling behaviour of a growing elastic rod
- New tests of uniformity on the compact classical groups as diagnostics for weak-\(^{*}\) mixing of Markov chains
- Multidimensional butterfly factorization
- Approximation error in regularized SVD-based Fourier continuations
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Randomization and the parallel solution of linear algebra problems
- A randomized exponential canonical correlation analysis method for data analysis and dimensionality reduction
- Randomized model order reduction
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Low-rank approximations for computing observation impact in 4D-Var data assimilation
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory
- Single-pass randomized QLP decomposition for low-rank approximation
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- A fast direct singular boundary method for three-dimensional potential problems
- Randomized QLP decomposition
- Enhanced image approximation using shifted rank-1 reconstruction
- Adaptive dimension reduction to accelerate infinite-dimensional geometric Markov chain Monte Carlo
- Block-adaptive cross approximation of discrete integral operators
- On spectral and numerical properties of random butterfly matrices
- A cross-product approach for low-rank approximations of large matrices
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Simulation of two-dimensional steady-state heat conduction problems by a fast singular boundary method
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Efficient algorithms for CUR and interpolative matrix decompositions
- Compression of the electron repulsion integral tensor in tensor hypercontraction format with cubic scaling cost
- Effective matrix-free preconditioning for the augmented immersed interface method
- Dimension-independent likelihood-informed MCMC
- Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction
- Randomized matrix-free trace and log-determinant estimators
- Cluster-based generalized multiscale finite element method for elliptic PDEs with random coefficients
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Fast structured LU factorization for nonsymmetric matrices
- A way for low ranking matrices and its stochastic computations using Monte Carlo method
- An \(O(N)\) direct solver for integral equations on the plane
- The matrix ridge approximation: algorithms and applications
- Stochastic boundary methods of fundamental solutions for solving PDEs
- Randomized generalized singular value decomposition
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Random Projections for Low Multilinear Rank Tensors
- Fast, adaptive, high-order accurate discretization of the Lippmann-Schwinger equation in two dimensions
- On low rank approximation of linear operators in p-norms and some algorithms
- Frequent directions: simple and deterministic matrix sketching
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- A fast randomized algorithm for overdetermined linear least-squares regression
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- A unified framework for linear dimensionality reduction in L1
- Randomized Algorithms for Matrices and Data
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- Randomized local model order reduction
- Genetic programming and randomized algorithms for estimation of singulars values of large matrices
- Scalable Gaussian Process Computations Using Hierarchical Matrices
- Fast Algorithms for Hyperspectral Diffuse Optical Tomography
- A technique for updating hierarchical skeletonization-based factorizations of integral operators
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- Matrix probing: a randomized preconditioner for the wave-equation Hessian
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- A simple filter for detecting low-rank submatrices
- A fast direct solver for elliptic problems on general meshes in 2D
- Detecting low-rank clusters via random sampling
- FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation
- Function approximation on arbitrary domains using Fourier extension frames
- Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
- An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problems
- Computing low-rank approximations of large-scale matrices with the tensor network randomized SVD
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- Literature survey on low rank approximation of matrices
- scientific article; zbMATH DE number 7008333 (Why is no real title available?)
- A bootstrap method for error estimation in randomized matrix multiplication
- scientific article; zbMATH DE number 6860845 (Why is no real title available?)
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- On the numerical rank of radial basis function kernels in high dimensions
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems
- Data-driven resolvent analysis
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation
- Subspaces analysis for random projection UTV framework
- Interpolative Decomposition Butterfly Factorization
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Randomized methods for matrix computations
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- Random sampling and efficient algorithms for multiscale PDEs
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
This page was built for publication: Randomized algorithms for the low-rank approximation of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010073)
