Efficient programming in maple : a case study - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Efficient programming in maple : a case study

Bruno Salvy


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1611.pdf (237.36 Ko) Télécharger le fichier

Dates and versions

inria-00074949 , version 1 (24-05-2006)


  • HAL Id : inria-00074949 , version 1


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


Gmail Facebook Twitter LinkedIn More