Displaying 241 – 260 of 270

Showing per page

The higher rank numerical range of nonnegative matrices

Aikaterini Aretaki, Ioannis Maroulas (2013)

Open Mathematics

In this article the rank-k numerical range ∧k (A) of an entrywise nonnegative matrix A is investigated. Extending the notion of elements of maximum modulus in ∧k (A), we examine their location on the complex plane. Further, an application of this theory to ∧k (L(λ)) of a Perron polynomial L(λ) is elaborated via its companion matrix C L.

The minimum, diagonal element of a positive matrix

M. Smyth, T. West (1998)

Studia Mathematica

Properties of the minimum diagonal element of a positive matrix are exploited to obtain new bounds on the eigenvalues thus exhibiting a spectral bias along the positive real axis familiar in Perron-Frobenius theory.

The P 0 -matrix completion problem.

Choi, Ji Young, DeAlba, Luz Maria, Hogben, Leslie, Maxwell, Mandi S., Wangsness, Amy (2002)

ELA. The Electronic Journal of Linear Algebra [electronic only]

The theory and applications of complex matrix scalings

Rajesh Pereira, Joanna Boneng (2014)

Special Matrices

We generalize the theory of positive diagonal scalings of real positive definite matrices to complex diagonal scalings of complex positive definite matrices. A matrix A is a diagonal scaling of a positive definite matrix M if there exists an invertible complex diagonal matrix D such that A = D*MD and where every row and every column of A sums to one. We look at some of the key properties of complex diagonal scalings and we conjecture that every n by n positive definite matrix has at most 2n−1 scalings...

Theorems of the alternative for cones and Lyapunov regularity of matrices

Bryan Cain, Daniel Hershkowitz, Hans Schneider (1997)

Czechoslovak Mathematical Journal

Standard facts about separating linear functionals will be used to determine how two cones C and D and their duals C * and D * may overlap. When T V W is linear and K V and D W are cones, these results will be applied to C = T ( K ) and D , giving a unified treatment of several theorems of the alternate which explain when C contains an interior point of D . The case when V = W is the space H of n × n Hermitian matrices, D is the n × n positive semidefinite matrices, and T ( X ) = A X + X * A yields new and known results about the existence of block diagonal...

Universal bounds for positive matrix semigroups

Leo Livshits, Gordon MacDonald, Laurent Marcoux, Heydar Radjavi (2016)

Studia Mathematica

We show that any compact semigroup of positive n × n matrices is similar (via a positive diagonal similarity) to a semigroup bounded by √n. We give examples to show this bound is best possible. We also consider the effect of additional conditions on the semigroup and obtain improved bounds in some cases.

Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices

Xiao-Dong Zhang, Rong Luo (2002)

Czechoslovak Mathematical Journal

We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.

Currently displaying 241 – 260 of 270