序列的计算极限

SIGSAM Bull. Pub Date : 2003-09-01 DOI:10.1145/990353.990362
Manuel Kauers
{"title":"序列的计算极限","authors":"Manuel Kauers","doi":"10.1145/990353.990362","DOIUrl":null,"url":null,"abstract":"Automated asymptotic methods only recently became subject of symbolic computation. Contributions like [3, 12, 5, 10, 13] discuss a variety of aspects concerning the asymptotic analysis of continuous, real-valued functions. First approaches employed generalized series expansion [5, 3], later methods are based on the theory of Hardy fields [6]. So far, it seems that more emphasis was laid on the treatment of continuous functions, and although some mathematical fundaments are already available [1, 2], algorithmic approaches for the discrete case seem rare. Our poster focuses on limit computation of sequences in Q, more specifically, of sequences that can be defined by HE-expressions [7]. We will present a rather simple approach which avoids the use of heavy theory but whose first applications already give promising fine results.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"164 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing limits of sequences\",\"authors\":\"Manuel Kauers\",\"doi\":\"10.1145/990353.990362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automated asymptotic methods only recently became subject of symbolic computation. Contributions like [3, 12, 5, 10, 13] discuss a variety of aspects concerning the asymptotic analysis of continuous, real-valued functions. First approaches employed generalized series expansion [5, 3], later methods are based on the theory of Hardy fields [6]. So far, it seems that more emphasis was laid on the treatment of continuous functions, and although some mathematical fundaments are already available [1, 2], algorithmic approaches for the discrete case seem rare. Our poster focuses on limit computation of sequences in Q, more specifically, of sequences that can be defined by HE-expressions [7]. We will present a rather simple approach which avoids the use of heavy theory but whose first applications already give promising fine results.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"164 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/990353.990362\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/990353.990362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

自动化渐近方法直到最近才成为符号计算的主题。像[3,12,5,10,13]这样的贡献讨论了关于连续实值函数的渐近分析的各个方面。前几种方法采用广义级数展开[5,3],后几种方法基于Hardy场理论[6]。到目前为止,似乎更多的是强调对连续函数的处理,尽管一些数学基础已经可用[1,2],但离散情况的算法方法似乎很少。我们的海报关注的是Q中序列的极限计算,更具体地说,是可由he表达式定义的序列的极限计算[7]。我们将提出一种相当简单的方法,避免使用繁重的理论,但其第一次应用已经给出了有希望的良好结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computing limits of sequences
Automated asymptotic methods only recently became subject of symbolic computation. Contributions like [3, 12, 5, 10, 13] discuss a variety of aspects concerning the asymptotic analysis of continuous, real-valued functions. First approaches employed generalized series expansion [5, 3], later methods are based on the theory of Hardy fields [6]. So far, it seems that more emphasis was laid on the treatment of continuous functions, and although some mathematical fundaments are already available [1, 2], algorithmic approaches for the discrete case seem rare. Our poster focuses on limit computation of sequences in Q, more specifically, of sequences that can be defined by HE-expressions [7]. We will present a rather simple approach which avoids the use of heavy theory but whose first applications already give promising fine results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信