迈向并行求和算法

Shaoshi Chen, Ruyong Feng, Manuel Kauers, Xiuyun Li
{"title":"迈向并行求和算法","authors":"Shaoshi Chen, Ruyong Feng, Manuel Kauers, Xiuyun Li","doi":"arxiv-2402.04684","DOIUrl":null,"url":null,"abstract":"We propose a summation analog of the paradigm of parallel integration. Using\nthis paradigm, we make some first steps towards an indefinite summation\nalgorithm applicable to summands that rationally depend on the summation index\nand a P-recursive sequence and its shifts. Under the assumption that the\ncorresponding difference field has no unnatural constants, we are able to\ncompute a bound on the normal part of the denominator of a potential closed\nform. We can also handle the numerator. Our algorithm is incomplete so far as\nwe cannot predict the special part of the denominator. However, we do have some\nstructural results about special polynomials for the setting under\nconsideration.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"17 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards a Parallel Summation Algorithm\",\"authors\":\"Shaoshi Chen, Ruyong Feng, Manuel Kauers, Xiuyun Li\",\"doi\":\"arxiv-2402.04684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a summation analog of the paradigm of parallel integration. Using\\nthis paradigm, we make some first steps towards an indefinite summation\\nalgorithm applicable to summands that rationally depend on the summation index\\nand a P-recursive sequence and its shifts. Under the assumption that the\\ncorresponding difference field has no unnatural constants, we are able to\\ncompute a bound on the normal part of the denominator of a potential closed\\nform. We can also handle the numerator. Our algorithm is incomplete so far as\\nwe cannot predict the special part of the denominator. However, we do have some\\nstructural results about special polynomials for the setting under\\nconsideration.\",\"PeriodicalId\":501033,\"journal\":{\"name\":\"arXiv - CS - Symbolic Computation\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2402.04684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.04684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了一种类似于并行积分范式的求和方法。利用这一范式,我们迈出了第一步,建立了一种不定求和算法,适用于合理地依赖于求和指数和 P 递推序列及其移位的求和。假定相应的差分场没有非自然常数,我们就能计算出潜在闭合形式分母法向部分的约束。我们还可以处理分子。由于我们无法预测分母的特殊部分,所以我们的算法并不完整。不过,我们确实有一些关于所考虑的特殊多项式的结构性结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards a Parallel Summation Algorithm
We propose a summation analog of the paradigm of parallel integration. Using this paradigm, we make some first steps towards an indefinite summation algorithm applicable to summands that rationally depend on the summation index and a P-recursive sequence and its shifts. Under the assumption that the corresponding difference field has no unnatural constants, we are able to compute a bound on the normal part of the denominator of a potential closed form. We can also handle the numerator. Our algorithm is incomplete so far as we cannot predict the special part of the denominator. However, we do have some structural results about special polynomials for the setting under consideration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synthesizing Evolving Symbolic Representations for Autonomous Systems Introducing Quantification into a Hierarchical Graph Rewriting Language Towards Verified Polynomial Factorisation Symbolic Regression with a Learned Concept Library Active Symbolic Discovery of Ordinary Differential Equations via Phase Portrait Sketching
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1