Define an n×n array by ai j = −1+2 min{i, j }. Then set up the array (bi ) in such away that the solution of the system
Test procedure Naive Gauss on this system for a moderate value of n, say n = 15.
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.