Multidimensional Pad\'e approximation of binomial functions: Equalities
Michael A. Bennett, Greg Martin, Kevin O'Bryant

TL;DR
This paper studies multidimensional Padé approximations of binomial functions, providing explicit formulas, including a new Taylor series expression, and introduces a criterion for their perfection, enhancing understanding of their structure and applications.
Contribution
The paper derives explicit formulas for the Padé remainder and polynomials, including a new Taylor series expression, and introduces a criterion for the perfection of these approximations.
Findings
Explicit formulas for Padé remainders and polynomials.
A new Taylor series expression for the Padé remainder.
A criterion for the perfection of systems of Padé approximations.
Abstract
Let be complex numbers. If are polynomials of degree at most , and has a zero at of maximal order (for the given ), we say that are a \emph{multidimensional Pad\'e approximation of binomial functions}, and call the Pad\'e remainder. We collect here with proof all of the known expressions for and , including a new one: the Taylor series of . We also give a new criterion for systems of Pad\'e approximations of binomial functions to be perfect (a specific sort of independence used in applications).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
