We give an algorithm to compute the asymptotic expansions of exp-log functions. The algorithm automatically computes the necessary asymptotic scale and does not suffer from problems of indefinite cancelation. In particular, an asymptotic equivalent can always be computed for a given exp-log function.

Authors: Daniel Richardson, Bruno Salvy, John Shackell, Joris van der Hoeven

View: Pdf, BibTeX