Related papers: On Simultaneous Symplectic Diagonalization in the …
In this paper, we provide an algebraic condition on any $2n \times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix in the sense of Williamson's…
Williamson's theorem states that if $A$ is a $2n \times 2n$ real symmetric positive definite matrix then there exists a $2n \times 2n$ real symplectic matrix $M$ such that $M^T A M=D \oplus D$, where $D$ is an $n \times n$ diagonal matrix…
It is shown that a $N\times N$ real symmetric [complex hermitian] positive definite matrix $V$ is congruent to a diagonal matrix modulo a pseudo-orthogonal [pseudo-unitary] matrix in $SO(m,n)$ [ $SU(m,n)$], for any choice of partition…
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, are extended to the case of…
Williamson's theorem states that for any $2n \times 2n$ real positive definite matrix $A$, there exists a $2n \times 2n$ real symplectic matrix $S$ such that $S^TAS=D \oplus D$, where $D$ is an $n\times n$ diagonal matrix with positive…
Given a real-valued positive semidefinite matrix, Williamson proved that it can be diagonalised using symplectic matrices. The corresponding diagonal values are known as the symplectic spectrum. This paper is concerned with the stability of…
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…
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…
We establish necessary and sufficient conditions on simultaneous symplectic spectral decomposition of a family of $2n \times 2n$ real positive semidefinite matrices with symplectic kernels. We also provide a precise algebraic condition on a…
It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. In the case of non-commuting matrices, the best that can be achieved is simultaneous block diagonalization. Here we…
It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…
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…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
Symmetrizable matrices are those which are symmetric when multiplied by a diagonal matrix with positive entries. The Cauchy interlace theorem states that the eigenvalues of a real symmetric matrix interlace with those of any principal…
This article studies canonical forms derived from the finest simultaneous block diagonalization of a set of symmetric matrices via congruence. Our technique relies on Harrison's center theory, which is extended from a single higher degree…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
If $A$ is a $2n \times 2n$ real positive definite matrix, then there exists a symplectic matrix $M$ such that $M^TAM = \left [ \begin{array}{cc} D & O \\ O & D \end{array} \right ]$ where $D= \diag (d_1 (A), \ldots, d_n(A))$ is a diagonal…
An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of…