Efficient programming in maple : a case study

Bruno Salvy 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : Studying the computation of orbits of some given group acting on a set, we show how successive refinements of a simple program provide a speedup factor of up to 200. The initial program cannot solve the problem at all, it is first converted into a program which needs one c.p.u. week and after all the optimizations have been performed, the computation takes only four hours. Although the problem is pecific, we shall show that many of the optimizations we use are of interest for other problems as well.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074949
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:02:48 PM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Sunday, April 4, 2010 - 9:56:44 PM

Identifiers

  • HAL Id : inria-00074949, version 1

Collections

Citation

Bruno Salvy. Efficient programming in maple : a case study. [Research Report] RR-1611, INRIA. 1992. ⟨inria-00074949⟩

Share

Metrics

Record views

123

Files downloads

298