Computing Publications

Publications Home » A domain theoretic account of Pic...

A domain theoretic account of Picard's theorem

Abbas Edalat, Dirk Pattinson

Conference or Workshop Paper
31st international colloquium on automata, languages and programming (ICALP 2004), Turku University, Maths Department, Turku, Finland
2004
Lecture Notes in Computer Science
Volume 3142
pp.494–505
Springer-Verlag
ISBN 3-5402-2849-7
Abstract

We present a domain-theoretic version of Picardrsquos theorem for solving classical initial value problems in $\mathbb{R}^n$. For the case of vector fields that satisfy a Lipschitz condition, we construct an iterative algorithm that gives two sequences of piecewise linear maps with rational coefficients, which converge, respectively from below and above, exponentially fast to the unique solution of the initial value problem. We provide a detailed analysis of the speed of convergence and the complexity of computing the iterates. The algorithm uses proper data types based on rational arithmetic, where no rounding of real numbers is required. Thus, we obtain an implementation framework to solve initial value problems, which is sound and, in contrast to techniques based on interval analysis, also complete: the unique solution can be actually computed within any degree of required accuracy.

Postscript of full publication (214 kilobytes)
(need help viewing Postscript files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.