Recursive formulation of the matrix Padé approximation in packed storage
From MaRDI portal
Recommendations
- Formulation of matrix Padé approximation in rectangular full packed storage
- A new application of the extended Euclidean algorithm for matrix Padé approximants
- scientific article; zbMATH DE number 69567
- Recursive algorithms for bivariate matrix-valued Padé type approximation
- A matrix interpretation of the extended Euclidean algorithm
Cites work
- scientific article; zbMATH DE number 3958533 (Why is no real title available?)
- scientific article; zbMATH DE number 3973270 (Why is no real title available?)
- scientific article; zbMATH DE number 3673431 (Why is no real title available?)
- scientific article; zbMATH DE number 3493262 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
- A general continued fraction expansion
- A new application of the extended Euclidean algorithm for matrix Padé approximants
- A new look at the Padé table and the different methods for computing its elements
- A recursive formulation of Cholesky factorization of a matrix in packed storage
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Recursive Algorithms for the Matrix Pade Problem
- Recursive Evaluation of Padé Approximants for Matrix Sequences
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
Cited in
(3)
This page was built for publication: Recursive formulation of the matrix Padé approximation in packed storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980202)