Algorithm-agnostic low-rank approximation of operator monotone matrix functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Frequent directions: simple and deterministic matrix sketching
- Functions of Matrices
- Hutch++: Optimal Stochastic Trace Estimation
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Krylov methods are (nearly) optimal for low-rank approximation
- Krylov-Aware Stochastic Trace Estimation
- Low rank approximation and regression in input sparsity time
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Low-rank approximation with 1/𝜖 1/3 matrix-vector products
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- On randomized trace estimates for indefinite matrices with an application to determinants
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation
- Randomization and reweighted _1-minimization for A-optimal design of linear inverse problems
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- Randomized algorithms for the low-rank approximation of matrices
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized matrix-free trace and log-determinant estimators
- Randomized numerical linear algebra: Foundations and algorithms
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Relative-Error CUR Matrix Decompositions
- Revisiting the Nyström method for improved large-scale machine learning
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Sketching as a tool for numerical linear algebra
- Some divided difference inequalities for n-convex functions
- Subspace Iteration Randomization and Singular Value Problems
- \(c_ p\)
Cited in
(1)
This page was built for publication: Algorithm-agnostic low-rank approximation of operator monotone matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7035750)
