Ontology type: schema:ScholarlyArticle
2021-10-23
AUTHORSJia-Lin Zhang, Guo-Feng Zhang, Zhao-Zheng Liang
ABSTRACTIn this paper, we propose a preconditioned general two-step modulus-based accelerated overrelaxation (MAOR) iteration method for solving a class of nonlinear complementarity problems. The convergence analysis and the condition of the iterative parameters are given when the system matrix is either positive definite or an H+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_{+}$$\end{document}-matrix. Numerical examples further illustrate that the proposed method is efficient and has better performance than some existing modulus-based iteration methods in aspects of the number of iteration steps and CPU time. More... »
PAGES227-255
http://scigraph.springernature.com/pub.10.1007/s13160-021-00486-8
DOIhttp://dx.doi.org/10.1007/s13160-021-00486-8
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1142099138
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Numerical and Computational Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China",
"id": "http://www.grid.ac/institutes/grid.32566.34",
"name": [
"School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China"
],
"type": "Organization"
},
"familyName": "Zhang",
"givenName": "Jia-Lin",
"id": "sg:person.012131475460.43",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012131475460.43"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China",
"id": "http://www.grid.ac/institutes/grid.32566.34",
"name": [
"School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China"
],
"type": "Organization"
},
"familyName": "Zhang",
"givenName": "Guo-Feng",
"id": "sg:person.015025302151.50",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015025302151.50"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China",
"id": "http://www.grid.ac/institutes/grid.32566.34",
"name": [
"School of Mathematics and Statistics, Lanzhou University of China, 730000, Lanzhou, People\u2019s Republic of China"
],
"type": "Organization"
},
"familyName": "Liang",
"givenName": "Zhao-Zheng",
"id": "sg:person.012037400151.51",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012037400151.51"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/s11075-018-0477-3",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1100651092",
"https://doi.org/10.1007/s11075-018-0477-3"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf01268170",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1017224378",
"https://doi.org/10.1007/bf01268170"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s11075-010-9416-7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1023147531",
"https://doi.org/10.1007/s11075-010-9416-7"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s11075-016-0112-0",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1032751459",
"https://doi.org/10.1007/s11075-016-0112-0"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s11075-012-9566-x",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1007152545",
"https://doi.org/10.1007/s11075-012-9566-x"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/bf01582255",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1032689642",
"https://doi.org/10.1007/bf01582255"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s40314-018-0646-y",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1104016722",
"https://doi.org/10.1007/s40314-018-0646-y"
],
"type": "CreativeWork"
}
],
"datePublished": "2021-10-23",
"datePublishedReg": "2021-10-23",
"description": "In this paper, we propose a preconditioned general two-step modulus-based accelerated overrelaxation (MAOR) iteration method for solving a class of nonlinear complementarity problems. The convergence analysis and the condition of the iterative parameters are given when the system matrix is either positive definite or an H+\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$$H_{+}$$\\end{document}-matrix. Numerical examples further illustrate that the proposed method is efficient and has better performance than some existing modulus-based iteration methods in aspects of the number of iteration steps and CPU time.",
"genre": "article",
"id": "sg:pub.10.1007/s13160-021-00486-8",
"inLanguage": "en",
"isAccessibleForFree": false,
"isFundedItemOf": [
{
"id": "sg:grant.8892344",
"type": "MonetaryGrant"
},
{
"id": "sg:grant.8132322",
"type": "MonetaryGrant"
}
],
"isPartOf": [
{
"id": "sg:journal.1041814",
"issn": [
"0916-7005",
"1868-937X"
],
"name": "Japan Journal of Industrial and Applied Mathematics",
"publisher": "Springer Nature",
"type": "Periodical"
},
{
"issueNumber": "1",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "39"
}
],
"keywords": [
"nonlinear complementarity problem",
"iteration method",
"complementarity problem",
"modulus-based iteration method",
"convergence analysis",
"system matrix",
"iterative parameters",
"numerical examples",
"iteration step",
"CPU time",
"problem",
"matrix",
"better performance",
"class",
"parameters",
"number",
"performance",
"conditions",
"step",
"analysis",
"time",
"aspects",
"method",
"example",
"paper"
],
"name": "A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems",
"pagination": "227-255",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1142099138"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s13160-021-00486-8"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s13160-021-00486-8",
"https://app.dimensions.ai/details/publication/pub.1142099138"
],
"sdDataset": "articles",
"sdDatePublished": "2022-05-20T07:39",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_898.jsonl",
"type": "ScholarlyArticle",
"url": "https://doi.org/10.1007/s13160-021-00486-8"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s13160-021-00486-8'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s13160-021-00486-8'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s13160-021-00486-8'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s13160-021-00486-8'
This table displays all metadata directly associated to this object as RDF triples.
129 TRIPLES
22 PREDICATES
57 URIs
42 LITERALS
6 BLANK NODES