高斯帕的算法，精确的求和，以及离散的牛顿-莱布尼茨公式

Proceedings of the 2005 international symposium on Symbolic and algebraic computation Pub Date : 2005-07-24 DOI:10.1145/1073884.1073888

S. Abramov, M. Petkovssek

{"title":"高斯帕的算法，精确的求和，以及离散的牛顿-莱布尼茨公式","authors":"S. Abramov, M. Petkovssek","doi":"10.1145/1073884.1073888","DOIUrl":null,"url":null,"abstract":"Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper's algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is increased.","PeriodicalId":311546,"journal":{"name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","volume":"154 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula\",\"authors\":\"S. Abramov, M. Petkovssek\",\"doi\":\"10.1145/1073884.1073888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper's algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is increased.\",\"PeriodicalId\":311546,\"journal\":{\"name\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"volume\":\"154 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1073884.1073888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1073884.1073888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

给出了离散牛顿-莱布尼茨公式在用高斯帕算法或精确求和算法求不定和时成立的充分条件。结果表明，有时可以用增大求和安全范围的方法从求和中分解出一个多项式。

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

查看原文本刊更多论文

Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula

Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper's algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is increased.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

自引率

0.00%

发文量