Algebraic computation, numerical computation and verified inclusions

  • Siegfried M. Rump
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 296)


The three different types of computation — the algebraic manipulation, the numerical computation and the computation of verified results — are aiming on different problems and deliver qualitatively different results, each method having its specific advantages for specific classes of problems. The following remarks give some thoughts on possible combinations of all three methods to obtain algorithms benefitting from the specific strength of either method.


Interval Arithmetic Algebraic Computation Inclusion Method Algebraic Number Field Interval Product 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AlHe83]
    Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, 1983. ACADEMIC PRESS, New York (1981).Google Scholar
  2. [IBM86]
    ACRITH, High-Accuracy Arithmetic Subroutine Library, Program Description and User's Guide, IBM Publications, Document Number SC33-6164-3 (1986).Google Scholar
  3. [KuMi81]
    Kulisch, U. and Miranker, W.L.: Computer Arithmetic in Theory and Practice, ACADEMIC PRESS, New York (1981).Google Scholar
  4. [KuRu87]
    Kulisch, U. and Rump, S.M.: Rechnerarithmetik und die Behandlung algebraischer Probleme, in Buchberger/Feilmeier/Kratz/Kulisch/Rump: Rechnerorientierte Verfahren, B.G. Teubner (1986).Google Scholar
  5. [Mo79]
    Moore, R.E.: Methods and Applications of Interval Analysis, SIAM Studies in Applied Mathematics, (1979).Google Scholar
  6. [Ra81]
    Rall, L.B.: Automatic Differentiation: Techniques and Applications, Springer Lecture Notes in Computer Science, 120 (1981).Google Scholar
  7. [Neu87]
    Neumaier, A.: Private communication.Google Scholar
  8. [Pi76]
    Pinkert, J.R.: Interval Arithmetic Applied to Polynomial Remainder Sequences, Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, New York, 214–218, (1976).Google Scholar
  9. [Ru76]
    Rump, S.M.: On the Sign of a Real Algebraic Number, Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, New York, 238–241, (1976).Google Scholar
  10. [Ru83]
    Rump, S.M.: Solving Algebraic Problems with High Accuracy, in "A New Approach to Scientific Computation", Edts. U.W. Kulisch and W.L. Miranker, ACADEMIC PRESS, p. 51–120 (1983).Google Scholar
  11. [Ru84]
    Rump, S.M.: Solution of linear and nonlinear algebraic problems with sharp, guaranteed bounds, COMPUTING Supplementum 5, 23 Seiten, (1984).Google Scholar
  12. [Ru85]
    Rump, S.M.: Properties of a Higher Order Computer Arithmetic, Proceedings of the 11th IMACS World Congress, Oslo, (1985); also in modified form in IMACS Transactions on Scientific Computation — 85, North Holland, (1986).Google Scholar
  13. [SIE86]
    ARITHMOS, Benutzerhandbuch, Siemens AG, Bestellnummer U 2900-J-Z87-1, (1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Siegfried M. Rump
    • 1
  1. 1.IBM Development and ResearchBoeblingenWest Germany

Personalised recommendations