A new algorithm for computing asymptotic series

We describe a new algorithm for computing asymptotic expansions for a large class of expressions, whereby the asymptotic series are of a form more complicated than mere Puiseux series. Today’s computer algebra systems still lack good algorithms for handling such asymptotic expansions, although in theory some algorithms have been presented. The algorithm we present in this article is directly induced by the limit computation algorithm presented in [2] which is based on series computations in terms of the most rapidly varying subexpression of a given expression. Examples of the algorithm implemented in Maple are shown.