Convergence analysis of modified iterative methods to solve linear systems (Q464363)
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 6358087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence analysis of modified iterative methods to solve linear systems |
scientific article; zbMATH DE number 6358087 |
Statements
Convergence analysis of modified iterative methods to solve linear systems (English)
0 references
17 October 2014
0 references
The authors consider the Accelerated OverRelaxation method (AOR), proposed by \textit{A. Hadjidimos} [Math. Comput. 32, 149--157 (1978; Zbl 0382.65015)]. They show that the classic form of AOR is better than the method proposed by \textit{M. Dehghan} and \textit{M. Hajarian} [``Modied AOR iterative methods to solve linear systems'', J. Vib. Control 20, No. 5, 661--669 (2014)], as well as that \textit{J. P. Milaszewicz}'s preconditioners [Linear Algebra Appl. 93, 161--170 (1987; Zbl 0628.65022)] are superior to the Dehghan and Hajarian ones.
0 references
iterative methods
0 references
preconditioning
0 references
comparison theorems
0 references
spectral radius
0 references
irreducible matrix
0 references
AOR
0 references
\(M\)-matrix
0 references
0 references
0 references
0.874275267124176
0 references
0.8736109733581543
0 references
0.8689234256744385
0 references
0.8590752482414246
0 references
