|
|
| Page | 57/128 | | Date | 02.05.2018 | | Size | 8.69 Mb. | | #47255 |
|
In short  , i = 1, 2, 3, . . .,n.
Of course, we cannot have bii = 0 for any i. So before starting the iterative program, we may have to reorder the equations. Further, it can be shown that if  for each i, then the method will converge, though it may be slowly. Here’s an outline of the “showing.”
Share with your friends: |
|
|
