Related papers: Symplectic eigenvalues of positive-semidefinite ma…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix $A$. Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to…
This paper is devoted to the asymptotic behavior of all eigenvalues of Symmetric (in general non Hermitian) Toeplitz matrices with moderately smooth symbols which trace out a simple loop on the complex plane line as the dimension of the…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
We prove that given four arbitrary quaternion numbers of norm 1 there always exists a $2\times 2$ symplectic matrix for which those numbers are left eigenvalues. The proof is constructive. An application to the LS category of Lie groups is…
We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of…
We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…
In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…
Symmetrizable matrices are those which are symmetric when multiplied by a diagonal matrix with positive entries. The Cauchy interlace theorem states that the eigenvalues of a real symmetric matrix interlace with those of any principal…
This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…
We provide a countable set of conditions based on elementary symmetric polynomials that are necessary and sufficient for a trace class integral operator to be positive semidefinite, which is an important cornerstone for quantum theory in…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.
It is a classical result of Wigner that for an hermitian matrix with independent entries on and above the diagonal, the mean empirical eigenvalue distribution converges weakly to the semicircle law as matrix size tends to infinity. In this…
A comprehensive approach to the spectrum characterization (derivation of eigenvalues and the corresponding multiplicities) for non-normalized, symmetric discrete trigonometric transforms (DTT) is presented in the paper. Eight types of the…
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…
In this paper we present systematically analysis on the smallest eigenvalue of matrices associated with completely even functions (mod $r$). We obtain several theorems on the asymptotic behavior of the smallest eigenvalue of matrices…
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…