## ON THE CONVERGENCE OF THE GENERALIZED MATRIX MULTISPLITTING RELAXED METHODS '2k(R1,\*1, QJ = (D -R ~E , -\*P,)-'[(I -Q1)D + (Q1-R J E ~ + ( a 1 -\*AF, 9LR2, + Q l h + Hk + W,)l (4) 0 2 ) = (D -R2,4 -\*2Hk>-'[(I -Qz)D + (Q, -Rz)p, + (Q, -\*JH,
On the convergence of the parallel multisplitting AOR algorithm
โ Scribed by Wang Deren
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 550 KB
- Volume
- 154-156
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The linear least squares problem, min x Ax-b 2 , is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by
It is possible to summarize the schemes, used in the past to stabilize algorithms, in the form of algorithm models. These models serve as patterns for subsequent applications. Summm'y--There are a number of algorithms in the literature which both theoretically and empirically are known to be only l
The underlying theory of vector sequence extrapolation methods for linear and nonlinear problems is examined. It is shown that nonlinearity limits savings in total number of iterations to \(50 \%\) for strongly nonlinear problems when linear-based extrapolation methods are used. In support of this c