A generalisation of systematic relaxation methods for consistently ordered matrices
- 68 Downloads
A systematic relaxation method is analysed for consistently ordered matrices as defined by Broyden (1964). The method is a generalisation of successive over-relaxation (S.O.R.). A relation is derived between the eigenvalues of the iteration matrix of the method and the eigenvalues of the Jacobi iteration matrix. Forp-cyclic matrices, the method corresponds to using a special type of diagonal matrix instead of a single relaxation factor. For certain choices of this diagonal matrix, the method has a better asymptotic rate of convergence than S.O.R. and requires less calculations and computer store.
KeywordsMathematical Method Diagonal Matrix Relaxation Method Relaxation Factor Iteration Matrix
Unable to display preview. Download preview PDF.
- Broyden, C. G.: Some generalisations of the theory of successive over-relaxation. Num. Math.6, 269–284 (1964).Google Scholar
- Osborne, M. R.: A note on the numerical solution of a periodic parabolic problem. Num. Math.7, 155–158 (1965).Google Scholar
- Tee, G. J.: An application ofp-cyclic matrices for solving periodic parabolic problems. Num. Math.6, 142–159 (1964).Google Scholar
- Varga, R. S.:p-cyclic matrices: A generalisation of the Young-Frankel successive over-relaxation scheme. Pacific J. Math.9, 617–628 (1959)Google Scholar
- —— Matrix iterative analysis. Englewood Cliffs, N. J.: Prentice-Hall 1962.Google Scholar
- Verner, J. H., and M. J. M. Bernal: On generalisations of the theory of consistent orderings for successive over-relaxation methods. Num. Math.12, 215–222 (1968).Google Scholar
- Young, D.: Iterative methods for solving partial difference equations of elliptic type. Trans. Amer. Math. Soc.76, 92–111 (1954).Google Scholar