Related papers: Hermitian matrices with a bounded number of eigenv…
The problem of estimating the smallest singular value of random square matrices is important in connection with matrix computations and analysis of the spectral distribution. In this survey, we consider recent developments in the study of…
We study Hermitian unitary matrices $\mathcal{S}\in\mathbb{C}^{n,n}$ with the following property: There exist $r\geq0$ and $t>0$ such that the entries of $\mathcal{S}$ satisfy $|\mathcal{S}_{jj}|=r$ and $|\mathcal{S}_{jk}|=t$ for all…
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…
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…
We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ…
We study the space of Lie algebras equipped with left-invariant complex structures, $\mathcal{L}_{ J_{\tiny{\mbox{cn}}} }(\mathbb{R}^{2n}) $, with particular attention to their degenerations and deformations. To this end, we identify…
An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…
The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…
Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…
In this paper, we consider the iterated trimming complex associated to data yielding a complex of length $3$. We compute an explicit algebra structure in this complex in terms of the algebra structures of the associated input data.…
A family of non-Hermitian but ${\cal PT}-$symmetric $2J$ by $2J$ toy-model tridiagonal-matrix Hamiltonians $H^{(2J)}=H^{(2J)}(t)$ with $J=K+M=1,2,\ldots$ and $t<J^2$ is studied, for which a real but non-Hermitian $2K$ by $2K$…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…
Freudenthal triple systems come in two flavors, degenerate and nondegenerate. The best criterion for distinguishing between the two which is available in the literature is by descent. We provide an identity which is satisfied only by…
We equip the complex polynomial algebra C[t] with the involution which is the identity on C and sends t to -t. Answering a question raised by V.G. Kac, we show that every hermitian or skew-hermitian matrix over this algebra is congruent to…
Let $\mathbb{H}$ be the real quaternion algebra and $\mathbb{H}^{m\times n}$ denote the set of all $m\times n$ matrices over $\mathbb{H}$. Let $\mathbf{i},\mathbf{j},\mathbf{k}$ be the imaginary quaternion units. For…
We find a minimal set of generators for the coordinate ring of Calogero-Moser space $\mathcal{C}_3$ and the algebraic relations among them explicitly. We give a new presentation for the algebra of $3\times3$ invariant matrices involving the…
We present an iteration for the computation of simple eigenvalues using a pseudospectrum approach. The most appealing characteristic of the proposed iteration is that it reduces the computation of a single eigenvalue to a small number of…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…