An algorithm for computing a Padé approximant with minimal degree denominator
From MaRDI portal
(Redirected from Publication:455889)
Recommendations
Cited in
(16)- Stabilized time-series expansions for high-order finite element solutions of partial differential equations
- Algebraic properties of robust Padé approximants
- A new algorithm for calculating Padé approximants and its Matlab implementation
- Padé approximants for finite time ruin probabilities
- Robust Padé approximants may have spurious poles
- A new method for deriving adjacent approximants in the Padé table
- scientific article; zbMATH DE number 7264163 (Why is no real title available?)
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- Faint and clustered components in exponential analysis
- Minimal vector Padé approximation
- A tabular methodology to identify minimal row degrees for matrix Padé approximants
- Fast calculation of Laurent expansions for matrix inverses
- scientific article; zbMATH DE number 3990737 (Why is no real title available?)
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- scientific article; zbMATH DE number 3867914 (Why is no real title available?)
- scientific article; zbMATH DE number 4078608 (Why is no real title available?)
This page was built for publication: An algorithm for computing a Padé approximant with minimal degree denominator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455889)