Recursive Algorithms for the Matrix Pade Problem

DOI10.2307/2006200MaRDI QIDQ3884559zbMATH OpenOpenAlexFDO

Authors Adhemar Bultheel

Publication date 1980

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2006200

zbMATH Keywords

matrix Pade problemmatrix triangularizationrecursive algorithmsTrench-Zohar algorithm

Mathematics Subject Classification ID

Padé approximation (41A21) Numerical integration (65D30)

Cited in

(13)

• A new application of the extended Euclidean algorithm for matrix Padé approximants
• A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach
• On generalized spectral functions, the parametrization of block Hankel and block Jacobi matrices, and some root location problems
• Generalized inverse matrix Padé approximation on the basis of scalar products
• Krylov space methods on state-space control models
• A Lanczos-type method for multiple starting vectors
• Matrix interpretation of multiple orthogonality
• Computing high precision matrix Padé approximants
• Recursive relations for block Hankel and Toeplitz systems. Part I: Direct recursions
• Recursive relations for block Hankel and Toeplitz systems. II: Dual recursions
• Fast block Toeplitz orthogonalization
• Matrix Padé approximation: Definitions and properties
• Recursive formulation of the matrix Padé approximation in packed storage

This page was built for publication: Recursive Algorithms for the Matrix Pade Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3884559)