Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
From MaRDI portal
Recommendations
- Automata, Languages and Programming
- Polynomial-time solution of initial value problems using polynomial enclosures
- A Domain-Theoretic Account of Picard's Theorem
- Domain theoretic solutions of initial value problems for unbounded vector fields
- Domain-theoretic solution of differential equations (scalar fields)
Cites work
- Accuracy and Stability of Numerical Algorithms
- Automata, Languages and Programming
- Domain theoretic solutions of initial value problems for unbounded vector fields
- scientific article; zbMATH DE number 1746043 (Why is no real title available?)
- RealLib: An efficient implementation of exact real arithmetic
- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
Cited in
(8)- Domain theoretic second-order Euler's method for solving initial value problems
- Time-explicit Darwin PIC algorithm
- Polynomial-time solution of initial value problems using polynomial enclosures
- A Domain-Theoretic Account of Picard's Theorem
- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
- Automata, Languages and Programming
- Recursive solution of initial value problems with temporal discretization
- Continuous domains for function spaces using spectral compactification
This page was built for publication: Time Complexity and Convergence Analysis of Domain Theoretic Picard Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511455)