Recursive formulation of the matrix Padé approximation in packed storage

Authors:
M. Kaliyappan;S. Ponnusamy;S. Sundar
Affiliations:
Maha College of Engineering, Salem-636 106, India;Sona College of Technology, Salem 636 005, India;Indian Institute of Technology, Madras-600 036, India
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 3
Cited 0

A recursive formulation of Cholesky factorization of a matrix in packed storage

ACM Transactions on Mathematical Software (TOMS)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Recursive evaluation of padé approximants for matrix sequences

IBM Journal of Research and Development

Quantified Score

Hi-index	0.09

Visualization

Abstract

The Extended Euclidean algorithm for matrix Pade approximants is applied to compute matrix Pade approximants when the coefficient matrices of the input matrix polynomial are triangular. The procedure given by Bjarne S. Anderson et al. for packing a triangular matrix in recursive packed storage is applied to pack a sequence of lower triangular matrices of a matrix polynomial in recursive packed storage. This recursive packed storage for a matrix polynomial is applied to compute matrix Pade approximants of the matrix polynomial using the Matrix Pade Extended Euclidean algorithm in packed form. The CPU time and memory comparison, in computing the matrix Pade approximants of a matrix polynomial, between the packed case and the non-packed case are described in detail.