Abstract
We propose and justify an algorithm for producing Hermite- Padé polynomials of type I for an arbitrary tuple of formal power series , , about the point () 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 constructing Padé polynomials (for our algorithm coincides with the Viskovatov algorithm). The algorithm is based on a recurrence relation and has the following feature: all the Hermite-Padé polynomials corresponding to the multi- indices , , , , are already known at the point when the algorithm produces the Hermite-Padé polynomials corresponding to the multi- index . We show how the Hermite-Padé polynomials corresponding to different multi-indices can be found recursively via this algorithm by changing the initial conditions appropriately. At every step , the algorithm can be parallelized in independent evaluations. Bibliography: 30 titles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
