{"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}
引用次数: 0
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.