Cargando…
A Verified ODE Solver and the Lorenz Attractor
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...
Autor principal: | Immler, Fabian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Netherlands
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6044317/ https://www.ncbi.nlm.nih.gov/pubmed/30069071 http://dx.doi.org/10.1007/s10817-017-9448-y |
Ejemplares similares
-
The Lorenz equations bifurcations, chaos, and strange attractors
por: Sparrow, Colin
Publicado: (1982) -
Comparative test results for two ODE solvers: EPISODE and GEAR
por: Byrne, G D, et al.
Publicado: (1977) -
Lorenz
por: Nisbett, Alec
Publicado: (1985) -
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
por: Blanchette, Jasmin Christian, et al.
Publicado: (2018) -
Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL
por: Bottesch, Ralph, et al.
Publicado: (2020)