Summary
LetM n denote the space ofn×n matrices. GivenX, Z∈M n define
and given a norm ‖·‖ onM n define
The quantity ‖L(X,·)‖ is important in the study of the sensitivity of the matrix exponential. Given an integration ruleR and a positive integerm letL R.m (X, Z) denote the approximation toL(X, Z) given by the composite ruleR applied withm subintervals. We give bounds on ‖L(X,·)−L R.m (X,·)‖ that are valid for any unitarily invariant norm ‖·‖ and any integration ruleR.
We show that in a particular situation, that arises in practice, the composite Simpson's rule has a better error bound than the composite trapezoidal rule, and that it can be evaluated with the same number of matrix multiplications.
We also note a symmetry property of the functionL(X,·) and compare the performance of the power method and two variants of the Lanczos algorithm for estimating ‖L(X,·)‖.
Similar content being viewed by others
References
Bellman, R. (1960): Introduction to Matrix Analysis. McGraw-Hill, New York
Bunse-Gerstner, A., Gragg, W.B. (1988): Singular value decomposition of complex symmetric matrices. J. Comput. Appl. Math.21, 41–54
Conte, S.D., de Boor, C. (1980): Elementary Numerical Analysis. McGraw-Hill, New York
Golub, G., Van Loan, C. (1989): Matrix Computations, 2nd ed. The Johns Hopkins University Press, Baltimore
Kenny, C., Laub, A.J. (1989): Condition estimates for matrix functions. SIAM J. Matrix Anal. Appl.10, 191–209
Mathias, R. (1992): Approximation of matrix valued functions. SIAM J. Matrix Anal. Appl. (to appear)
Mathias, R. (1992): A symmetry property of the Frechet derivative. Preprint
Parlett, B.N. (1980): The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ
Parlett, B.N., Simon, H., Springer, L.M. (1982): On estimating the largest eigenvalue with the Lanczos algorithm. Math. Comput.38, 153–165
Author information
Authors and Affiliations
Additional information
Research supported by a Summer Research Grant from the College of William and Mary