首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal p--cyclic SOR
Authors:Apostolos Hadjidimos  Robert J Plemmons
Institution:(1) Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA , US;(2) Department of Mathematics and Computer Science, Wake Forest University, P.O. Box 7388, Winston-Salem, NC 27109, USA , US
Abstract:Summary. Our purpose in this paper is to extend --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 --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 . Received October 20, 1992 / Revised version received September 14, 1993
Keywords:Mathematics Subject Classification (1991): 65F10
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号