Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
From MaRDI portal
Cites work
- A Krylov--Schur algorithm for large eigenproblems
- A Remark on Stirling's Formula
- Algorithm-agnostic low-rank approximation of operator monotone matrix functions
- An algorithm for the principal component analysis of large data sets
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
- Block Krylov subspace methods for functions of matrices
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Computational Variants of the Lanczos Method for the Eigenproblem
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Estimates for Some Computational Techniques in Linear Algebra
- Exponential Integrators for Large Systems of Differential Equations
- Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Functions of Matrices
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 852530 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Hutch++: Optimal Stochastic Trace Estimation
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Krylov-Aware Stochastic Trace Estimation
- Matrices, moments and quadrature with applications
- Monotonicity, bounds and acceleration of block Gauss and Gauss-Radau quadrature for computing B^T (A)B
- Network properties revealed through matrix functions
- Numerical methods for large eigenvalue problems
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- On randomized trace estimates for indefinite matrices with an application to determinants
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the unreasonable effectiveness of single vector Krylov methods for low-rank approximation
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Rational Krylov sequence methods for eigenvalue computation
- Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Subspace Iteration Randomization and Singular Value Problems
- The block conjugate gradient algorithm and related methods
- The scaling and squaring method for the matrix exponential revisited
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
This page was built for publication: Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236612)
