Libaffa is a C++ Affine Arithmetic library for GNU/Linux. Affine Arithmetic is a model proposed by Stolfi and Comba in the early 90's for numerical calculation. Unlike Interval Arithmetic, it keeps track of correlations between computed and input quantities, and is therefore resistant to the explosion error observed in long interval computations.
This might be a bit anecdotal, but I suspect that the current implementation of pow might be trading away smaller enclosures for reduced run time.
Right now, I've been evaluating a large number of 10-15 degree polynomials. In all cases that I've considered, I've found that rewriting the polynomial to multiply out expressions rather than using pow(double, int) produces a smaller enclosure.
I think this might be because pow is using a non-obvious algorithm (as noted in the changelog); in particular, involving the sqrt function is (I suspect) suboptimal for enclosures than standard multiplication.
This isn't necessarily a bug as the library is free to prioritize speed over enclosure size, but I think it is at least worth talking about.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent