Consider the system
where b1 ≠ 0 and b2 ≠ 0. Its exact solution is
a a. Let b1 = 1 and b2 = 2. Solve this system using naive Gaussian elimination with three-digit (rounded) arithmetic and compare with the exact solution x1 = 1.00010 . . . and x2 = 0.99989 9. . . .
a b. Repeat the preceding part after interchanging the order of the two equations.
a c. Find values of b1 and b2 in the original system so that naive Gaussian elimination does not give poor answers.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.