The thesis discusses stability of procedures based on linear
computing formulas for numerical integration of an ordinary first-order
differential equation. The theorems are proved: (1) If the
procedure is asymptotically stable it is stable for small positive step
size if the Lipschitz number is negative; (2) Relative stability always
exists...
It is established folklore in numerical analysis, for solution
of a square system of linear equations by Gauss elimination, that the
standard method of choice of pivot elements is to search the entire
suppressed matrix for the element largest in absolute value. However,
it was felt by the author, that...