Summary.
Our purpose in this paper is to extend\(p\) --cyclic SOR theory to consistent singular systems and to apply the results to the solution of large scale systems arising, {\em e.g.,} in queueing network problems in Markov analysis. Markov chains and queueing models lead to structured singular linear systems and are playing an increasing role in the understanding of complex phenomena arising in computer, communication and transportation systems. For certain important classes of singular problems, we develop a convergence theory for \(p\)--cyclic SOR, and show how to repartition for optimal convergence. Results by Kontovasilis, Plemmons and Stewart on the concept of convergence of SOR in an {\em extended} sense are rigorously analyzed and applied to the solution of periodic Markov chains with period \(p = 2\).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 20, 1992 / Revised version received September 14, 1993
Rights and permissions
About this article
Cite this article
Hadjidimos, A., Plemmons, R. Optimal \(p\)--cyclic SOR . Numer. Math. 67, 475–490 (1994). https://doi.org/10.1007/s002110050039
Issue Date:
DOI: https://doi.org/10.1007/s002110050039