Unformatted text preview: t arithmetic. (Ugly looking answers with
2
0 1
expressions in denominators are allowed as long as they are correct.)
b. Now employ the same algorithm on the same problem but simulate a four decimal digit
floating point environment (thus 1 2 108 is computed as 1 ).
c. Finally, but use the original version of the Gaussian Elimination Algorithm and do the work
again in a four decimal digit floating point environment (thus 1 2 108 is computed as 1 ).
4. Suppose the application of the Gaussian Elimination algorithm on a 100 by 100 matrix is timed
at 500 seconds. How much time do you estimate would be required to apply the algorithm to a
1000 by 1000 matrix? (Ignore any issues with respect to the requirement for additional memory.)...
View
Full Document
 Spring '08
 PAVLOVIC
 Remainder, Matrices, Numerical digit, Positional notation

Click to edit the document details