Evaluating Matrix Functions by Resummations on Graphs: the Method of Path-Sums
Abstract
We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor series. If the matrix is finite, our approach yields the exact result in a finite number of steps. We achieve this by combining a mapping between matrix powers and walks on a weighted directed graph with a universal graph-theoretic result on the structure of such walks. We present path-sum expressions for a matrix raised to a complex power, the matrix exponential, matrix inverse, and matrix logarithm. We show that the quasideterminants of a matrix can be naturally formulated in terms of a path-sum, and present examples of the application of the path-sum method. We show that obtaining the inversion height of a matrix inverse and of quasideterminants is an NP-complete problem.
Cite
@article{arxiv.1112.1588,
title = {Evaluating Matrix Functions by Resummations on Graphs: the Method of Path-Sums},
author = {P. -L. Giscard and S. J. Thwaite and D. Jaksch},
journal= {arXiv preprint arXiv:1112.1588},
year = {2013}
}
Comments
23 pages, light version submitted to SIAM Journal on Matrix Analysis and Applications (SIMAX). A separate paper with the graph theoretic results is available at: arXiv:1202.5523v1. Results for matrices over division rings will be published separately as well