Monotone convergence of iterative methods for singular linear systems (Q1864780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1886393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotone convergence of iterative methods for singular linear systems |
scientific article; zbMATH DE number 1886393 |
Statements
Monotone convergence of iterative methods for singular linear systems (English)
0 references
11 January 2004
0 references
Monotonicity of iterative methods for singular systems is discussed. Results of \textit{A. Berman} and \textit{R. J. Plemmons} [Nonnegative matrices in the mathematical sciences (1979; Zbl 0484.15016)], and \textit{P. Semal} [Linear Algebra Appl. 230, 35-46 (1995; Zbl 0844.65107)] are generalized to the case of singular systems. It is shown that for a nonnegative splitting of the coefficient matrix there exist initial guesses such that the iterative sequence converges towards a solution of the system. The monotonicity of the block Gauss-Seidel method for solving a \(p\)-cyclic system and Markov chains is considered.
0 references
singular linear systems
0 references
iterative methods
0 references
semi-convergence
0 references
monotonicity
0 references
nonnegative splitting
0 references
block Gauss-Seidel method
0 references
\(p\)-cyclic system
0 references
Markov chains
0 references
0.8437532782554626
0 references
0.8296590447425842
0 references
0.8296590447425842
0 references
0.8285019993782043
0 references
0.8196495771408081
0 references
