Computing the Wave-Kernel Matrix Functions
The wave-kernel functions and
arise in the solution of second order differential equations such as
with initial conditions at
. Here,
is an arbitrary square matrix and
. The square root in these formulas is illusory, as both functions can be expressed as power series in
, so there are no questions about existence of the functions.
How can these functions be computed efficiently? In Computing the Wave-Kernel Matrix Functions (SIAM J. Sci. Comput., 2018) Prashanth Nadukandi and I develop an algorithm based on Padé approximation and the use of double angle formulas. The amount of scaling and the degree of the Padé approximant are chosen to minimize the computational cost subject to achieving backward stability for in exact arithmetic.
In the derivation we show that the backward error of any approximation to can be explicitly expressed in terms of a hypergeometric function. To bound the backward error we derive and exploit a new bound for
in terms of the norms of lower powers of
; this bound is sharper than one previously obtained by Al-Mohy and Higham.
Numerical experiments show that the algorithm behaves in a forward stable manner in floating-point arithmetic and is superior in this respect to the general purpose Schur–Parlett algorithm applied to these functions.

The fundamental regions of the
function cosh(sqrt(z)), needed for the backward error analysis
underlying the algorithm.