Time Complexity and Convergence Analysis of Domain Theoretic Picard Method

DOI10.1007/978-3-540-69937-8_14zbMath1155.65356OpenAlexW1607449108MaRDI QIDQ3511455

Michal Konečný, Amin Farjudian

Publication date: 10 July 2008

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://publications.aston.ac.uk/id/eprint/16392/1/wollic08_1_.pdf

Mathematics Subject Classification ID

Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

Domain theoretic second-order Euler's method for solving initial value problems ⋮ Recursive solution of initial value problems with temporal discretization ⋮ Time Complexity and Convergence Analysis of Domain Theoretic Picard Method

Uses Software

• RealLib
• iRRAM
• VNODE

Cites Work

• RealLib: An efficient implementation of exact real arithmetic
• Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
• Accuracy and Stability of Numerical Algorithms
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Time Complexity and Convergence Analysis of Domain Theoretic Picard Method