Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
From MaRDI portal
Publication:5740197
DOI10.1007/978-3-319-34171-2_25zbMath1477.65070arXiv1510.06142OpenAlexW2229591571MaRDI QIDQ5740197
No author found.
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.06142
fast multipole methodrandom samplingderandomizationconjugate gradient algorithmslow-rank approximation of a matrix
Related Items (2)
Numerically safe Gaussian elimination with no pivoting ⋮ Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- A fast algorithm for the inversion of general Toeplitz matrices
- Determinantal rings
- Pseudo-skeleton approximations by matrices of maximal volume
- A theory of pseudoskeleton approximations
- Construction and arithmetics of \(\mathcal H\)-matrices
- Incomplete cross approximation in the mosaic-skeleton method
- Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- The Probability That a Numerical Analysis Problem is Difficult
- Eigenvalues and Condition Numbers of Random Matrices
- Accuracy and Stability of Numerical Algorithms
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- Randomized Sparse Direct Solvers
- Fast monte-carlo algorithms for finding low-rank approximations
- Tails of Condition Number Distributions
- Condition Numbers of Gaussian Random Matrices
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
- A bibliography on semiseparable matrices
- A fast algorithm for particle simulations
This page was built for publication: Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions
