## Abstract

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 with directed rounding. As an application, we prove that the Lorenz equations support a strange attractor, as conjectured by Edward Lorenz in 1963. This conjecture was recently listed by Steven Smale as one of several challenging problems for the twenty-first century. We also prove that the attractor is robust, i.e., it persists under small perturbations of the coefficients in the underlying differential equations. Furthermore, the flow of the equations admits a unique SRB measure, whose support coincides with the attractor. The proof is based on a combination of normal form theory and rigorous computations.

Original language | English |
---|---|

Pages (from-to) | 53-117 |

Number of pages | 65 |

Journal | Foundations of Computational Mathematics |

Volume | 2 |

Issue number | 1 |

DOIs | |

Publication status | Published - Feb 2002 |

Externally published | Yes |

## Keywords

- Auto-validating algorithms
- Dynamical systems
- Lorenz attractor
- Normal forms