Time complexity and convergence analysis of domain theoretic Picard method


We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

Publication DOI: https://doi.org/10.1007/978-3-540-69937-8_14
Divisions: ?? 50811700Jl ??
Additional Information: The original publication is available at www.springerlink.com
ISBN: 3-540-6996-8, 978-3-540-6996-1
Last Modified: 08 Dec 2023 12:39
Date Deposited: 15 May 2012 12:08
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
http://www.spri ... 2778n2761v524u/ (Publisher URL)
PURE Output Type: Conference contribution
Published Date: 2008
Authors: Farjudian, Amin
Konečný, Michal (ORCID Profile 0000-0003-2374-9017)

Export / Share Citation


Additional statistics for this record