A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach

DOI10.1016/0898-1221(89)90019-9zbMath0687.65046OpenAlexW2080136153MaRDI QIDQ1263247

K. Appert

Publication date: 1989

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90019-9

zbMATH Keywords

power seriesEuclidean algorithmrecursive algorithmmatrix polynomialdivide-and-conquermatrix Padé approximantsremainder sequence

Mathematics Subject Classification ID

Padé approximation (41A21) Algorithms for approximation of functions (65D15) Matrices over function rings in one or more variables (15A54)

Cites Work

• Unnamed Item
• Unnamed Item
• A new application of the extended Euclidean algorithm for matrix Padé approximants
• Recursive Evaluation of Padé Approximants for Matrix Sequences
• Recursive Algorithms for the Matrix Pade Problem
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Computation of the Exponential of a Matrix II. Practical Considerations
• Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials

This page was built for publication: A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach