An algorithm for computing a Padé approximant with minimal degree denominator

DOI10.1016/j.cam.2012.06.022zbMath1255.65043OpenAlexW2010595748MaRDI QIDQ455889

O. L. Ibryaeva, Victor M. Adukov

Publication date: 22 October 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.06.022

zbMATH Keywords

numerical examplesToeplitz matrixPadé approximantFroissart doubletsminimal degree denominatorPadé-Laplace method

Mathematics Subject Classification ID

Padé approximation (41A21) Algorithms for approximation of functions (65D15)

Related Items (6)

Fast calculation of Laurent expansions for matrix inverses ⋮ Faint and clustered components in exponential analysis ⋮ Padé approximants for finite time ruin probabilities ⋮ Robust Padé approximants may have spurious poles ⋮ A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation ⋮ Algebraic properties of robust Padé approximants

This page was built for publication: An algorithm for computing a Padé approximant with minimal degree denominator