Question: 4. Let f(x) = 2 - 1 (a) Consider computing f(x) via the following algorithm: = 1: y = e^x 2: return y - 1

 4. Let f(x) = 2 - 1 (a) Consider computing f(x)

via the following algorithm: = 1: y = e^x 2: return y

- 1 Is this algorithm stable? Justify your answer (b) Let x

have the value 9.999999995000000 x 10-10, in which case f(x) is equalto 10-9 up to 16 decimal places. How many correct digits does

4. Let f(x) = 2 - 1 (a) Consider computing f(x) via the following algorithm: = 1: y = e^x 2: return y - 1 Is this algorithm stable? Justify your answer (b) Let x have the value 9.999999995000000 x 10-10, in which case f(x) is equal to 10-9 up to 16 decimal places. How many correct digits does the algorithm listed above give you? Is this expected? (c) Find a polynomial approximation of f(x) that is accurate to 16 digits for all |z|

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!