peer reviewedBrualdi brought to Geršgorin Theory the concept that the digraph G(A) of a matrix A is important in studying whether A is singular. He proved, for example, that if, for every directed cycle of G(A), the product of the diagonal entries exceeds the product of the row sums of the moduli of the off-diagonal entries, then the matrix is nonsingular. We will show how, in polynomial time, that condition can be tested and (if satisfied) produce a diagonal matrix D, with positive diagonal entries, such that AD (where A is any nonnnegative matrix satisfying the conditions) is strictly diagonally dominant (and so, A is nonsingular). The same D works for all matrices satisfying the conditions. Varga raised the question of whether Brualdi’s ...
AbstractWe investigate classes of real square matrices possessing some weakened from of strict diago...
AbstractA square real matrix A is called a strong sign nonsingular matrix (or S2NS matrix) if all th...
AbstractA square real matrix A is called a strong sign nonsingular matrix (S2NS matrix) if all the m...
AbstractBrualdi brought to Geršgorin Theory the concept that the digraph G(A) of a matrix A is impor...
Brualdi brought to Geršgorin Theory the concept that the digraph G(A) of a matrix A is important in...
AbstractLet A=(Aij)Ni,j=1∈Cn×n be a block irreducible matrix with nonsingular diagonal blocks, v=(vi...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
Abstract—We present various “additive ” sufficient conditions for the nonsingularity of a complex pa...
AbstractWe develop some basic properties of finite diagonally dominant matrices. These properties ar...
AbstractWe present two criteria for nonsingularity of matrices over general fields. The first applie...
AbstractLet G be a graph without loops and multiple edges. If V(G) = (V[in1]), V2, …, vn, we define ...
AbstractA square real matrix A called a strong sign nonsingular matrix (or “S2NS” matrix) if all mat...
AbstractWith respect to a tridiagonal matrix with variable diagonal vector g, an orthant is said to ...
The original version of Cramer’s rule [on determinants] relies on the hypothesis that in a matrix eq...
AbstractWe investigate classes of real square matrices possessing some weakened from of strict diago...
AbstractA square real matrix A is called a strong sign nonsingular matrix (or S2NS matrix) if all th...
AbstractA square real matrix A is called a strong sign nonsingular matrix (S2NS matrix) if all the m...
AbstractBrualdi brought to Geršgorin Theory the concept that the digraph G(A) of a matrix A is impor...
Brualdi brought to Geršgorin Theory the concept that the digraph G(A) of a matrix A is important in...
AbstractLet A=(Aij)Ni,j=1∈Cn×n be a block irreducible matrix with nonsingular diagonal blocks, v=(vi...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
Abstract—We present various “additive ” sufficient conditions for the nonsingularity of a complex pa...
AbstractWe develop some basic properties of finite diagonally dominant matrices. These properties ar...
AbstractWe present two criteria for nonsingularity of matrices over general fields. The first applie...
AbstractLet G be a graph without loops and multiple edges. If V(G) = (V[in1]), V2, …, vn, we define ...
AbstractA square real matrix A called a strong sign nonsingular matrix (or “S2NS” matrix) if all mat...
AbstractWith respect to a tridiagonal matrix with variable diagonal vector g, an orthant is said to ...
The original version of Cramer’s rule [on determinants] relies on the hypothesis that in a matrix eq...
AbstractWe investigate classes of real square matrices possessing some weakened from of strict diago...
AbstractA square real matrix A is called a strong sign nonsingular matrix (or S2NS matrix) if all th...
AbstractA square real matrix A is called a strong sign nonsingular matrix (S2NS matrix) if all the m...