论文部分内容阅读
This talk will survey very recent improvements of the classical,Wilkinson-style error bounds for summation,inner products,and complex arithmetic.In particular,we will see how to exploit low-level features of standard floating-point arithmetic,and how symbolic computation can help to verify the optimality of some of these new bounds.