We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative telescoping algorithm based on the concept of integral bases.

翻译：我们提出了一种方法，将给定的双变量P递归序列分解为可求和部分与不可求和部分，使得不可求和部分在某种意义下极小化。该分解催生了一种基于整基概念的新约简型创新望远镜算法。