The SIGSAM Challenges: Symbolic Asymptotics in Practice

Philippe Flajolet 1 Bruno Salvy
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : We present answers to 5~out of~10 of the «Problems, Puzzles, Challenges» proposed by G.~J.~Fee and M.~B.~Monagan in the March~1997 issue of the {\em Sigsam Bulletin}. In all cases, the answer to a seemingly numerical problem is obtained via series expansions and asymptotic methods. This illustrates more generally the crucial rôle played in the presence of singular behaviours by symbolic asymptotics as a bridge between symbolic computation and numerical computations.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00069962
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 6:43:06 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Tuesday, February 22, 2011 - 10:53:12 AM

Identifiers

  • HAL Id : inria-00069962, version 1

Collections

Citation

Philippe Flajolet, Bruno Salvy. The SIGSAM Challenges: Symbolic Asymptotics in Practice. RT-0209, INRIA. 1997, pp.14. ⟨inria-00069962⟩

Share

Metrics

Record views

137

Files downloads

116