À propos de l’optimalité des algorithmes numériques : étude du calcul de χ n

Jacques Dumontet

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1978)

  • Volume: 12, Issue: 2, page 109-123
  • ISSN: 0988-3754

How to cite

top

Dumontet, Jacques. "À propos de l’optimalité des algorithmes numériques : étude du calcul de $\chi ^n$." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 12.2 (1978): 109-123. <http://eudml.org/doc/92065>.

@article{Dumontet1978,
author = {Dumontet, Jacques},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {2},
pages = {109-123},
publisher = {EDP-Sciences},
title = {À propos de l’optimalité des algorithmes numériques : étude du calcul de $\chi ^n$},
url = {http://eudml.org/doc/92065},
volume = {12},
year = {1978},
}

TY - JOUR
AU - Dumontet, Jacques
TI - À propos de l’optimalité des algorithmes numériques : étude du calcul de $\chi ^n$
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 2
SP - 109
EP - 123
LA - fre
UR - http://eudml.org/doc/92065
ER -

References

top
  1. 1. J. ARSAC, Nouvelles leçons de programmation, Dunod, Paris, 1977. Zbl0479.68002
  2. 2. R. FLOYD, Assigning Meanings to Programs. Proceedings of a Symposium in Applied Mathematics, vol. 19, Mathematical Aspects of Computer Science, Providence Rhode Island, American Mathematical Society, 1967. Zbl0189.50204MR235771
  3. 3. R. L. GRAHAM, A. C. C. YAO et F. F. YAO, Addition Chains with Multiplicative Cost, Stanford University, 1976. 
  4. 4. C. A. R. HOARE, An Axiomatic Basis for Computer Programming, Comm. A.C.M., vol. 12, 1969, p. 576-583. Zbl0179.23105
  5. 5. D. E. KNUTH, The Art of Computer Programming, vol. 2, 1969, p. 398-422, Addison Wesley. Zbl0191.18001MR633878
  6. 6. M. LA PORTE et J. VIGNES, Algorithmes numériques, analyse et mise en oeuvre, Technip, 1974. Zbl0334.65035MR423748
  7. 7. H. LEROY, La fiabilité des programmes, Presses universitaires de Namur, 1975. 
  8. 8. D. P. MACCARTHY, The Optimal Algorithm to Evaluate xn Using Elementary Multiplication Methods, Math. comp., vol. 31, janvier 1977, p. 251-256. Zbl0348.65041MR428791
  9. 9. J. VIGNES et M. LA PORTE, Error Analysis in Computing. Proceedings of I.F.I.P. Congress, Stockholm, 1974, p. 610-614. Zbl0295.65035MR413467
  10. 10. N. WIRTH, Systematic Programming. An introduction, Prentice Hall, 1973. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.