I'll cross-post there later. Thanks for the suggestion!
The application I have in mind is approximation algorithms for systems of
linear equations or linear programs. Approximation algorithms, such as the
power method, typically run until convergence of the solution vector is
reached. However, determining convergence is usually done by computing the
difference (epsilon) between the last two solutions and comparing it to
some threshold. This may work in some cases but not in general, as the
intermediate epsilon does not tell the distance to the actual solution.
Interval iteration tackles this problem by approaching the solution from
above and below. The difference between the upper and lower solution
bounds determines the quality of the solution. However, if we use
imprecise arithmetic (floats, doubles) it is important to round down/up in
computing the lower/upper bounds.
Best, Steffen
Am .05.2018, 12:50 Uhr, schrieb Serge Stinckwich
<serge.stinckw...@gmail.com>:
On Wed, May 23, 2018 at 11:47 AM Steffen Märcker <merk...@web.de> wrote:
*bump*
I guess there no way to do this now. But maybe a VM guy can give me how
difficult it might be to extend the VM accordingly.
Yes you should followup this question to the VM mailing-list.
Can you open an issue here:
https://github.com/PolyMathOrg/PolyMath/issues
so we don't forget about it ?
Do you have specific needs behind this ?
