Logo image
Optimization of the representation of results in interval arithmetic
Document de travail   Open Access

Optimization of the representation of results in interval arithmetic

Yizhi Yang, David Defour, Stef Graillat et Fabienne Jézéquel

Résumé

interval arithmetic floating-point arithmetic mixed precision storage rounding error numerical accuracy AMS : 65G20, 65G30, 65G50, 65Y20
Interval arithmetic enables rigorous bounding of rounding errors, but standard representations require storing two floating-point numbers per interval, which increases memory costs and data transfer in large-scale computations. We propose a compressed interval representation inspired by the FP-ANR format, encoding both the center and the radius within a single floating-point word while preserving the strict inclusion of the original interval. We present an efficient algorithm to convert center-radius intervals into this format with minimal over-approximation. Its applications to the interval matrix product and the interval Newton method demonstrate the practical benefits of this representation. Additionally, the proposed approach enables the integration of mixed-precision computations, paving the way for scalable and memory-efficient interval arithmetic in scientific computing.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image