Recursive formulation of the matrix Padé approximation in packed storage
From MaRDI portal
Publication:980202
DOI10.1016/j.camwa.2009.11.015zbMath1189.41008OpenAlexW2063753760MaRDI QIDQ980202
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.11.015
Cites Work
- 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
- 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
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
- A recursive formulation of Cholesky factorization of a matrix in packed storage
- The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
- A general continued fraction expansion
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item