Abstract
Novel roundoff error bounds for floating-point addition and multiplication are introduced. The error bounds are found to be tighter than conventional error bounds. Tight error bounds are of practical interest as they allow the reduction of intermediate result word lengths, consequently reducing the complexity of dedicated arithmetic hardware. The use of the proposed error bounds is demonstrated by deriving a roundoff error bound for polynomials when used as interpolators.
| Original language | British English |
|---|---|
| Pages (from-to) | 195-197 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 35 |
| Issue number | 3 |
| DOIs | |
| State | Published - 4 Feb 1999 |