DeepAI AI Chat
Log In Sign Up

A posteriori error bounds for the block-Lanczos method for matrix function approximation

11/28/2022
by   Qichen Xu, et al.
NYU college
University of Washington
0

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. Further experiments work towards a better understanding of how certain hyperparameters should be chosen in order to maximize the quality of the error bounds.

READ FULL TEXT

page 9

page 10

06/17/2021

Error bounds for Lanczos-based matrix function approximation

We analyze the Lanczos method for matrix function approximation (Lanczos...
07/21/2021

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case, the a posteriori bound showi...
05/13/2021

Analysis of stochastic Lanczos quadrature for spectrum approximation

The cumulative empirical spectral measure (CESM) Φ[𝐀] : ℝ→ [0,1] of a n×...
01/11/2023

Analyzing Inexact Hypergradients for Bilevel Learning

Estimating hyperparameters has been a long-standing problem in machine l...
07/17/2018

Roos' Matrix Permanent Approximation Bounds for Data Association Probabilities

Matrix permanent plays a key role in data association probability calcul...
02/29/2020

Randomized block Krylov space methods for trace and log-determinant estimators

We present randomized algorithms based on block Krylov space method for ...