Computation of generalized matrix functions with rational Krylov methods

07/26/2021
by   Angelo Alberto Casulli, et al.
0

We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special case. By exploiting the quasiseparable structure of the projected matrices, we show that the basis vectors can be updated using a short recurrence, which can be seen as a generalization to the rational case of the Golub-Kahan bidiagonalization. We also prove error bounds that relate the error of these methods to uniform rational approximation. The effectiveness of the algorithms and the accuracy of the bounds is illustrated with numerical experiments.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

07/09/2021

Divide and conquer methods for functions of matrices with banded or hierarchical low-rank structure

This work is concerned with approximating matrix functions for banded ma...
09/08/2021

Matrix functions via linear systems built from continued fractions

A widely used approach to compute the action f(A)v of a matrix function ...
06/10/2020

A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices

Given a limited amount of memory and a target accuracy, we propose and c...
05/06/2020

Rational approximation of the absolute value function from measurements: a numerical study of recent methods

In this work, we propose an extensive numerical study on approximating t...
08/06/2019

Rational Krylov for Stieltjes matrix functions: convergence and pole selection

Evaluating the action of a matrix function on a vector, that is x=f( M)v...
11/23/2020

Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system in optical applications

Based on the generalized Cayley transform, a family of conservative one-...
09/22/2020

Multivariate Rational Approximation Using a Stabilized Sanathanan-Koerner Iteration

The Sanathanan-Koerner iteration developed in 1963 is classical approach...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.