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

DOI10.1016/J.CAM.2012.06.022zbMATH Open1255.65043OpenAlexW2010595748MaRDI QIDQ455889FDOQ455889

Authors: O. L. Ibryaeva, V. 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

Recommendations

• Minimal vector Padé approximation
• scientific article; zbMATH DE number 4078608
• scientific article; zbMATH DE number 3874606
• scientific article; zbMATH DE number 527503
• On the theory and computation of nonperfect Padé-Hermite approximants

zbMATH Keywords

numerical examplesToeplitz matrixFroissart doubletsminimal degree denominatorPadé approximantPadé-Laplace method

Mathematics Subject Classification ID

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

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast calculation of Laurent expansions for matrix inverses
• Minimal vector Padé approximation
• Stabilized time-series expansions for high-order finite element solutions of partial differential equations
• A new method for deriving adjacent approximants in the Padé table
• Title not available (Why is that?)
• A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
• Faint and clustered components in exponential analysis
• Algebraic properties of robust Padé approximants
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• Padé approximants for finite time ruin probabilities
• Robust Padé approximants may have spurious poles
• Title not available (Why is that?)

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)