Question: 2. Let X1, X2, ... be a sequence of floating point numbers, and let Sn = x1 + ... + In. Consider Kahan's compensated summation

 2. Let X1, X2, ... be a sequence of floating point

2. Let X1, X2, ... be a sequence of floating point numbers, and let Sn = x1 + ... + In. Consider Kahan's compensated summation algorithm Yn = Xn + en-1 n = $n-1 + yn en = = (n-1 n) + yn, n=1,2,... where each operation is performed in floating point arithmetic, and o = eo = 0. Show that n sn] = [C + 0(22)]\xkl, n k=1 where C is some constant, and is the machine precision. 2. Let X1, X2, ... be a sequence of floating point numbers, and let Sn = x1 + ... + In. Consider Kahan's compensated summation algorithm Yn = Xn + en-1 n = $n-1 + yn en = = (n-1 n) + yn, n=1,2,... where each operation is performed in floating point arithmetic, and o = eo = 0. Show that n sn] = [C + 0(22)]\xkl, n k=1 where C is some constant, and is the machine precision

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 Accounting Questions!