Efficient implementation of interval matrix multiplication
Résumé
The straightforward implementation of interval matrix product suf- fers from poor efficiency, far from the performances of highly optimized floating-point implementations. In this paper, we show how to reduce the interval matrix multiplication to 9 floating-point matrix products - for performance issues - without sacrificing the quality of the result. We show that, compared to the straightforward implementation, the overes- timation factor is at most 1.18.
Domaines
Arithmétique des ordinateurs| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...