Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation
Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation
复制标题
DOI：
10.1007/s11139-006-6503-4
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
K. Driver;H. Prodinger;Carsten Schneider;J. Weideman
中科院分区：
文献类型：
--
作者：
K. Driver;H. Prodinger;Carsten Schneider;J. Weideman
证明了文[25]中所需的组合恒等式，主要是用C. Schneider的计算机代数软件包Sigma。任意阶对数的Padé近似的形式是一个猜想。
Combinatorial identities that were needed in [25] are proved, mostly with C. Schneider’s computer algebra packageSigma. The form of the Padé approximation of the logarithm of arbitrary order is stated as a conjecture.