Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/29251
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cvetkovic Ljiljana | - |
dc.contributor.author | Hadjidimos Apostolos | - |
dc.contributor.author | Kostic Vladimir | - |
dc.date.accessioned | 2020-12-14T16:30:14Z | - |
dc.date.available | 2020-12-14T16:30:14Z | - |
dc.date.issued | 2014 | - |
dc.identifier.issn | 1017-1398 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/29251 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.relation.ispartof | Numerical Algorithms | - |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | On the choice of parameters in MAOR type splitting methods for the linear complementarity problem | - |
dc.type | Journal/Magazine Article | - |
dc.identifier.doi | 10.1007/s11075-014-9824-1 | - |
dc.identifier.scopus | 2-s2.0-84920990144 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=86935&source=BEOPEN&language=en | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84920990144 | - |
dc.relation.lastpage | 806 | - |
dc.relation.firstpage | 793 | - |
dc.relation.issue | 4 | - |
dc.relation.volume | 67 | - |
dc.identifier.externalcrisreference | (BISIS)86935 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-6384-1558 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
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.