Alternative algorithms for accelerated symbolic and numeric summation

尽管CPU设计取得了无可争议的进步，但不同应用领域的一些计算任务仍然可以归类为重量级任务或耗时任务。任何针对此类问题实现的加速都会受到最终用户的欢迎。这里提出的研究针对符号、符号-数字和数字总和中长期存在的与性能相关的问题。对于符号求和，目标是开发一套新的算法，以克服标准算法的长期存在的缺点，并被计算机代数系统广泛采用。这种方法的新颖之处在于(直接或间接)使用了积分表示的思想和各种积分变换来以算法的方式解决求和问题。将所得结果推广到求解多项式系数线性差分方程组的算法中。对于符号-数值求和，目的是探索一种基于特殊选择模数(Cunningham数)的模计算的快速收敛超几何级数的高精度计算的替代方法。这种方法的新奇之处在于实际使用了从特殊模集的模像快速重建有理数。对于数值求和，目标是以适当的方式利用递归链技术的力量，应用于优化代码生成和优化电路(VHDL码)生成。该方法的显著特征将在于电路生成器的实现，该电路生成器将生成专门的浮点单元，以每个时钟周期的项的速率执行任意复杂性的闭合形式的表达式的数值求和。

In spite of undisputable progress in CPU design some computational tasks in different application domains can still be categorized as heavy-weighted or time-consuming. Any kind of acceleration achieved for such problems is welcomed by the end users. Research proposed here targets long-standing performance related issues in symbolic, symbolic-numeric and numeric summation. For symbolic summation the objective is to to develop a set of new algorithms that will overcome long-standing shortcomings of standard and widely adopted by computer algebra systems algorithms. The novelty of this approach is in the use (direct or indirect) of ideas of integral representation and differentkinds of integral transforms for solving summation problems in an algorithmic fashion. The results will be also extended to the algorithms of solving linear difference equations with polynomial coefficients.For symbolic-numeric summation the objective is to investigate an alternative approaches to the high-precision evaluation of the rapidly convergent hypergeometric series based on modular computations with special choice of moduli (Cunningham numbers). The novelty of this approach is in practical use of fast reconstruction of rational numbers from modular images for special sets of moduli. For numeric summation the objective is to exploit in proper way the power of Chains of Recurrences technique with applications to both optimized code generation and optimized circuit (VHDL code) generation. The distinguishing feature of this approach will be in an implementation of circuit generator, which will generate specialized floating point units performing numeric summation of closed form expressions of arbitrary complexity at the rate of term per clock cycle.