Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/29229
Pоljе DC-а | Vrеdnоst | Јеzik |
---|---|---|
dc.contributor.author | Cvetković Ljiljana | - |
dc.contributor.author | Kostić Vladimir | - |
dc.date.accessioned | 2020-12-14T16:28:17Z | - |
dc.date.available | 2020-12-14T16:28:17Z | - |
dc.date.issued | 2014 | - |
dc.identifier.issn | 1070-5325 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/29229 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/7486 | - |
dc.description.abstract | Modulus-based splitting, as well as multisplitting iteration methods, for linear complementarity problems are developed by Zhong-Zhi Bai. In related papers (see Bai, Z.-Z., Zhang, L.-L.: Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems. Numerical Linear Algebra with Applications 20 (2013) 425-439, and the references cited therein), the problem of convergence for two-parameter relaxation methods (accelerated overrelaxation-type methods) is analyzed under the assumption that one parameter is greater than the other. Here, we will show how we can avoid this assumption and, consequently, improve the convergence area. © 2013 John Wiley & Sons, Ltd. | - |
dc.language.iso | en | - |
dc.relation.ispartof | Numerical Linear Algebra with Applications | - |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | A note on the convergence of the MSMAOR method for linear complementarity problems | - |
dc.type | Journal/Magazine Article | - |
dc.identifier.doi | 10.1002/nla.1896 | - |
dc.identifier.scopus | 2-s2.0-84903934491 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=86901&source=BEOPEN&language=en | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84903934491 | - |
dc.relation.lastpage | 539 | - |
dc.relation.firstpage | 534 | - |
dc.relation.issue | 4 | - |
dc.relation.volume | 21 | - |
dc.identifier.externalcrisreference | (BISIS)86901 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
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 | - |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
SCOPUSTM
Nаvоđеnjа
21
prоvеrеnо 09.09.2023.
Prеglеd/i stаnicа
19
Prоtеklа nеdеljа
0
0
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.