By Topic

Recursive Evaluation of Padé Approximants for Matrix Sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rissanen, J. ; IBM Research Laboratory, San Jose, California 95114, USA

An algorithm is described for calculating the existing Padé approximants to any sequence A0, A1, ⋅ ⋅ ⋅ of s × t-matrices. As an application the algorithm gives a new way for finding the minimal polynomial of any square matrix A and the inverse of the characteristic matrix xI − A.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:16 ,  Issue: 4 )