A Viskovatov algorithm for Hermite-Padé polynomials

From MaRDI portal
Publication:5037702

DOI10.1070/SM9410zbMATH Open1484.41009arXiv2007.03370OpenAlexW3175759592MaRDI QIDQ5037702FDOQ5037702


Authors: Nikolaj R. Ikonomov, S. P. Suetin Edit this on Wikidata


Publication date: 4 March 2022

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Abstract: We propose an algorithm for producing Hermite-Pad'e polynomials of type I for an arbitrary tuple of m+1 formal power series [f0,dots,fm], mgeq1, about z=0 (fjinmathbbC[[z]]) under the assumption that the series have a certain (`general position') nondegeneracy property. This algorithm is a straightforward extension of the classical Viskovatov algorithm for construction of Pad'e polynomials (for m=1 our algorithm coincides with the Viskovatov algorithm). The algorithm proposed here is based on a recurrence relation and has the feature that all the Hermite-Pad'e polynomials corresponding to the multiindices (k,k,k,dots,k,k), (k+1,k,k,dots,k,k), (k+1,k+1,k,dots,k,k),dots, (k+1,k+1,k+1,dots,k+1,k) are already known by the time the algorithm produces the Hermite-Pad'e polynomials corresponding to the multiindex (k+1,k+1,k+1,dots,k+1,k+1). We show how the Hermite-Pad'e polynomials corresponding to different multiindices can be found via this algorithm by changing appropriately the initial conditions. The algorithm can be parallelized in m+1 independent evaluations at each nth step.


Full work available at URL: https://arxiv.org/abs/2007.03370




Recommendations





Cited In (6)





This page was built for publication: A Viskovatov algorithm for Hermite-Padé polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037702)