Generalizations of Nekrasov matrices and applications

In this paper we present a nonsingularity result which is a generalization of Nekrasov property by using two different permutations of the index set. The main motivation comes from the following observation: matrices that are Nekrasov matrices up to the same permutations of rows and columns, are nonsingular. But, testing all the permutations of the index set for the given matrix is too expensive. So, in some cases, our new nonsingularity criterion allows us to use the results already calculated in order to conclude that the given matrix is nonsingular. Also, we present new max-norm bounds for the inverse matrix and illustrate these results by numerical examples, comparing the results to some already known bounds for Nekrasov matrices