A posteriori error bounds for the block-Lanczos method for matrix function approximation
arXiv:2211.15643 · doi:10.1007/s11075-024-01819-7
Abstract
We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (2022)] for the Lanczos method for matrix function approximation to the block algorithm. Numerical experiments suggest that our bounds are fairly robust to changing block size and have the potential for use as a practical stopping criteria. Further experiments work towards a better understanding of how certain hyperparameters should be chosen in order to maximize the quality of the error bounds, even in the previously studied block-size one case.
References in corpus (7)
- Numerical Methods for the QCD Overlap Operator: I. Sign-Function and Error Bounds
- Accuracy of the finite-temperature Lanczos method compared to simple typicality-based estimates
- Thermodynamic properties of an ring-exchange model on the triangular lattice
- Krylov-aware stochastic trace estimation
- 2-norm error bounds and estimates for Lanczos approximations to linear systems and rational matrix functions
- Error bounds for Lanczos-based matrix function approximation
- Numerical computation of the equilibrium-reduced density matrix for strongly coupled open quantum systems