𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of parallel multisplitting iterative methods for M-matrices

✍ Scribed by M. Neumann; R.J. Plemmons


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
712 KB
Volume
88-89
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Parallel multisplitting iterative method
✍ Wen Li; W. Sun; K. Liu πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 97 KB

In this paper, we study parallel (two-stage) multisplitting methods for singular M -matrices. Some theoretical analysis in consistency and convergence of methods are presented, which also a rms that the Bru, Canto and Climents' conjecture holds.

Alternative convergence criteria for ite
✍ Hamilton A. Chase πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 877 KB

x,,, -J, m = 1, 2, 3 . . be an iteration method for solving the nonlinear problem F(X) = 0, where F(X) and its derivatives possess all of the properties required by T(x,,,). Then ifit can be established thatfor the problem at hand jlF(~,+ 1)i/ < &,, llF(x& V m > M,, (M, < co) and 0 < &,, < 1, dejini

Convergence analysis of an iterative agg
✍ Ivo Marek; Petr Mayer πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 2 views

An aggregation/disaggregation iterative algorithm for computing stationary probability vectors of stochastic matrices is analysed. Two convergence results are presented. First, it is shown that fast, global convergence can be achieved provided that a sufficiently high number of relaxations is perfor