A Young-Eidson's type algorithm for complex \(p\)-cyclic SOR spectra (Q1301273): Difference between revisions

In a recent work, the authors have solved the problem of the minimization of the spectral radius of the iteration matrix of a \(p\)-cyclic successive overrelaxation method, when matrix \(A\) is block \(p\)-cyclic consistently ordered, which is known as the ``one-point'' problem for any \(p\geq 3\). In this paper a theory is developed to solve the ``two-point'' problem and is generalized an extended to cover the ``many-point'' problem and develop a Young-Eidson's type algorithm for its solution [cf. \textit{D. M. Young} and \textit{H. E. Eidson}, On the determination of the optimum relaxation factor for the SOR method when the eigenvalues of the Jacobi matrix are complex, Report CNA-1, Center for Numerical Analysis, University of Texas/Austin (1970)].