A circuit for exact summation of floating-point numbers
In recent years methods for solving numerical problems have been developed which in contrast to traditional numerical methods compute intervals which are proven to contain the true solution of the given problem (cf. [10,11]). These methods rely on an exact evaluation of inner product expressions in...
Gespeichert in:
Veröffentlicht in: | Information processing letters 1996-02, Vol.57 (3), p.159-163 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In recent years methods for solving numerical problems have been developed which in contrast to traditional numerical methods compute intervals which are proven to contain the true solution of the given problem (cf. [10,11]). These methods rely on an exact evaluation of inner product expressions in order to obtain good (i.e. small) enclosure intervals. Practical experience has shown that using these methods even ill conditioned problems can often be solved with maximum accuracy. Since the exact inner product computation is a basic operation for these methods we developed a circuit to support the difficult part of the inner product computation: the accurate accumulation of the partial products. |
---|---|
ISSN: | 0020-0190 1872-6119 |
DOI: | 10.1016/0020-0190(95)00205-7 |