Advertisement

Symbolic preprocessing in interval function computing

  • G. Caplat
9. Symbolic-Numeric Interface
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)

Abstract

Symbolic manipulation proved to be a very efficient tool for detection and removal of dependency relations between variables : it is completed at the end of the global simplification. On the other hand the reduction to 1 (or 0) of the number of occurrences of variables is closely related to the structure of the expressions themselves. It is in general not achieved at the local simplification level. The limited possibilities for reduction and the varying character of expressions, just to mention two aspects, mean that we never can be sure to have been producing the best computable form for an expression (if existing) but only a more suitable one. However even a small gain at the symbolic level has very important repercussions for the quality of the computed results : any reduction of the number of elementary operations will not only improve the execution time, but also the accuracy of the final result.

Performing rigourous computations with strongly noised data may be a reasonable venture towards a good balance between symbolic and numerical calculations.

Keywords

Interval Function Interval Arithmetic Symbolic Manipulation Semantic Error Line Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    -A.V. Aho, J.D. Ullman: ‘Principles of compiler Design’. Addison Wesley 1977Google Scholar
  2. 2.
    -J. Beney: ‘Langage d'ecriture de transducteurs’. These LYON 1 1978Google Scholar
  3. 3.
    -G. Caplat: ‘Techniques numeriques et preparation formelle dans les problemes aux intervalles’. These LYON 1 1978Google Scholar
  4. 4.
    -L. Frecon, J. Beney, G. Caplat: ‘Notes pour Ampere’. Rapport interne INSA dept. Informatique 1977Google Scholar
  5. 5.
    -D.I. Good, R.L. London: ‘Compiler interval arithmetic; Definition and proof of good implementation’ J. ACM V17 no4 1970 pp 603–612Google Scholar
  6. 6.
    ---: ‘Interval arithmetic for B.5500’. Computer Sciences Tech. Report no 26. University of Wisconsin. MadisonGoogle Scholar
  7. 7.
    -E.R. Hansen: ‘Topics in Interval Analysis’ Oxford Univ. Press 1969Google Scholar
  8. 8.
    -Laporte, Vignes: ‘Etude statistique des erreurs dans l'arithmetique des ordinateurs’. Numerische Mathematik 23 1974 pp 63–72Google Scholar
  9. 9.
    -W. Miller: ‘Graph transformation for roundoff analysis’. SIAM computing V 5 no2 1976 pp 204–216Google Scholar
  10. 10.
    -R.E. Moore: ‘Interval Analysis’. Prentice Hall 1966Google Scholar
  11. 11.
    -K. Nickel: ‘Triplex Algol and its application’ in [7] pp 10–24Google Scholar
  12. 12.
    -F.W. Olver: ‘A new approach to error arithmetic’. SIAM Anal. Num. V 15 1978 PP 368–393Google Scholar
  13. 13.
    -M. Pichat: ‘Contribution a l'etude des erreurs d'arrondi en arithmetique à virgule flottante’ These Grenoble 1976Google Scholar
  14. 14.
    -S. Skelboe: ‘Computation of Rational Interval functions'. BIT 14 1974 pp 87–95Google Scholar
  15. 15.
    -O. Spaniol: ‘Die distributivitat in der Intervallarithmetik'. Computing no5 1970 pp 6–16Google Scholar
  16. 16.
    -J.M. Yohe: ‘Software Interval Arithmetic: A reasonably portable package’ ACM TOMS V 5 No 1 1979 pp 50–63Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • G. Caplat
    • 1
  1. 1.Laboratoire d'Informatique AppliquéeI.N.S.A.Villeurbanne CedexFrance

Personalised recommendations