Related papers: Nonnegative Eigenvectors of Symmetric Matrices

A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…

We show that the metric operator for a pseudo-supersymmetric Hamiltonian that has at least one negative real eigenvalue is necessarily indefinite. We introduce pseudo-Hermitian fermion (phermion) and abnormal phermion algebras and provide a…

This paper studies the set of $n\times n$ matrices for which all row and column sums equal zero. By representing these matrices in a lower dimensional space, it is shown that this set is closed under addition and multiplication, and…

Let $x$ and $y$ be positive $n$-vectors. We show that there exists a $2n\times 2n$ positive definite real matrix whose symplectic spectrum is $y,$ and the symplectic spectrum of whose diagonal is $x$ if and only if $x$ is weakly…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

We show in this article that if a holomorphic vector bundle has a nonnegative Hermitian metric in the sense of Bott and Chern, which always exists on globally generated holomorphic vector bundles, then some special linear combinations of…

A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…

We show that if $G=(V,E)$ is a 4-connected flat graph, then any real symmetric $V\times V$ matrix $M$ with exactly one negative eigenvalue and satisfying, for any two distinct vertices $i$ and $j$, $M_{ij}<0$ if $i$ and $j$ are adjacent,…

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…

It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.

In this article we consider products of real random matrices with fixed size. Let $A_1,A_2, \dots $ be i.i.d $k \times k$ real matrices, whose entries are independent and identically distributed from probability measure $\mu$. Let $X_n =…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

In this paper we present an elementary theory about the existence of eigenvalues for fully nonlinear radially symmetric 1-homogeneous operators. A general theory for first eigenvalues and eigenfunctions of 1-homogeneous fully nonlinear…

I propose a proof of the existence of the existence of eigenvectors and eigenvalues in the spirit of Argand's proof of the fundamental theorem of algebra. The proof only relies on Weierstrass's theorem, the definition of the inverse of a…

This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…

This paper suggests an algebraic version of the theorem on the existence of eigenvectors for linear operators in abstract idempotent spaces. Earlier, the theorem on the existence of eigenvectors was only known for the cases of a free…

We show that any symmetric positive definite homogeneous matrix polynomial $M\in\R[x_1,...,x_n]^{m\times m}$ admits a piecewise semi-certificate, i.e. a collection of identites $M(x)=\sum_jf_{i,j}(x)U_{i,j}(x)^TU_{i,j}(x)$ where…

Hermitian positive definite, totally positive, and nonsingular M-matrices enjoy many common properties, in particular: (A) positivity of all principal minors, (B) weak sign symmetry, (C) eigenvalue monotonicity, (D) positive stability. The…

The symmetric nonnegative inverse eigenvalue problem (SNIEP) asks which sets of numbers (counting multiplicities) can be the eigenvalues of a symmetric matrix with nonnegative entries. While examples of such matrices are abundant in linear…