Related papers: Eigenvalues and Singular Values of Dual Quaternion…

We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…

We explore the concept of eigenvalue avoidance, which is well understood for real symmetric and Hermitian matrices, for other classes of structured matrices. We adopt a differential geometric perspective and study the generic behaviour of…

Characterizing the $6\times 6$ complex Hadamard matrices (CHMs) is an open problem in linear algebra and quantum information. In this paper, we investigate the eigenvalues and eigenvectors of CHMs. We show that any $n\times n$ CHM with…

We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…

A proposal for the matrix model formulation of the M-theory on a space with a boundary is given. A general machinery for modding out a symmetry in M(atrix) theory is used for a Z_2 symmetry changing the sign of the X_1 coordinate. The…

Harary and Schwenk posed the problem forty years ago: Which graphs have distinct adjacency eigenvalues? In this paper, we obtain a necessary and sufficient condition for an Hermitian matrix with simple spectral radius and distinct…

In noncommutative and nondivision algebra, left spectrum of matrices are less known and is not easy to handle. Split quaternion algebra is a noncommutative and nondivision algebra. In this paper, by the formulas of solving the equations…

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…

We consider a new class of non-Hermitian random matrices, namely the ones which have the form of sums of freely independent terms involving unitary matrices. To deal with them, we exploit the recently developed quaternion technique. After…

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

Sylvester's law of inertia states that the number of positive, negative and zero eigenvalues of Hermitian matrices is preserved under congruence transformations. The same is true of generalized Hermitian definite eigenvalue problems, in…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…

We put forward and prove a simple theorem stating that the eigenvalues of a tridiagonal matrix change their sign (as a set), once the signs of the diagonal elements of the matrix are changed. We also provide an example of application of…

The symmetry study of main differential equations of mechanics and electrodynamics has shown, that differential equations, which are invariant under transformations of groups, which are symmetry groups of mathematical numbers (considered…

We prove quadratic eigenvalue perturbation bounds for generalized Hermitian eigenvalue problems. The bounds are proportional to the square of the norm of the perturbation matrices divided by the gap between the spectrums. Using the results…

In this paper, we consider the problem of reconstructing an $n \times n$ cell matrix $D(\vec{x})$ constructed from a vector $\vec{x} = (x_{1}, x_{2},\dots, x_{n})$ of positive real numbers, from a given set of spectral data. In addition, we…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…