On the convergence domains of the \(p\)-cyclic SOR
type: Item
instance of: scholarly article
title: On the convergence domains of the \(p\)-cyclic SOR
zbMATH Open document ID: 0859.65025
DOI: 10.1016/0377-0427(95)00245-6
published in: Journal of Computational and Applied Mathematics
publication date: 1997-04-07T00:00:00Z
review text: The authors consider the block successive overrelaxation (SOR) method for complex matrices \(A\) partitioned into \(p\times p\) blocks. Furthermore, the \(p\)-cyclic matrices \(A\) have the properties that \(A^T\) are consistently ordered and the associated block Jacobi matrices \(B\) have eigenvalues \(\mu\) with \(\mu^p\) real. Throughout the paper, the authors concentrate their attention on values of \(p\leq 5\), although many proofs are given for arbitrary \(p\). Denoting the spectral radii of the Jacobi matrices \(\rho\) and the under- or overrelaxation factor \(\omega\), the authors construct the regions in \((\rho,\omega)\) space for which SOR converges. The method of proof is an expansion of earlier, unpublished work of Hadjidimos, Li and Varga and is based on application of the Schur-Cohn algorithm. This algorithm relates the location of roots of a polynomial within the unit disk to positivity of some coefficients of the iterated Schur transform of the polynomial. One surprising conclusion reached is that there are \((\rho,\omega)\) pairs for which SOR applied to the matrix \(A\) converges, but for which SOR applied to the consistently-ordered matrix \(A^T\) does not converge. The authors also apply the Schur-Cohn algorithm to establish optimal values of the overrelaxation parameter \(\omega\).
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 933154
zbMATH Keywords: block successive overrelaxation method
zbMATH Keywords: \(p\)-cyclic matrices
zbMATH Keywords: consistently ordered
zbMATH Keywords: block Jacobi matrices
zbMATH Keywords: Schur-Cohn algorithm
author: A. Hadjidimos
author: Dimitrios Noutsos
author: M. Tzoumas
reviewed by: Myron Sussman
MaRDI profile type: Publication
full work available at URL: 0377-0427(95)00245-6
OpenAlex ID: W2049546380
cites work: Q3943082
cites work: On the equivalence of the k-step iterative Euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices
cites work: On the optimum relaxation factor associated with \(p\)-cyclic matrices
cites work: Q4072022
cites work: On complex successive overrelaxation
cites work: Generalised consistent ordering and the optimum successive overrelaxation factor
cites work: Convergence of block iterative methods applied to sparse least-squares problems
cites work: Optimal stretched parameters for the SOR iterative method
cites work: Q5626973
cites work: \(p\)-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
cites work: Q5342712
cites work: On generalizations of the theory of consistent orderings for successive overrelaxation methods
cites work: Over- and underrelaxation for linear systems with weakly cyclic Jacobi matrices of index p
cites work: Iterative Methods for Solving Partial Difference Equations of Elliptic Type
cites work: Q5604166
Wikidata QID: Q127498832
description: scientific article; zbMATH DE number 933154