A new application of the extended Euclidean algorithm for matrix Padé approximants
From MaRDI portal
Publication:1112562
DOI10.1016/0898-1221(88)90145-9zbMath0659.65045OpenAlexW2029415594MaRDI QIDQ1112562
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90145-9
numerical examplesformal power seriesextended Euclidean algorithmmatrix Padé approximantsPadé tablePascal procedure
Related Items (3)
A new application of the extended Euclidean algorithm for matrix Padé approximants ⋮ Recursive formulation of the matrix Padé approximation in packed storage ⋮ A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new application of the extended Euclidean algorithm for matrix Padé approximants
- Computation of poles of two-point Padé approximants and their limits
- Computation of Padé approximants and continued fractions
- Recursive Evaluation of Padé Approximants for Matrix Sequences
- Algebraic Computations of Scaled Padé Fractions
- Recursive Algorithms for the Matrix Pade Problem
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- A general continued fraction expansion
This page was built for publication: A new application of the extended Euclidean algorithm for matrix Padé approximants
