EditionLocal convergence of the ( exact and inexact ) iterative aggregation method for linear systemsand Markov
نویسندگان
چکیده
The iterative aggregation method for the solution of linear systems is extended in several directions: to operators on Banach spaces; to the method with inexact correction, i.e., to methods where the (inner) linear system is in turn solved iteratively; and to the problem of nding stationary distributions of Markov operators. Local convergence is shown in all cases. Convergence results apply to the particular case of stochastic matrices. Moreover, an argument is given which suggests why the iterative aggregation method works so well for nearly uncoupled Markov chains, as well as for Markov chains with other zero-nonzero structures.
منابع مشابه
Convergence of an Iterative Scheme for Multifunctions on Fuzzy Metric Spaces
Recently, Reich and Zaslavski have studied a new inexact iterative scheme for fixed points of contractive and nonexpansive multifunctions. In 2011, Aleomraninejad, et. al. generalized some of their results to Suzuki-type multifunctions. The study of iterative schemes for various classes of contractive and nonexpansive mappings is a central topic in fixed point theory. The importance of Banach ...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملA Sufficiently Exact Inexact Newton Step Based on Reusing Matrix Information
Newton’s method is a classical method for solving a nonlinear equation F (z) = 0. We derive inexact Newton steps that lead to an inexact Newton method, applicable near a solution. The method is based on solving for a particular F (zk′) during p consecutive iterations k = k′, k′ + 1, . . . , k′ + p − 1. One such p-cycle requires 2 − 1 solves with the matrix F (zk′). If matrix factorization is us...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کامل