
doi: 10.1007/bf01940776
We enumerate the round-off errors in fixed point multiplication both for rounding by chopping and for symmetric rounding. Then we compute the mean and variance of the round-off error. For symmetric rounding, the formulas differ for an odd base β vs an even base β. We conclude that if symmetric rounding is to be used, there is an advantage to an odd base over an even base. For prime base β, no special assumption is needed. For non-prime base β, the last non-zero element of the first factor is assumed to be relatively prime to β.
Roundoff error, Formal languages and automata, Algorithms in computer science
Roundoff error, Formal languages and automata, Algorithms in computer science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
