No label defined (Q4940822)
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 1406969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1406969 |
Statements
27 February 2000
0 references
stochastic matrix
0 references
stationary probability vector
0 references
iterative methods
0 references
aggregation/disaggregation method
0 references
convergence
0 references
numerical experiments
0 references
0 references
0.8942249417304993
0 references
0.891640305519104
0 references
0.8778930902481079
0 references
0.8746821284294128
0 references
The authors consider the two-level method mentioned in the title that was studied is several previous papers. They present two convergence results. First, global convergence is proved under the assumption that a sufficiently high number of relaxations on the fine level is performed. Second, it is proved that for local convergence (the starting vector sufficiently close to the result) an arbitrary number of relaxations (especially only one) is sufficient. No restrictive requirements are made on the stochastic matrix. The authors study also the dependence of the fine level error on the coarse level error. The results are illustrated by numerical experiments. Matrices with tridiagonal blocks are considered. The blocks are nonzero either in all positions or only on three block diagonals. Clusters of eigenvalues are present. The order of the matrices goes up to 1000.
0 references