A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach
From MaRDI portal
(Redirected from Publication:1263247)
Gegeben sei eine formale Potenzreihe \(S(x)=\sum^{\infty}_{i=0}s_ ix^ i\) mit \(n\times n\)-Matrizen \(s_ i\) als Koeffizienten. Zur Berechnung von (Matrix-) Padé-Approximationen von S(x) wird ein rekursiver Algorithmus explizit angegeben, der auch dann arbeitet, wenn die Potenzreihe nicht normal ist.
Recommendations
Cites work
- A new application of the extended Euclidean algorithm for matrix Padé approximants
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
- Computation of the Exponential of a Matrix II. Practical Considerations
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 3493262 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Recursive Algorithms for the Matrix Pade Problem
- Recursive Evaluation of Padé Approximants for Matrix Sequences
Cited in
(6)- A new application of the extended Euclidean algorithm for matrix Padé approximants
- scientific article; zbMATH DE number 3843069 (Why is no real title available?)
- scientific article; zbMATH DE number 404705 (Why is no real title available?)
- scientific article; zbMATH DE number 1234596 (Why is no real title available?)
- Matrix Padé Fractions and Their Computation
- A divide-and-conquer method for constructing a pseudo-Jacobi matrix from mixed given data
This page was built for publication: A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263247)