I understand that in Arnold's applications wide intervals often
occur. So he cannot accept any overestimation.
In my applications wide intervals occur, but not that frequent.
However, large matrices occur. Multiplication of interval matrices
of large dimension in realistic time needs mid-rad arithmetic:
n=500; A=midrad(randn(n),1e-3); B=midrad(randn(n),1e-3);
intvalinit('SharpIVmult'); tic, A*B; toc,
===> Slow but sharp interval matrix multiplication in use
Elapsed time is 77.518951 seconds.
intvalinit('FastIVmult'); tic, A*B; toc
===> Fast interval matrix multiplication in use (maximum overestimation
maximally factor 1.5 in radius)
Elapsed time is 1.418354 seconds.
The reason is first that matrix mid-rad IV-multiplication can use BLAS
routines. Second it needs only 2 times to switch the rounding mode
compared to (at best) n^2 times for inf-sup multiplication.