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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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)
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)
Corliss, G.: Survey of interval algorithms for ordinary differential equations. Journal of Applied Mathematics and Computation 31, 112–120 (1989)
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)
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)
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)
Iserles, A.: Numerical Analysis of Differential Equations. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (1996)
Jackson, K., Nedialkov, N.: Some recent advances in validated methods for ivps for odes. Applied Numerical Mathematics archive 42(1), 269–284 (2002)
Jackson, K., Nedialkov, N., Corliss, G.: Validated solutions of initial value problems for ordinary differential equations. Applied Mathematics and Computation 105, 21–68 (1999)
Ko, K.: On the computational complexity of ordinary differential equations. Inform. Contr. 58, 157–194 (1983)
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)
Lohner, R.: Einschließung der Lösung gewöhnlicher Anfangs- und Randwertaufgaben und Anwendungen. PhD thesis (1988)
Moore, R.: Methods and Applications of Interval Analysis. SIAM studies in applied mathematics, vol. 2. SIAM, Philadelphia (1979)
Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
Müller, N., Moiske, B.: Solving initial value problems in polynomial time. In: Proceedings of the 22th JAIIO - Panel 1993, pp. 283–293 (1993)
Nedialkov, N., Jackson, K.: The design and implementation of an object-oriented validated ode solver, Draft available via http://www.cas.mcmaster.ca/~nedialk/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)