Related papers: Left eigenvalues of $2\times 2$ symplectic matrice…

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…

Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…

In this note, we consider arbitrary finite-dimensional real algebras containing a copy of complex numbers. It is proved that matrices with entries from an arbitrary finite-dimensional real algebra containing a square root of negative one in…

Particular class of skew orthogonal polynomials are introduced and investigated, which possess Laurent symmetry. They are also shown to appear as eigenfunctions of symplectic generalized eigenvalue problems. The modification of these…

We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating…

For a family of $n*n$ left triangular matrices with binary entries we derive asymptotically exact (as $n\to\infty$) representation for the complete eigenvalues-eigenvectors problem. In particular we show that the dependence of all…

We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…

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…

In this article, we use results of Number Theory to prove the conjecture on eigenvalue problem of a 2D elliptic PDE proposed by P. Korman in his recent paper \cite{ref}: for any even integer $2k$, one can find an eigenvalue $N$ that can be…

In this article, we obtain some results in the direction of ``infinite dimensional symplectic spectral theory". We prove an inequality between the eigenvalues and symplectic eigenvalues of a special class of infinite dimensional operators.…

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

Eigenvalue spectrum of the Laplacian on a metric graph with arbitrary but fixed vertex conditions is investigated in the limit as the lengths of all edges decrease to zero at the same rate. It is proved that there are exactly four possible…

We discuss the eigenvalue problem for 2x2 and 3x3 octonionic Hermitian matrices. In both cases, we give the general solution for real eigenvalues, and we show there are also solutions with non-real eigenvalues.

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…

This work provides a quaternioinc reprsentation for real symplectic matrices in dimension four, analogous to the pair of unit quaternions representation for special orthogonal matrices. In the process of finding formulae for this…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…

When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…