Skip to main content

Towards Using Exact Real Arithmetic for Initial Value Problems

  • Conference paper
  • First Online:
Book cover Perspectives of System Informatics (PSI 2015)

Abstract

In the paper we report on recent developments of the iRRAM software [7] for exact real computations. We incorporate novel methods and tools to generate solutions of initial value problems for ODE systems with polynomial right hand sides (PIVP). The algorithm allows the evaluation of the solutions with an arbitrary precision on their complete open intervals of existence. In consequence, the set of operators implemented in the iRRAM software (like function composition, computation of limits, or evaluation of Taylor series) is expanded by PIVP solving.

The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme FP7/2007-2013/ under REA grant agreement n\(^{\circ }\) PIRSES-GA-2011-294962-COMPUTAL and from the DFG/RFBR grant CAVER BE 1267/14-1 and 14-01-91334.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kawamura, A., Ota, H., Rösnick, C., Ziegler, M.: Computational complexity of smooth differential equations. Log. Meth. Comput. Sci. 10(1), 1–15 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Makino, K., Berz, M.: Taylor models and other validated functional inclusion methods. Int. J. Pure Appl. Math. 4(4), 379–456 (2003)

    MathSciNet  MATH  Google Scholar 

  3. Müller, N., Korovina, M.: Making Big Steps in Trajectories. In: EPTCS (2010)

    Google Scholar 

  4. Müller, N.T.: Polynomial time computation of Taylor series. In: Proceedings of the 22th JAIIO - Panel 1993, Part 2, pp. 259–281, Buenos Aires (1993)

    Google Scholar 

  5. Müller, N.T.: Constructive aspects of analytic functions. In: Ko, K.I., Weihrauch, K. (eds.) Computability and Complexity in Analysis. Informatik Berichte, vol. 190, pp. 105–114. FernUniversität Hagen (September 1995), CCA Workshop, Hagen, 19–20 August 1995

    Google Scholar 

  6. Müller, N.T.: Towards a real real RAM: a prototype using C++. In: Ko, K.I., Mller, N., Weihrauch, K. (eds.) Computability and Complexity in Analysis, pp. 59–66. Universität Trier, Second CCA Workshop, Trier, 22–23 August 1996

    Google Scholar 

  7. Müller, N.T.: The iRRAM: exact arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, p. 222. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Nedialkov, N.S.: VNODE-LP — a validated solver for initial value problems inordinary differential equations. Technical report, CAS-06-06-NN, Department of Computingand Software, McMaster University, Hamilton, Ontario, L8S 4K1 (2006)

    Google Scholar 

  9. Nedialkov, N.S., Jackson, K.R., Corliss, G.F.: Validated solutions of initial value problems for ordinary differential equations. Appl. Math. Comput. 105(1), 21–68 (1999)

    MathSciNet  MATH  Google Scholar 

  10. Parker, G.E., Sochacki, J.S.: Implementing the Picard iteration. neural, parallel. Sci. Comput. 4(1), 97–112 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Pouly, A., Graça, D.S.: Computational complexity of solving elementary differential equations over unbounded domains. CoRR abs/1409.0451 (2014)

    Google Scholar 

  12. Teschl, G.: Ordinary Differential Equations and Dynamical Systems. Graduate Studies in Mathematics. American Mathematical Society, Providence (2012)

    Book  MATH  Google Scholar 

  13. Weihrauch, K.: Computable Analysis: An Introduction. Springer-Verlag New York, Inc., Secaucus (2000)

    Book  MATH  Google Scholar 

  14. Zimmermann, P.: Reliable computing with GNU MPFR. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 42–45. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Norbert Th. Müller .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Brauße, F., Korovina, M., Müller, N.T. (2016). Towards Using Exact Real Arithmetic for Initial Value Problems. In: Mazzara, M., Voronkov, A. (eds) Perspectives of System Informatics. PSI 2015. Lecture Notes in Computer Science(), vol 9609. Springer, Cham. https://doi.org/10.1007/978-3-319-41579-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41579-6_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-41578-9

  • Online ISBN: 978-3-319-41579-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics