This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug middle-end/18902] Naive (default) complex division algorithm
- From: "pcarlini at suse dot de" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 9 Dec 2004 11:26:31 -0000
- Subject: [Bug middle-end/18902] Naive (default) complex division algorithm
- References: <20041209110756.18902.pcarlini@suse.de>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From pcarlini at suse dot de 2004-12-09 11:26 -------
> The Annex G example still comes with a warning that it may yield undue
> overflow: it illustrates how to get the treatment of infinities expected
> in that informative Annex, not how to avoid excess overflow in general.
I see, probably I should have pointed out that I'm reading in detail Annex G
for the first time, and I'm not a floating point expert. Nvertheless, in the
light of some basic notions of numerical analysis, seems rather obvious to me
that "we have a problem" which, moreover, nobody apparently discusses in detail.
Which is your take on the issue, more generally?
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18902