AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (261.1 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

New error bound for linear complementarity problem of S- S D D S- B matrices

Lanlan LiuPan HanFeng Wang( )
College of Data Science and Information Engineering, Guizhou Minzu University, Guiyang, Guizhou 550025, China
Show Author Information

Abstract

S- S D D S- B matrices is a subclass of P-matrices which contains B-matrices. New error bound of the linear complementarity problem for S- S D D S- B matrices is presented, which improves the corresponding result in [1]. Numerical examples are given to verify the corresponding results.

CLC number: 15A48, 65G50, 90C31, 90C33

References

【1】
【1】
 
 
AIMS Mathematics
Pages 3239-3249

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Liu L, Han P, Wang F. New error bound for linear complementarity problem of S- S D D S- B matrices. AIMS Mathematics, 2022, 7(2): 3239-3249. https://doi.org/10.3934/math.2022179

0

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 26 July 2021
Accepted: 09 November 2021
Published: 15 February 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)