Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7471
 Title: A Note on the Evaluation of Matrix Polynomials Authors: Van Loan, Charles Keywords: computer sciencetechnical report Issue Date: Sep-1978 Publisher: Cornell University Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-353 Abstract: The problem of evaluating a polynomial p(x) in a matrix A arises in many applications, e.g. the Taylor approximation of $e^{A}$. The $O(\sqrt{q}n^{3})$ algorithm of Paterson and Stockmeyer has the drawback that it requires $O(\sqrt{q}n^{2})$ storage, where $q$ is the degree of $p$ and $n$ is the dimension of $A$. An algorithm which greatly reduces this storage requirement without undue loss of speed is presented. URI: http://hdl.handle.net/1813/7471 Appears in Collections: Computer Science Technical Reports

Files in This Item:

File Description SizeFormat