Coding Improving: Wegstein Method In the Wegstein method developed in Example 3.7, we performed 2 iterations of successive substitution followed by 10 iterations of the Wegstein method. Improve the...

Coding Improving: Wegstein Method In the Wegstein

method developed in Example 3.7, we performed 2 iterations

of successive substitution followed by 10 iterations of the

Wegstein method. Improve the code by exiting the Wegstein

method when the absolute value of the change in x x n

k n [ ] [ ] k − −1

is less than the convergence criterion parameter (Max_

Change) as ⎪x[k+1] − x[k]

⎪ <>

selection may be