Related papers: A new proof of an equality associated with submatr…
We extend to infinite dimensional separable Hilbert spaces the Schur convexity property of eigenvalues of a symmetric matrix with real entries. Our framework includes both the case of linear, selfadjoint, compact operators, and that of…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
There exist two major subclasses in the class of superquadratic functions, one comprises concave and decreasing functions, while the other consists of convex and monotone increasing functions. Leveraging this distinction, we introduce…
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 purpose of this paper is two-fold: we present some matrix inequalities of log-majorization type for eigenvalues indexed by a sequence; we then apply our main theorem to generalize and improve the Hua-Marcus' inequalities. Our results…
We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of abstracting the structural properties of logical systems: the…
We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…
A generalized eigenvector of a hypermatrix, called the universal (U-) eigenvector, is proposed, which extended the notion of diagonal (D-) eigenvectors in the literature. Using the semi-tensor product, the homogeneous U-eigenequation can be…
We convert a conjectured inequality from quantum information theory, due to He and Vidal, into a block matrix inequality and prove a special case. Given $n$ matrices $A_i$, $i=1,\ldots,n$, of the same size, let $Z_1$ and $Z_2$ be the block…
We construct explicit formulae for the eigenvalues of certain invariants of the Lie superalgebra gl(m|n) using characteristic identities. We discuss how such eigenvalues are related to reduced Wigner coefficients and the reduced matrix…
Let $G$ be a finite group and $(K,\mathcal{O},k)$ be a $p$-modular system "large enough". Let $R=\mathcal{O}$ or $k$. There is a bijection between the blocks of the group algebra $RG$ and the central primitive idempotents (the blocks) of…
The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…
The eigenvector-eigenvalue identities are expanded to include general mixing parameters. Some simple relations are obtained and they reveal an intricate texture of connections between the eigenvalues and the mixing parameters. Permutation…
This paper deals with eigenvalues and eigenvectors of bicomplex linear operators defined on bicomplex space. We investigate the properties of these operators in the context of eigenvalues and eigenvectors, along with some relevant theorems.…
Denton, Parke, Tao and Zhang gave a new method which determines eigenvectors from eigenvalues for Hermitian matrices with distinct eigenvalues. In this short note, we extend the above result to general Hermitian matrices.
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…
A short and elementary proof is given of a celebrated eigenvalue-perturbation result due to Alfred Brauer.
The exponential of an NxN matrix can always be expressed as a matrix polynomial of order N-1. In particular, a general group element for the fundamental representation of SU(N) can be expressed as a matrix polynomial of order N-1 in a…