The optimal parameter of SOR-\(k\) method for \(p\)-cyclic matrices (Q2479232)

For solving linear systems with coefficient matrix a consistently ordered \(p\)-cyclic matrix, the author investigates a type of successive over relaxation (SOR) methods, more precisely SOR-\(k\) method, with \(k\) between \(2\) and \(p\). For this method the coefficient matrix of the system is repartitioned in a normal \(k\)-cyclic matrix having nonsingular diagonal submatrices. The results proved by the author, on the spectral radius of the corresponding SOR iteration matrix, are generalizations of the previous results of \textit{R. S. Varga} [Pac. J. Math. 9, 617--628 (1959; Zbl 0088.09402)] and \textit{D. M. Young} [Trans. Am. Math. Soc. 76, 92--111 (1954; Zbl 0055.35704)]. For proving the new results, systematically, the implicit function theorem, is used. A comparison of the optimal relaxation parameter of the SOR-\(k\) method, is given when \(k\) varies, and also the monotonical variation of the spectral radius of the SOR iteration matrix for a fix relaxation parameter and different values of \(k\), is discussed .