A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
A rigorous numerical algorithm, formally verified with Isabelle/HOL, is used to certify the computations that Tucker used to prove chaos for the Lorenz attractor. The verification is based on a formalization of a diverse variety of mathematics and algorithms. Formalized mathematics include ordinary differential equations and Poincaré maps. Algorithms include low level approximation schemes based on Runge-Kutta methods and affine arithmetic. On a high level, reachability analysis is guided bydoi:10.1007/s10817-017-9448-y pmid:30069071 pmcid:PMC6044317 fatcat:bfnqyafba5ah3njzjprip2tgz4