The aim of this study was to introduce a constructive method to compute a symplectic singular value decomposition (SVD-like decomposition) of a 2n-by-m rectangular real matrix A, based on symplectic refectors.This approach used a canonical Schur form of skew-symmetric matrix and it allowed us to compute eigenvalues for the structured matrices as Hamiltonian matrix JAA^T
AbstractWe obtain an explicit Iwasawa decomposition of the symplectic matrices, complex or real, in ...
1 The eigenproblem for complex J-symmetric matrices HC = A C D −AT, A, C = CT, D = DT ∈ Cn×n is cons...
SIGLELD:6184.6725(71) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
A matrix S is an element of C-2m x 2m is symplectic if S J S* = J, where J= [(0)(-Im) (Im)(0)]. Symp...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
We give a constructive argument to establish existence of a smooth singular value decomposition (SV...
AbstractWe prove a Hamiltonian/skew-Hamiltonian version of the classical theorem relating strict equ...
We shall consider a form of matrix factorization known as singular value decomposition (SVD) that is...
We present a new condensed form for a 2n × 2n symplectic matrix which can be computed by a...
In this paper we derive a new algorithm for constructing a unitary decomposition of a sequence of ma...
In this paper we derive a new algorithm for constructing a unitary decomposition of a sequence of ma...
Abstract. Recently Chu, Liu, and Mehrmann developed an structure preserving method for computing th...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
In this paper we consider the problem of solving a sequence of linear systems with coefficient matri...
AbstractWe obtain an explicit Iwasawa decomposition of the symplectic matrices, complex or real, in ...
1 The eigenproblem for complex J-symmetric matrices HC = A C D −AT, A, C = CT, D = DT ∈ Cn×n is cons...
SIGLELD:6184.6725(71) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
AbstractA matrix S∈C2m×2m is symplectic if SJS∗=J, whereJ=0Im−Im0.Symplectic matrices play an import...
A matrix S is an element of C-2m x 2m is symplectic if S J S* = J, where J= [(0)(-Im) (Im)(0)]. Symp...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
We give a constructive argument to establish existence of a smooth singular value decomposition (SV...
AbstractWe prove a Hamiltonian/skew-Hamiltonian version of the classical theorem relating strict equ...
We shall consider a form of matrix factorization known as singular value decomposition (SVD) that is...
We present a new condensed form for a 2n × 2n symplectic matrix which can be computed by a...
In this paper we derive a new algorithm for constructing a unitary decomposition of a sequence of ma...
In this paper we derive a new algorithm for constructing a unitary decomposition of a sequence of ma...
Abstract. Recently Chu, Liu, and Mehrmann developed an structure preserving method for computing th...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
In this paper we consider the problem of solving a sequence of linear systems with coefficient matri...
AbstractWe obtain an explicit Iwasawa decomposition of the symplectic matrices, complex or real, in ...
1 The eigenproblem for complex J-symmetric matrices HC = A C D −AT, A, C = CT, D = DT ∈ Cn×n is cons...
SIGLELD:6184.6725(71) / BLDSC - British Library Document Supply CentreGBUnited Kingdo