Block Two-stage Methods for Singular Systems and Markov Chains

✍ Scribed by Violeta Migallón; José Penadés; Daniel B. Szyld

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 797 KB
• Volume: 3
• Category: Article
• ISSN: 1070-5325
• DOI: 10.1002/(sici)1099-1506(199609/10)3:5<413::aid-nla91>3.0.co;2-s

✦ Synopsis

The use of block two-stage methods for the iterative solution of consistent singular linear systems is studied. In these methods, suitable for parallel computations, different blocks, i.e., smaller linear systems, can be solved concurrently by different processors. Each of these smaller systems are solved by an (inner) iterative method. Hypotheses are provided for the convergence of non-stationary methods, i.e., when the number of inner iterations may vary from block to block and from one outer iteration to another. It is shown that the iteration matrix corresponding to one step of the block method is convergent, i.e., that its powers converge to a limit matrix. A theorem on the convergence of the infinite product of matrices with the same eigenspace corresponding to the eigenvalue 1 is proved, and later used as a tool in the convergence analysis of the block method. The methods studied can be used to solve any consistent singular system, including discretizations of certain differential equations. They can also be used to find stationary probability distribution of Markov chains. This last application is considered in detail.