A Block Krylov Method to Compute the Action of the Fréchet Derivative of a Matrix Function on a Vector with Applications to Condition Number Estimation
Author(s) -
Peter Kandolf,
Samuel D. Relton
Publication year - 2017
Publication title -
siam journal on scientific computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.674
H-Index - 147
eISSN - 1095-7197
pISSN - 1064-8275
DOI - 10.1137/16m1077969
Subject(s) - mathematics , block (permutation group theory) , action (physics) , matrix function , derivative (finance) , matrix (chemical analysis) , krylov subspace , function (biology) , algorithm , fréchet derivative , vector valued function , mathematical analysis , mathematical optimization , iterative method , symmetric matrix , geometry , eigenvalues and eigenvectors , banach space , physics , materials science , quantum mechanics , composite material , evolutionary biology , financial economics , economics , biology
We design a block Krylov method to compute the action of the Fréchet derivative of a matrix function on a vector using only matrix-vector products, i.e., the derivative of $f(A)b$ when $A$ is subject to a perturbation in the direction $E$. The algorithm we derive is especially effective when the direction matrix $E$ in the derivative is of low rank, while there are no such restrictions on $A$. Our results and experiments are focused mainly on Fréchet derivatives with rank 1 direction matrices. Our analysis applies to all functions with a power series expansion convergent on a subdomain of the complex plane which, in particular, includes the matrix exponential. We perform an a priori error analysis of our algorithm to obtain rigorous stopping criteria. Furthermore, we show how our algorithm can be used to estimate the 2-norm condition number of $f(A)b$ efficiently. Our numerical experiments show that our new algorithm for computing the action of a Fréchet derivative typically requires a small number of iterations to converge and (particularly for single and half precision accuracy) is significantly faster than alternative algorithms. When applied to condition number estimation, our experiments show that the resulting algorithm can detect ill-conditioned problems that are undetected by competing algorithms
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom