AbstractIn this paper we analyze the positive (sign-symmetric) P-matrix completion problem when the pattern of the partial matrix is non-symmetric. We prove that every positive (sign-symmetric) partial P-matrix A has a positive (sign-symmetric) P-matrix completion when the associated graph of the specified entries of A, GA, is acyclic and we study special cases when GA is not acyclic
An $n\times m$ matrix is called an $N$-matrix if all principal minors are negative. In this paper, w...
An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this...
AbstractIn this paper we are interested in the controllability completion problem when some assumpti...
AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...
In this paper it is shown that a partial sign symmetric P-matrix, whose digraph of specified entries...
AbstractAn n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, non...
An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...
AbstractA pattern is a list of positions in an n×n real matrix. A matrix completion problem for the ...
AbstractA P-matrix is a real square matrix having every principal minor positive, and a Fischer matr...
An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...
AbstractA list of positions in an n×n real matrix (a pattern) is said to have P-completion if every ...
An n-by-n real matrix is called a P-matrix if all its principal minors are positive. The P-matrix co...
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of...
In this paper the P0-matrix completion problem is considered. It is established that every asymmetri...
AbstractAn n×n matrix is called an N-matrix if all its principal minors are negative. In this paper,...
An $n\times m$ matrix is called an $N$-matrix if all principal minors are negative. In this paper, w...
An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this...
AbstractIn this paper we are interested in the controllability completion problem when some assumpti...
AbstractAn n×n matrix is called an N-matrix if all principal minors are negative. In this paper, we ...
In this paper it is shown that a partial sign symmetric P-matrix, whose digraph of specified entries...
AbstractAn n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, non...
An $n \times n$ matrix is called an $N$--matrix if all principal minors are negative. In this paper...
AbstractA pattern is a list of positions in an n×n real matrix. A matrix completion problem for the ...
AbstractA P-matrix is a real square matrix having every principal minor positive, and a Fischer matr...
An $n\times n$ matrix is called an $N$-matrix if all its principal minors are negative. In this pap...
AbstractA list of positions in an n×n real matrix (a pattern) is said to have P-completion if every ...
An n-by-n real matrix is called a P-matrix if all its principal minors are positive. The P-matrix co...
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of...
In this paper the P0-matrix completion problem is considered. It is established that every asymmetri...
AbstractAn n×n matrix is called an N-matrix if all its principal minors are negative. In this paper,...
An $n\times m$ matrix is called an $N$-matrix if all principal minors are negative. In this paper, w...
An $n\times n$ matrix is called an $N_0$-matrix if all its principal minors are nonpositive. In this...
AbstractIn this paper we are interested in the controllability completion problem when some assumpti...