矩阵Padé逼近的一种算法

An algorithm of matrix Padé approximants

原有的广义逆矩阵Padé逼近(GMPA),由于要计算较为复杂的行列式,计算量很大。文章将Padé逼近的一些性质推广到广义逆矩阵Padé逼近的情形,给出了广义逆矩阵Padé逼近的一个算法。

Because of computing complex determinant, the computing amount of original generalized inverse matrix Padé approximants is great. In this paper, the qualities of Padé approximants are extended into generalized inverse matrix Padé approximants (GMPA), and an algorithm of GMPA is given. By means of this algorithm, any GMPA can be obtained through the recursive computations of simple diagonal GMPA.