Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Evaluating the action of a matrix function on a vector, that is , is an ubiquitous task in applications. When is large, one usually relies on Krylov projection methods. In this paper, we provide effective choices for the poles of the rational Krylov method for approximating when is either Cauchy-Stieltjes or Laplace-Stieltjes (or, which is equivalent, completely monotonic) and is a positive definite matrix. Then, we consider the case , and obtained vectorizing a low-rank matrix, which finds application, for instance, in solving fractional diffusion equation on two-dimensional tensor grids. We see how to leverage tensorized Krylov subspaces to exploit the Kronecker structure and we introduce an error analysis for the numerical approximation of . Pole selection strategies with explicit convergence bounds are given also in this case.
Daniel Kressner, Alice Cortinovis