Add to ORKGTridiagonal matrices are considered which are totally nonnegative, i.e., all their minors are nonnegative. The largest amount is given by which the single entries of such a matrix can be perturbed without losing the property of total nonnegativity
In this paper we present a linear time algorithm for checking whether a tridiagonal matrix will beco...
AbstractIn this paper, nonsingular totally nonpositive matrices are studied and new characterization...
AbstractAn m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Had...
A real matrix is called totally nonnegative if all its minors are nonnnegative. In this paper the mi...
Abstract. A well-known property of anM-matrix is that its inverse is elementwise nonnegative, which ...
Tridiagonal matrices arise in a large variety of applications. Most of the time they are diagonally ...
AbstractA well-known property of an M-matrix M is that the inverse is element-wise non-negative, whi...
AbstractAn m-by-n matrix A is said to be totally nonnegative if every minor of A is nonnegative. Our...
AbstractCriteria are given for the controllability of certain pairs of tridiagonal matrices. These c...
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper the ...
We derive new perturbation bounds for eigenvalues of Hermitian matrices with block tridiagonal struc...
Several relative condition numbers that exploit tridiagonal form are derived. Some of them use tridi...
Abstract. Totally nonnegative matrices, i.e., matrices having all minors nonnegative, are con-sidere...
For a class of positive matrices A + K with a stable positive nominal part A and a structured positi...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
In this paper we present a linear time algorithm for checking whether a tridiagonal matrix will beco...
AbstractIn this paper, nonsingular totally nonpositive matrices are studied and new characterization...
AbstractAn m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Had...
A real matrix is called totally nonnegative if all its minors are nonnnegative. In this paper the mi...
Abstract. A well-known property of anM-matrix is that its inverse is elementwise nonnegative, which ...
Tridiagonal matrices arise in a large variety of applications. Most of the time they are diagonally ...
AbstractA well-known property of an M-matrix M is that the inverse is element-wise non-negative, whi...
AbstractAn m-by-n matrix A is said to be totally nonnegative if every minor of A is nonnegative. Our...
AbstractCriteria are given for the controllability of certain pairs of tridiagonal matrices. These c...
A real matrix is called totally nonnegative if all of its minors are nonnegative. In this paper the ...
We derive new perturbation bounds for eigenvalues of Hermitian matrices with block tridiagonal struc...
Several relative condition numbers that exploit tridiagonal form are derived. Some of them use tridi...
Abstract. Totally nonnegative matrices, i.e., matrices having all minors nonnegative, are con-sidere...
For a class of positive matrices A + K with a stable positive nominal part A and a structured positi...
AbstractLet A be a real n × n matrix. A is TP (totally positive) if all the minors of A are nonnegat...
In this paper we present a linear time algorithm for checking whether a tridiagonal matrix will beco...
AbstractIn this paper, nonsingular totally nonpositive matrices are studied and new characterization...
AbstractAn m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Had...