Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/29251
Title: | On the choice of parameters in MAOR type splitting methods for the linear complementarity problem | Authors: | Cvetkovic Ljiljana Hadjidimos Apostolos Kostic Vladimir |
Issue Date: | 2014 | Journal: | Numerical Algorithms | Abstract: | © 2014, Springer Science+Business Media New York. In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), with a nonsingular H+ coefficient matrix A, by using all modulus-based matrix splitting iterative methods that have been around for the last couple of years. A deeper analysis shows that the iterative solution of the LCP by the modified Accelerated Overrelaxation (MAOR) iterative method is the “best”, in a sense made precise in the text, among all those that have been proposed so far regarding the following three issues: i) The positive diagonal matrix-parameter Ω ≥ diag(A) involved in the method is Ω = diag(A), ii) The known convergence intervals for the two AOR parameters, α and β, are the widest possible, and iii) The “best” possible MAOR iterative method is the modified Gauss-Seidel one. | URI: | https://open.uns.ac.rs/handle/123456789/29251 | ISSN: | 1017-1398 | DOI: | 10.1007/s11075-014-9824-1 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
22
checked on Nov 20, 2023
Page view(s)
7
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.