A Polyalgorithm with Diagonal Storing for the Solution of Very Large Indefinite Linear Banded Systems on a Vector Computer.
Willi Schönauer, K. Raith · 1982
The efficient iterative solution of extremely large linear band matrix systems, resulting from the combination of a variable step size/variable order difference method and Newton's method is discussed. The natural storing by diagonals requires algorithms which go sequentially through diagonals. Jacobi-type and conjugate gradient type methods which can be easily formulated in diagonal form are combined to a polyalgorithm. The choice of the best method by the program itself is discussed. 8 references.