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.
Type de document :
Rapport
[Research Report] RR-1611, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00074949
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:02:48
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:56:44

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

113

Téléchargements de fichiers

283