Related papers: Eigenvalues, singular values, and the O'Shea-Sjama…
We obtain several norm and eigenvalue inequalities for positive matrices partitioned into four blocks. The results involve the numerical range of the off-diagonal block X, especially the distance from 0 to W(X).
An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real…
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 the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
We study the differential and metric structures of the set of real square roots of a non-singular real matrix, under the assumption that the matrix and its square roots are semi-simple, or symmetric, or orthogonal.
The paper presents a new theory of unfolding of eigenvalue surfaces of real symmetric and Hermitian matrices due to an arbitrary complex perturbation near a diabolic point. General asymptotic formulae describing deformations of a conical…
A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument…
It is known that a matrix polynomial with unitary matrix coefficients has its eigenvalues in the annular region $\frac{1}{2} < |\lambda| < 2$. We prove in this short note that under certain assumptions, matrix polynomials with either doubly…
We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…
In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region \Omega, within the complex plane. More precisely, we consider three types of regions and their intersections:…
Equiangular Algorithm generates a set of equiangular normalized vectors with given angle {\theta} using a set of linearly independence vectors in a real inner product space, which span the same subspaces. The outcome of EA on column vectors…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We investigate eigenvalue attraction for open quantum systems, biophysical systems, and for Parity-Time symmetric materials. To determine whether an eigenvalue and its complex conjugate of a real matrix attract, we derive expressions for…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
We study the eigenspace of the Laplacian matrix of a simple graph corresponding to the largest eigenvalue, subsequently arriving at the theory of modular decomposition of T. Gallai.
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
Two sets of mutually commuting $q-$difference operators $x_i$ and $y_j$, $i,j=1, ...,N$ such that $x_i$ and $y_i$ generate a homomorphic image of the $q-$Onsager algebra for each $i$ are introduced. The common polynomial eigenfunctions of…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…