

{P1, P2}-Nekrasov matrices represent a generalization of Nekrasov matrices via permutations. In this paper, we obtained an error bound for linear complementarity problems for {P1, P2}-Nekrasov matrices. Numerical examples are given to illustrate that new error bound can give tighter results compared to already known bounds when applied to Nekrasov matrices. Also, we presented new max-norm bounds for the inverse of {P1, P2}-Nekrasov matrices in the block case, considering two different types of block generalizations. Numerical examples show that new norm bounds for the block case can give tighter results compared to already known bounds for the point-wise case. © 2021, University of Nis. All rights reserved.
| Funding sponsor | Funding number | Acronym |
|---|---|---|
| Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja | 174019 | MPNTR |
2010 Mathematics Subject Classification. 15A18; 15B99 Keywords. Nekrasov matrices, Permutations, Maximum norm bounds, Linear complementarity problems. Received: 15 February 2020; Revised: 15 July 2020; Accepted: 23 October 2020 Communicated by Marko Petković Research partly supported by the Ministry of Education, Science and Technological Development of Serbia, grant 174019. Email addresses: [email protected] (M. Nedović), [email protected] (Lj. Cvetković)
© Copyright 2021 Elsevier B.V., All rights reserved.