.png){kind=icon}
Return
Computing matrix functions
.png){kind=icon}
PRE
AI
DOI：10.1017/s0962492910000036.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The need to evaluate a function f(A) ∈ ℂn×n of a matrix A ∈ ℂn×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échet 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.
Journal
IF:
11.3
Papers:
122
Citations:
3.7K
Organization
Cited Papers
No cited papers available