相关论文: On symmetries of a matrix and its isospectral redu…
Isospectral reduction is an important tool for network/matrix analysis as it reduces the dimension of a matrix/network while preserving its eigenvalues and eigenvectors. The main contribution of this manuscript is a proposed algorithmic…
The isospectral reduction of matrix, which is closely related to its Schur complement, allows to reduce the size of a matrix while maintaining its eigenvalues up to a known set. Here we generalize this procedure by increasing the number of…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
This note deals with a simultaneous approximation of several matrices by a finite family of diagonalizable matrices satisfying an additional condition for the spectrum of a matrix product. That is the simplicity of all eigenvalues.
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
Via the process of isospectral graph reduction the adjacency matrix of a graph can be reduced to a smaller matrix while its spectrum is preserved up to some known set. It is then possible to estimate the spectrum of the original matrix by…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
In our article we consider some algebraical methods which may be useful in some inverse spectral problems. The reconstraction of the matrix from its minors is considered.
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…
These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.
We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
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…
The inverse eigenvalue problem for real symmetric matrices of the form 0 0 0 . 0 0 * 0 0 0 . 0 * * 0 0 0 . * * 0 . . . . . . . 0 0 * . 0 0 0 0 * * . 0 0 0 * * 0 . 0 0 0 is solved. The solution is shown to be unique. The problem is also…