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, have been extended to the case of symplectic eigenvalues. In this note, we will generalize Williamson's diagonal form for symmetric positive-definite matrices to the case of symmetric positive-semidefinite matrices, which allows us to define symplectic eigenvalues, and prove the trace minimization theorem in the new setting
Abstract. A complete characterization is obtained of the 2 × 2 symplectic matrices that have an infi...
AbstractWe give a minimum principle for Schur complements of positive definite Hermitian matrices. F...
F. A matrix A is called positive definite if all of its eigenval-ric systems can be transformed into...
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Willi...
We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenv...
For every $2n \times 2n$ positive definite matrix $A$ there are $n$ positive numbers $d_1(A) \leq \l...
We prove that the product of a symmetric positive semide nite matrix and a symmetric matrix has all ...
Associated with every $2n\times 2n$ real positive definite matrix $A,$ there exist $n$ positive numb...
We consider Hamiltonian matrices obtained by means of symmetric and positive definite matrices and a...
AbstractThere is an interesting relation between the angle that a matrix forms with the identity and...
This paper discusses topics in the symmetrized max-plus algebra. In this study, it will be shown the...
AbstractIn this paper, the trace minimization method for the generalized symmetric eigenvalue proble...
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
AbstractThe question of whether a real matrix is symmetrizable via multiplication by a diagonal matr...
. We prove results concerning the interlacing of eigenvalues of principal submatrices of strictly to...
Abstract. A complete characterization is obtained of the 2 × 2 symplectic matrices that have an infi...
AbstractWe give a minimum principle for Schur complements of positive definite Hermitian matrices. F...
F. A matrix A is called positive definite if all of its eigenval-ric systems can be transformed into...
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Willi...
We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenv...
For every $2n \times 2n$ positive definite matrix $A$ there are $n$ positive numbers $d_1(A) \leq \l...
We prove that the product of a symmetric positive semide nite matrix and a symmetric matrix has all ...
Associated with every $2n\times 2n$ real positive definite matrix $A,$ there exist $n$ positive numb...
We consider Hamiltonian matrices obtained by means of symmetric and positive definite matrices and a...
AbstractThere is an interesting relation between the angle that a matrix forms with the identity and...
This paper discusses topics in the symmetrized max-plus algebra. In this study, it will be shown the...
AbstractIn this paper, the trace minimization method for the generalized symmetric eigenvalue proble...
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
AbstractThe question of whether a real matrix is symmetrizable via multiplication by a diagonal matr...
. We prove results concerning the interlacing of eigenvalues of principal submatrices of strictly to...
Abstract. A complete characterization is obtained of the 2 × 2 symplectic matrices that have an infi...
AbstractWe give a minimum principle for Schur complements of positive definite Hermitian matrices. F...
F. A matrix A is called positive definite if all of its eigenval-ric systems can be transformed into...