Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

It is known that if a and b have exact representation in a given t-bit arith- metic, then fl(a+b) = (a+b)(1+6), where fl(.) denotes

It is known that if a and b have exact representation in a given t-bit arith- metic, then fl(a+b) =

It is known that if a and b have exact representation in a given t-bit arith- metic, then fl(a+b) = (a+b)(1+6), where fl(.) denotes the result of an operation performed by a computer, and [8] u (u = 2-t- denotes the unit round-off error). Assume that four numbers a, b, c, d = R, |a| < |b| < |c| < |d|, have exact computer representation. Which of the two algorithms: fl(a+b+c+d) or fl(d+c+b+a), computes more accurate result (with smaller absolute error)? Justify the answer! A note: the conclusion in this problem is independent on the fact that the numbers have exact representation. This assumption only makes the calculation easier.

Step by Step Solution

3.45 Rating (158 Votes )

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Income Tax Fundamentals 2013

Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill

31st Edition

1111972516, 978-1285586618, 1285586611, 978-1285613109, 978-1111972516

More Books

Students also viewed these Programming questions

Question

1.3 Contrast culture with race, personality, and popular culture.

Answered: 1 week ago