Optimal near-optimality bounds for the Lanczos method for matrix functions (Q7284682)

We provide a new analysis of Lanczos approximation to matrix functions and show that for Stieltjes matrix functions, the error bound improves over previously known bounds by up to a factor of two. The result holds under mild assumptions on the function and has implications for linear algebra problems such as quadratic forms and matrix sign function computations.