AbstractA complex matrix A is ray-nonsingular if det(X ∘ A) ≠ 0 for every matrix X with positive entries. A sufficient condition for ray nonsingularity is that the origin is not in the relative interior of the convex hull of the signed transversal products of A. The concept of an isolated set of transversals is defined and used to obtain a necessary condition for A to be ray-nonsingular. Some fundamental similarities as well as differences between ray nonsingularity and sign nonsingularity are illustrated
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractWe use previous results on complementary basic matrices to introduce a rather wide class of ...
AbstractAn m×n matrix A is sign regular if, for each k (1⩽k⩽min{m,n}), all k×k submatrices of A have...
AbstractA complex matrix A is ray-nonsingular if det(X ∘ A) ≠ 0 for every matrix X with positive ent...
AbstractA complex matrix A is ray-nonsingular if det(X∘A)≠0 for every matrix X with positive entries...
AbstractRay nonsingular matrices are generalizations of sign nonsingular matrices. The problem of ch...
AbstractA ray-nonsingular matrix is a square complex matrix, A, such that each complex matrix whose ...
AbstractA description is given of those ray-patterns, which will be called inverse closed ray-nonsin...
A ray–nonsingular matrix is a square complex matrix, A, such that each complex matrix whose entries ...
AbstractRay nonsingular (RNS) matrices are a generalization of sign nonsingular (SNS) matrices from ...
A matrix is called a ray pattern matrix if its entries are either 0 or a ray in complex plane which ...
AbstractA ray pattern is a matrix each of whose entries is either 0 or a ray in the complex plane or...
AbstractA new nonsingularity criterion for an n × n real matrix A based on sign distribution and som...
AbstractA ray pattern is a matrix each of whose entries is either 0 or a ray in the complex plane or...
AbstractThis paper studies the determinantal regions SA of complex sign pattern matrices and the det...
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractWe use previous results on complementary basic matrices to introduce a rather wide class of ...
AbstractAn m×n matrix A is sign regular if, for each k (1⩽k⩽min{m,n}), all k×k submatrices of A have...
AbstractA complex matrix A is ray-nonsingular if det(X ∘ A) ≠ 0 for every matrix X with positive ent...
AbstractA complex matrix A is ray-nonsingular if det(X∘A)≠0 for every matrix X with positive entries...
AbstractRay nonsingular matrices are generalizations of sign nonsingular matrices. The problem of ch...
AbstractA ray-nonsingular matrix is a square complex matrix, A, such that each complex matrix whose ...
AbstractA description is given of those ray-patterns, which will be called inverse closed ray-nonsin...
A ray–nonsingular matrix is a square complex matrix, A, such that each complex matrix whose entries ...
AbstractRay nonsingular (RNS) matrices are a generalization of sign nonsingular (SNS) matrices from ...
A matrix is called a ray pattern matrix if its entries are either 0 or a ray in complex plane which ...
AbstractA ray pattern is a matrix each of whose entries is either 0 or a ray in the complex plane or...
AbstractA new nonsingularity criterion for an n × n real matrix A based on sign distribution and som...
AbstractA ray pattern is a matrix each of whose entries is either 0 or a ray in the complex plane or...
AbstractThis paper studies the determinantal regions SA of complex sign pattern matrices and the det...
AbstractRay solvable linear systems and ray S2NS matrices are complex generalizations of the sign so...
AbstractWe use previous results on complementary basic matrices to introduce a rather wide class of ...
AbstractAn m×n matrix A is sign regular if, for each k (1⩽k⩽min{m,n}), all k×k submatrices of A have...