On Calculating Partial Sums of Multiple Numerical Series by Methods of Computer Algebra

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Programming and Computer Software Pub Date : 2024-05-22 DOI:10.1134/s0361768824020099

V. I. Kuzovatov, A. A. Kytmanov, E. K. Myshkina

引用次数: 0

Abstract

A method to calculate partial sums of some multiple numerical series arising when searching for the resultant of a polynomial and an entire function is proposed. One can apply a symbolic algorithm that uses recurrent Newton formulas to find power sums of roots included in this formula without finding the very roots of the system. The algorithm that implements the proposed approach to calculate partial sums of multiple numerical series is implemented in Maple. Examples of using this algorithm to find partial sums of some classes of multiple numerical series are given.

查看原文本刊更多论文

论用计算机代数方法计算多重数值序列的部分和

摘要提出了一种计算在搜索多项式与整个函数的结果时产生的某些多重数列的部分和的方法。我们可以使用一种符号算法，利用牛顿递归公式求出该公式中包含的根的幂和，而无需求出系统的根。在 Maple 中实现了所提出的计算多个数值级数部分和的算法。文中给出了使用该算法求某些类多重数列的部分和的示例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Programming and Computer Software 工程技术-计算机：软件工程

CiteScore

1.60

自引率

28.60%

发文量

审稿时长

>12 weeks

期刊介绍： Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.