Efficient Inversion of Matrix ϕ-Functions of Low Order

The paper is concerned with efficient numerical methods for solving a linear system & phi;(A)x = b, where & phi;(z) is a & phi;-function and A E RNxN. In particular in this work we are interested in the computation of & phi;(A)-1b for the case where & phi;(z) = & phi;1(z) = ez -1 z ez - 1 - z & phi;(z) = & phi;2(z) = z2 . Under suitable conditions on the spectrum of A we design fast algorithms for computing both & phi;⠃(A)-1 and & phi;⠃(A)-1b based on Newton's iteration and Krylov-type methods, respectively. Adaptations of these schemes for structured matrices are considered. In particular the cases of banded and more generally quasiseparable matrices are investigated. Numerical results are presented to show the effectiveness of our proposed algorithms