Skip to main content

A Domain Theoretic Account of Euler’s Method for Solving Initial Value Problems

  • Conference paper
Book cover Applied Parallel Computing. State of the Art in Scientific Computing (PARA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3732))

Included in the following conference series:

Abstract

This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to other interval based techniques, the actual computation of enclosures to the solution is not based on the code list (term representation) of the vector field that defines the equation, but assumes instead that the vector field is approximated to an arbitrary degree of accuracy. By using approximations defined over rational or dyadic numbers, we obtain proper data types for approximating both the vector field and the solution. As a consequence, we can guarantee the speed of convergence also for an implementation of the method. Furthermore, we give estimates on the algebraic complexity for computing approximate solutions.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Jung, A.: Domain Theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, Clarendon Press, Oxford (1994)

    Google Scholar 

  2. Berz, M., Makino, K.: Verified integration of odes and flows using differential algebraic methods on high-order taylor models. Reliable Computing 4, 361–369 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Corliss, G.: Survey of interval algorithms for ordinary differential equations. Journal of Applied Mathematics and Computation 31, 112–120 (1989)

    Article  MathSciNet  Google Scholar 

  4. Edalat, A., Krznarić, M., Lieutier, A.: Domain-theoretic solution of differential equations (scalar fields). In: Proceedings of MFPS XIX. Elect. Notes in Theoret. Comput. Sci., vol. 83 (2004)

    Google Scholar 

  5. Edalat, A., Pattinson, D.: A domain theoretic account of picard’s theorem. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 494–505. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  7. Iserles, A.: Numerical Analysis of Differential Equations. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  8. Jackson, K., Nedialkov, N.: Some recent advances in validated methods for ivps for odes. Applied Numerical Mathematics archive 42(1), 269–284 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jackson, K., Nedialkov, N., Corliss, G.: Validated solutions of initial value problems for ordinary differential equations. Applied Mathematics and Computation 105, 21–68 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ko, K.: On the computational complexity of ordinary differential equations. Inform. Contr. 58, 157–194 (1983)

    Article  MATH  Google Scholar 

  11. Lohner, R.: Enclosing the solution of ordinary initial and boundary value problems. In: Kaucher, E., Kulisch, U., Ullrich, C. (eds.) Computer Arithmetic: Scientific Computation and Programming Languages. Wiley-Teubner Series in Computer Science (1987)

    Google Scholar 

  12. Lohner, R.: Einschließung der Lösung gewöhnlicher Anfangs- und Randwertaufgaben und Anwendungen. PhD thesis (1988)

    Google Scholar 

  13. Moore, R.: Methods and Applications of Interval Analysis. SIAM studies in applied mathematics, vol. 2. SIAM, Philadelphia (1979)

    MATH  Google Scholar 

  14. Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  15. Müller, N., Moiske, B.: Solving initial value problems in polynomial time. In: Proceedings of the 22th JAIIO - Panel 1993, pp. 283–293 (1993)

    Google Scholar 

  16. Nedialkov, N., Jackson, K.: The design and implementation of an object-oriented validated ode solver, Draft available via http://www.cas.mcmaster.ca/~nedialk/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Edalat, A., Pattinson, D. (2006). A Domain Theoretic Account of Euler’s Method for Solving Initial Value Problems. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_13

Download citation

  • DOI: https://doi.org/10.1007/11558958_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29067-4

  • Online ISBN: 978-3-540-33498-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics