Formulation of Matrix Pade Approximation in Rectangular Full Packed Storage

M. Kaliyappan, S. Ponnusamy, S. Sundar

Abstract


The Extended Euclidean algorithm for matrix Pade approximants is applied to compute matrix Pade approximants in rectangular
full packed format (RFP) if the coefficient matrices of the input matrix polynomial are triangular. The procedure
given by Gustavson et al for packing a triangular matrix in rectangular full packed format is applied to pack sequence
of lower triangular matrices of a matrix polynomial in Rectangular Full Packed format. This RFP format of a matrix
polynomial is applied to compute matrix Pade approximants of the matrix polynomial using Matrix Pade Extended Euclidean
Algorithm. Algorithms for the multiplication of two triangular matrices and inverse of a triangular matrix in RFP
format are also presented. The CPU time and memory comparison in computing the matrix Pade approximants of a matrix
polynomial between RFP format case and non packed case are elucidated in detail.

Full Text: PDF DOI: 10.5539/jmr.v1n2p184

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.