Re: ANN: interval and polynomial enclosure arithmetics

Roman Cheplyaka
* Michal Konecny
[2008-08-08 13:38:56+0100] and members of the KEG research group at Aston University have used it for reliably solving differential equations and numerical constraint satisfaction problems.
This's very interesting. Do you have any published papers (or other sources of information) about it?
Unfortunately, there isn't much yet but more is on the way. Only the following two papers are available at the moment: http://www-users.aston.ac.uk/~konecnym/papers/cfv08.html is about using our polynomial enclosures to prove NCSPs that arise from floating-point software verification problems. http://www-users.aston.ac.uk/~konecnym/papers/wollic08.html analyses the convergence rate of an ODE solver that uses piecewise constant enclosures (which is rather inefficient). Best regards, Michal -- |o| Michal Konecny |o| http://www-users.aston.ac.uk/~konecnym/ |o| office: (+42) (0)121 204 3462 |o| PGP key http://www-users.aston.ac.uk/~konecnym/ki.aow
participants (1)
-
Michal Konecny