Computational algorithms for ordinary differential equations [chapter]

Warwick Tucker
2000 Equadiff 99  
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of interval arithmetic. We illustrate the presented method by computing solution sets for two explicit systems. ¥ © § n . We will sometimes denote the solution of (1) by ϕ ¡ x £ t ¢
doi:10.1142/9789812792617_0015 fatcat:65uh77unsnczhlro5m4irbfvem