期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 30, 期 4, 页码 1639-1657出版社
SIAM PUBLICATIONS
DOI: 10.1137/080716426
关键词
matrix function; Frechet derivative; matrix polynomial; matrix iteration; matrix exponential; condition number estimation; scaling and squaring method; Pade approximation; backward error analysis
资金
- Royal Society-Wolfson Research Merit Award
- Engineering and Physical Science Research Council [EP/D079403]
The matrix exponential is a much-studied matrix function having many applications. The Frechet derivative of the matrix exponential describes the first-order sensitivity of e(A) to perturbations in A and its norm determines a condition number for eA. Among the numerous methods for computing eA the scaling and squaring method is the most widely used. We show that the implementation of the method in [N.J. Higham, The scaling and squaring method for the matrix exponential revisited, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 1179-1193] can be extended to compute both eA and the Frechet derivative at A in the direction E, denoted by L( A, E), at a cost about three times that for computing eA alone. The algorithm is derived from the scaling and squaring method by differentiating the Pade approximants and the squaring recurrence, reusing quantities computed during the evaluation of the Pade approximant, and intertwining the recurrences in the squaring phase. To guide the choice of algorithmic parameters, an extension of the existing backward error analysis for the scaling and squaring method is developed which shows that, modulo rounding errors, the approximations obtained are e(A)+(Delta A) and L(A + Delta A, E +Delta E), with the same Delta A in both cases, and with computable bounds on parallel to Delta A parallel to and parallel to Delta E parallel to. The algorithm for L(A, E) is used to develop an algorithm that computes eA together with an estimate of its condition number. In addition to results specific to the exponential, we develop some results and techniques for arbitrary functions. We show how a matrix iteration for f(A) yields an iteration for the Frechet derivative and show how to efficiently compute the Frechet derivative of a power series. We also show that a matrix polynomial and its Frechet derivative can be evaluated at a cost at most three times that of computing the polynomial itself and give a general framework for evaluating a matrix function and its Frechet derivative via Pade approximation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据