AbstractWe prove that if a finite matrix A of the form [aIB0C]is such that its numerical range W(A) is a circular disc centered at a, then a must be an eigenvalue of C. As consequences, we obtain, for any finite matrix A, that (a) if ∂W(A) contains a circular arc, then the center of this circle is an eigenvalue of A with its geometric multiplicity strictly less than its algebraic multiplicity, and (b) if A is similar to a normal matrix, then ∂W(A) contains no circular arc
AbstractIf A and B are n×n nonsingular M-matrices, a lower bound on the smallest eigenvalue τ(A☆B) f...
AbstractWe define a new numerical range of an n×n complex matrix in terms of correlation matrices an...
AbstractWe present explicit formulae which allow us to construct elliptic matrices with zero diagona...
AbstractWe show that an n-by-n companion matrix A can have at most n line segments on the boundary ∂...
AbstractA characterization of real matrices is given for which a diagonal entry of a matrix is a bou...
AbstractGiven four complex matrices A,B,C and D, where A∈Cn×n and D∈Cm×m, and given a complex number...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractIn this paper, we prove the converse of a well known result in the field of the numerical ra...
AbstractFor any n-by-n complex matrix A, we use the joint numerical range W(A,A2,…,Ak) to study the ...
AbstractLet A be an n×n complex matrix and c=(c1,c2,…,cn) a real n-tuple. The c-numerical range of A...
Abstractor an n-by-n matrix A, its Crawford number c(A) (resp., generalized Crawford number C(A)) is...
In this article, tracial numerical ranges associated with matrices in an inde nite inner product sp...
AbstractLet A,C∈Mn, the algebra of n×n complex matrices. The set of complex numbersΔC(A)={det(A-UCU*...
AbstractMirsky proved that, for the existence of a complex matrix with given eigenvalues and diagona...
AbstractIn this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix nor...
AbstractIf A and B are n×n nonsingular M-matrices, a lower bound on the smallest eigenvalue τ(A☆B) f...
AbstractWe define a new numerical range of an n×n complex matrix in terms of correlation matrices an...
AbstractWe present explicit formulae which allow us to construct elliptic matrices with zero diagona...
AbstractWe show that an n-by-n companion matrix A can have at most n line segments on the boundary ∂...
AbstractA characterization of real matrices is given for which a diagonal entry of a matrix is a bou...
AbstractGiven four complex matrices A,B,C and D, where A∈Cn×n and D∈Cm×m, and given a complex number...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractIn this paper, we prove the converse of a well known result in the field of the numerical ra...
AbstractFor any n-by-n complex matrix A, we use the joint numerical range W(A,A2,…,Ak) to study the ...
AbstractLet A be an n×n complex matrix and c=(c1,c2,…,cn) a real n-tuple. The c-numerical range of A...
Abstractor an n-by-n matrix A, its Crawford number c(A) (resp., generalized Crawford number C(A)) is...
In this article, tracial numerical ranges associated with matrices in an inde nite inner product sp...
AbstractLet A,C∈Mn, the algebra of n×n complex matrices. The set of complex numbersΔC(A)={det(A-UCU*...
AbstractMirsky proved that, for the existence of a complex matrix with given eigenvalues and diagona...
AbstractIn this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix nor...
AbstractIf A and B are n×n nonsingular M-matrices, a lower bound on the smallest eigenvalue τ(A☆B) f...
AbstractWe define a new numerical range of an n×n complex matrix in terms of correlation matrices an...
AbstractWe present explicit formulae which allow us to construct elliptic matrices with zero diagona...