Fasi, Massimiliano (2018) Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions. [MIMS Preprint]
Text
fasi18.pdf Download (390kB) |
Abstract
Many state-of-the-art algorithms reduce the computation of transcendental matrix functions to the evaluation of polynomial or rational approximants at a matrix argument. This task can be accomplished efficiently by recurring to the Paterson-Stockmeyer method, an evaluation scheme originally developed for matrix polynomials that extends quite naturally to rational functions. An important feature of these techniques is that the number of matrix multiplications required to evaluate an approximant of order n grows slower than n itself, with the result that different approximants yield the same asymptotic computational cost. We analyze the number of matrix multiplications required by the Paterson-Stockmeyer method and by two widely used generalizations, one for evaluating diagonal Padé approximants of generic functions and one specifically tailored to those of the exponential. In all three cases, we identify the approximants of maximum order for any given computational cost.
Item Type: | MIMS Preprint |
---|---|
Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 13 Commutative rings and algebras MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis |
Depositing User: | Mr Massimiliano Fasi |
Date Deposited: | 14 Dec 2018 08:26 |
Last Modified: | 14 Dec 2018 08:26 |
URI: | https://eprints.maths.manchester.ac.uk/id/eprint/2676 |
Available Versions of this Item
- Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions. (deposited 14 Dec 2018 08:26) [Currently Displayed]
Actions (login required)
View Item |