{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:51Z","timestamp":1761611331411},"reference-count":21,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":1127,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2007]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a domain-theoretic version of Picard's theorem for solving classical initial value problems in \u211dn. 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, from below and above respectively, 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 a sound implementation framework to solve initial value problems. In particular, the use of rational arithmetic guarantees that implementations of our technique will adhere to the bounds on convergence speed and algebraic complexity.<\/jats:p>","DOI":"10.1112\/s1461157000001315","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T11:42:31Z","timestamp":1375789351000},"page":"83-118","source":"Crossref","is-referenced-by-count":14,"title":["A Domain-Theoretic Account of Picard's Theorem"],"prefix":"10.1112","volume":"10","author":[{"given":"Abbas","family":"Edalat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000001315_ref006","volume-title":"Theory of ordinary differential equations","author":"Coddington","year":"1955"},{"key":"S1461157000001315_ref007","article-title":"\u2018Domain-theoretic solution of differential equations (scalar fields)\u2019","volume":"83","author":"Edalat","year":"2003","journal-title":"Proceedings of MFPS XIX"},{"key":"S1461157000001315_ref003","unstructured":"3.AWA. a software package for validated solution of ordinary differential equations, http:\/\/www.lsi.upc.es\/~robert\/mirror\/interval-comp\/intsoft.html."},{"key":"S1461157000001315_ref020","volume-title":"Computability in analysis and physics","author":"Pour-el","year":"1988"},{"key":"S1461157000001315_ref017","article-title":"\u2018Solving initial value problems in polynomial time\u2019","author":"M\u00fcller","year":"1993","journal-title":"Proceedings of the 22nd JAIIO - Panel'93"},{"key":"S1461157000001315_ref018","first-page":"21","article-title":"\u2018Validated solutions of initial value problems for ordinary differential equations\u2019","volume":"105","author":"Nedialkov","year":"1999","journal-title":"Appl. Math. Comput"},{"key":"S1461157000001315_ref015","volume-title":"Introductory real analysis","author":"Kolmogorov","year":"1970"},{"key":"S1461157000001315_ref014","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80062-X"},{"key":"S1461157000001315_ref013","volume-title":"Numerical analysis of differential equations","author":"Iserles","year":"1996"},{"key":"S1461157000001315_ref011","unstructured":"11.GNU: The GNU multi precision library, http:\/\/www.swox.com\/gmp\/."},{"key":"S1461157000001315_ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9"},{"key":"S1461157000001315_ref004","volume-title":"Computability of Banach space principles","volume":"286","author":"Brattka","year":"2001"},{"key":"S1461157000001315_ref010","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542725"},{"key":"S1461157000001315_ref008","volume-title":"Seventh Annual IEEE Symposium on Logic in Computer Science","author":"Edalat","year":"2002"},{"key":"S1461157000001315_ref001","first-page":"47","article-title":"\u2018Computable analysis and differential equations\u2019","author":"Aberth","year":"1968","journal-title":"Intuitionism and proof theory"},{"key":"S1461157000001315_ref009","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004359"},{"key":"S1461157000001315_ref016","volume-title":"Interval analysis","author":"Moore","year":"1966"},{"key":"S1461157000001315_ref002","volume-title":"Handbook of logic in computer science","volume":"3","author":"Abramsky","year":"1994"},{"key":"S1461157000001315_ref012","doi-asserted-by":"publisher","DOI":"10.4064\/fm-42-1-168-202"},{"key":"S1461157000001315_ref019","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(79)90021-4"},{"key":"S1461157000001315_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80031-0"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000001315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T22:01:20Z","timestamp":1559858480000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000001315\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"references-count":21,"alternative-id":["S1461157000001315"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000001315","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}