Summary
2007 International Symposium on Nonlinear Theory and its Applications
2007
Session Number:18PM2-E
Session:
Number:18PM2-E-3
Error-free transformations in real and complex floating point arithmetic
Stef Graillat, Valerie Menissier-Morain,
pp.341-344
Publication Date:2007/9/16
Online ISSN:2188-5079
DOI:10.34385/proc.41.18PM2-E-3
Summary:
Error-free transformation is a concept that makes it possible to compute accurate results within a floating point arithmetic. Up to now, it has only be studied for real floating point arithmetic. In this short note, we recall the known error-free transformations for real arithmetic and we propose some new error-free transformations for complex floating point arithmetic. This will make it possible to design some new accurate algorithms for summation, dot product and polynomial evaluation with complex entries.