The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Topic: Computing a * b - c * d
Replies: 20   Last Post: Dec 11, 2000 12:55 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Christian Bau

Posts: 331
Registered: 12/7/04
Re: Computing a * b - c * d
Posted: Dec 11, 2000 6:09 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <>, bv <> wrote:

> Christian Bau wrote:
> >
> > Calculate everything with lets say t+20 binary digits, and don't care too
> > much about correct rounding, just get the result as fast as possible.

> As I understand it, that's what the (IEEE) register arithmetic does. In
> this case, a*b-c*d are done with 80 bits, so you have 16 extra bits
> beyond double precision and hence for practical purposes exactly rounded
> for any precision t <= 16.

You snipped the second part of my post, and that makes the line you quoted
very misleading. There is no "for practical purposes exactly rounded";
something is either exactly rounded or not. The original poster wanted
"exactly rounded", not "exactly rounded most of the time", and that is
what makes the problem challenging. What you snipped is that - for example
- 80 bit arithmetic, finally rounded to 64 bit, is quite likely to give
the correctly rounded result, and it is quite likely that you can PROVE
that it is correct. What I suggested was:

Calculate with slightly higher precision, but still fast.
Hope that you can prove that the result is correct.
If you can prove it is correct, great.
If you cannot prove it is correct, only then use a slow method.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2017. All Rights Reserved.