Kahan's summation algorithm recovers the bits that are lost in the process of adding a small...

Transcribed Image Text:

Kahan's summation algorithm recovers the bits that are lost in the process of adding a small and a large number and preserves this information in the form of an accumulated correction. The following FORTRAN segment implements this summation algorithm given an array of numbers x(j). sum = 0. carry = 0. do 100 j = 1, N y = carry + x(j) tsum y carry = (sum 100 sum = t - t) + y sum sum + carry The algorithm works because the variable carry contains the information that was lost as the result of adding x(j) to sum. Write a C++ program that implements Kahan's summation algorithm and compare to direct sum- mation. Consider the array 1 1 2'3 1 1000 Activ Go to S Kahan's summation algorithm recovers the bits that are lost in the process of adding a small and a large number and preserves this information in the form of an accumulated correction. The following FORTRAN segment implements this summation algorithm given an array of numbers x(j). sum = 0. carry = 0. do 100 j = 1, N y = carry + x(j) tsum y carry = (sum 100 sum = t - t) + y sum sum + carry The algorithm works because the variable carry contains the information that was lost as the result of adding x(j) to sum. Write a C++ program that implements Kahan's summation algorithm and compare to direct sum- mation. Consider the array 1 1 2'3 1 1000 Activ Go to S