Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields

Authors:
Abbas Edalat;Dirk Pattinson
Affiliations:
Department of Computing, Imperial College, London, UK;Department of Computing, Imperial College, London, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 11
Cited 2

On the computational complexity of ordinary differential equations

Information and Control
A first course in the numerical analysis of differential equations

A first course in the numerical analysis of differential equations
Computable analysis: an introduction

Computable analysis: an introduction
Domain Theory and Differential Calculus (Functions of one Variable)

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Computing with Real Numbers

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Domain theory and differential calculus (functions of one variable)

Mathematical Structures in Computer Science
Inverse and Implicit Functions in Domain Theory

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)

Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
The primitive recursive analysis of ordinary differential equations and the complexity of their solutions

Journal of Computer and System Sciences
A domain theoretic account of euler's method for solving initial value problems

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
A computational model for multi-variable differential calculus

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Time Complexity and Convergence Analysis of Domain Theoretic Picard Method

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A computational model for multi-variable differential calculus

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends the domain theoretic method for solving initial value problems, described in [A. Edalat and D. Pattinson. A domain theoretic account of picard's theorem. In Proc. ICALP 2004, number 3142 in Lect. Notes in Comp. Sci., pages 494-505, 2004], to unbounded vector fields. Based on a sequence of approximations of the vector field, we construct two sequences of piecewise linear functions that converge exponentially fast from above and below to the classical solution of the initial value problem. We then show how to construct approximations of the vector field. First, we show that fast convergence is preserved under composition of approximations, if the approximated functions satisfy an additional property, which we call ''Hausdorff Lipschitz from below''. In particular, this frees us from the need to work with maximal extensions of classical functions. In a second step, we show how to construct approximations that satisfy this condition from a given computable vector field.