Efficient mixed rational and polynomial approximation of matrix functions

Abstract This paper presents an efficient method for computing approximations for general matrix functions based on mixed rational and polynomial approximations. A method to obtain this kind of approximation from rational approximations is given, reaching the highest efficiency when transforming nondiagonal rational approximations with a higher numerator degree than the denominator degree. Then, the proposed mixed rational and polynomial approximation can be successfully applied for matrix functions which have any type of rational approximation, such as Pade, Chebyshev, etc., with maximum efficiency for higher numerator degrees than the denominator degrees. The efficiency of the mixed rational and polynomial approximation is compared with the best existing evaluating schemes for general polynomial and rational approximations, providing greater theoretical accuracy with the same cost in terms of matrix multiplications. It is well known that diagonal rational approximants are generally more accurate than the corresponding nondiagonal rational approximants which have the same computational cost. Using the proposed mixed approximation we show that the above statement is no longer true, and nondiagonal rational approximants are in fact generally more accurate than the corresponding diagonal rational approximants with the same cost.

[1]  N. Higham.  The Scaling and Squaring Method for the Matrix Exponential Revisited , 2005, SIAM J. Matrix Anal. Appl..

[2]  C. Loan,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix , 1978 .

[3]  Emilio Defez,et al.  Some applications of the Hermite matrix polynomials series expansions , 1998 .

[4]  N. Higham.  Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics) , 2008 .

[5]  Emilio Defez,et al.  Computing matrix functions solving coupled differential models , 2009, Math. Comput. Model..

[6]  Larry J. Stockmeyer,et al.  On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials , 1973, SIAM J. Comput..

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  D. Calvetti,et al.  Incomplete partial fractions for parallel evaluation of rational matrix functions , 1995 .

[9]  Nicholas J. Higham,et al.  Functions of matrices - theory and computation , 2008 .

[10]  Emilio Defez,et al.  Accurate matrix exponential computation to solve coupled differential models in engineering , 2011, Math. Comput. Model..

[11]  Lothar Reichel,et al.  On the Evaluation of Polynomial Coefficients , 2003, Numerical Algorithms.

[12]  Emilio Defez,et al.  Efficient orthogonal matrix polynomial based method for computing matrix exponential , 2011, Appl. Math. Comput..

[13]  Awad H. Al-Mohy,et al.  A New Scaling and Squaring Algorithm for the Matrix Exponential , 2009, SIAM J. Matrix Anal. Appl..

[14]  Cleve B. Moler,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later , 1978, SIAM Rev..