Related papers: On complex eigenvalues of a real nonsymmetric matr…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…
A counter-example to lower bounds for the singular values of the sum of two matrices in [1] and [2] is given. Correct forms of the bounds are pointed out.
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…
For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…
Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…
Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
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…
An $n\times n$ matrix $C$ is said to be {\it centrosymmetric} if it satisfies the relation $JCJ=C$, where $J$ is the $n\times n$ counteridentity matrix. Centrosymmetric matrices have a rich eigenstructure that has been studied extensively…
We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…
We consider the correlation functions of eigenvalues of a unidimensional chain of large random hermitian matrices. An asymptotic expression of the orthogonal polynomials allows to find new results for the correlations of eigenvalues of…
We investigate the product of $n$ complex non-Hermitian, independent random matrices, each of size $N\times N$ in the class of elliptic matrices, with independent identically distributed entries. The joint probability distribution of the…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…