Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


Recursive algorithms for the matrix Padé problem

Author: Adhemar Bultheel
Journal: Math. Comp. 35 (1980), 875-892
MSC: Primary 41A21; Secondary 65D15
MathSciNet review: 572862
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A matrix triangularization interpretation is given for the recursive algorithms computing the Padé approximants along a certain path in the Padé table, which makes it possible to unify all known algorithms in this field [5], [6]. For the normal Padé table, all these results carry over to the matrix Padé problem in a straightforward way. Additional features, resulting from the noncommutativity are investigated. A generalization of the Trench-Zohar algorithm and related recursions are studied in greater detail.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 41A21, 65D15

Retrieve articles in all journals with MSC: 41A21, 65D15

Additional Information

PII: S 0025-5718(1980)0572862-4
Keywords: Hankel and Toeplitz matrices, triangular decomposition of matrices, fast algorithms, rational approximation
Article copyright: © Copyright 1980 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia