New error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices (Q521916): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1606.06838 / rank
 
Normal rank

Revision as of 14:48, 18 April 2024

scientific article
Language Label Description Also known as
English
New error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices
scientific article

    Statements

    New error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices (English)
    0 references
    0 references
    0 references
    0 references
    12 April 2017
    0 references
    The subject of the article is on new error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices. Their applications show that these new error bounds are better respectively than those provided by \textit{M. García-Esnaola} and \textit{J. M. Peña} [Numer. Algorithms 67, No. 3, 655--667 (2014; Zbl 1338.90406); ibid. 72, No. 2, 435--445 (2016; Zbl 1342.90205)] in some cases. This article is well written, structured and explained, it contains three sections: Section 1 on Introduction, Section 2 on Error bounds for linear complementarity problems of Nekrasov matrices, and Section 3 on Error bounds for linear problems of \(B\)-Nekrasov matrices. In fact, future scientific work on the drawbacks of the suggested new error bounds.
    0 references
    error bounds
    0 references
    linear complementarity problem
    0 references
    Nekrasov matrices
    0 references
    \(B\)-Nekrasov matrices
    0 references
    \(P\)-matrices
    0 references

    Identifiers