Padé error estimates for the logarithm of a matrix
- 1 September 1989
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 50 (3) , 707-730
- https://doi.org/10.1080/00207178908953392
Abstract
The error of Padé approximations to the logarithm of a matrix and related hypergeometric functions is analysed. By obtaining an exact error expansion with positive coefficients, it is shown that the error in the matrix approximation at X is always less than the scalar approximation error at x, when ∥X∥ < x. A more detailed analysis, involving the interlacing properties of the zeros of the Padé denominator polynomials, shows that for a given order of approximation, the diagonal Padé approximants are the most accurate. Similarly, knowing that the denominator zeros must lie in the interval (1,∞) leads to a simple upper bound on the condition number of the matrix denominator polynomial, which is a crucial indicator of how accurately the matrix Padé approximants can be evaluated numerically. In this respect the Padé approximants to the logarithm are very well conditioned for ∥X∥ < 0·25. This latter condition can be ensured by using the ‘inverse scaling and squaring’ procedure for evaluating the logarithm.Keywords
This publication has 6 references indexed in Scilit:
- Condition Estimates for Matrix FunctionsSIAM Journal on Matrix Analysis and Applications, 1989
- Algorithm for the identification of continuous-time multivariable systems from their discrete-time modelsElectronics Letters, 1984
- Transformation of continuous-time model of a linear multivariable system from its discrete-time modelElectronics Letters, 1984
- Transformation algorithm for identification of continuous-time multivariable systems from discrete dataElectronics Letters, 1981
- PADÉ APPROXIMANTS AND ORTHOGONAL POLYNOMIALSPublished by Elsevier ,1977
- Orthogonal PolynomialsPublished by American Mathematical Society (AMS) ,1939