2010.18: Computing Matrix Functions

2010.18: Nicholas J. Higham and Awad H. Al-Mohy (2010) Computing Matrix Functions. Acta Numerica, 19. 159 -208. ISSN 0962-4929

This is the latest version of this eprint.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 485 Kb

DOI: 10.1017/S0962492910000036

Abstract

The need to evaluate a function $f(A)\in\mathbb{C}^{n \times n}$ of a matrix $A\in\mathbb{C}^{n \times n}$ arises in a wide and growing number of applications, ranging from the numerical solution of differential equations to measures of the complexity of networks. We give a survey of numerical methods for evaluating matrix functions, along with a brief treatment of the underlying theory and a description of two recent applications. The survey is organized by classes of methods, which are broadly those based on similarity transformations, those employing approximation by polynomial or rational functions, and matrix iterations. Computation of the Fr\'echet derivative, which is important for condition number estimation, is also treated, along with the problem of computing $f(A)b$ without computing $f(A)$. A summary of available software completes the survey.

Available Versions of this Item

• Computing Matrix Functions (deposited 18 May 2010) [Currently Displayed]
  • Computing Matrix Functions (deposited 17 February 2010)

Download Statistics: last 4 weeks
Repository Staff Only: edit this item