[Haskell-cafe] Re: ANN: interval and polynomial enclosure arithmetics

Michal Konecny mik at konecny.aow.cz
Sun Aug 10 15:53:01 EDT 2008

Roman Cheplyaka <roma <at> ro-che.info> writes:

> * Michal Konecny <mik <at> konecny.aow.cz> [2008-08-08 
> > and members of the KEG research group at Aston 
> > University have used  it for reliably solving differential 
> > 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:

is about using our polynomial enclosures to prove NCSPs that arise
from floating-point software verification problems.

analyses the convergence rate of an ODE solver that uses
piecewise constant enclosures (which is rather inefficient).

Best regards,
|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
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: This is a digitally signed message part.
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20080810/f9817e53/attachment.bin

More information about the Haskell-Cafe mailing list