AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian Hessenberg form and the symplectic matrices that can be reduced to symplectic Hessenberg form by orthogonal symplectic similarity transformations. The reduction to these special Hessenberg forms is the missing link in the solution of the open problem of constructing a stable structure-preserving QR-like method of complexity O(n3) for the computation of invariant subspaces of Hamiltonian and symplectic matrices. Our considerations lead us to propose an approach to the computation of Lagrangian invariant subspaces of a Hamiltonian or symplectic matrix
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
We study canonical forms for Hamiltonian and symplectic matrices or pencils under equivalence tran...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
© 2016, Springer-Verlag Italia. A unitary symplectic similarity transformation for a special class o...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
AbstractSymplectic QR-like methods use symplectic or unitary symplectic similarity transformations i...
AbstractA fast method for computing all the eigenvalues of a Hamiltonian matrix M is given. The meth...
AbstractThe algebraic Riccati equation can be solved by finding a certain invariant subspace of a re...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractLie-algebraic generalizations of Hessenberg matrices are considered. We address the question...
[[abstract]]This paper presents algorithms far computing stable Lagrangian invariant subspaces of a ...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
We study canonical forms for Hamiltonian and symplectic matrices or pencils under equivalence tran...
AbstractCharacterizations are given for the Hamiltonian matrices that can be reduced to Hamiltonian ...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
A unitary symplectic similarity transformation for certain Hamiltonian matrices to extended Hamilton...
© 2016, Springer-Verlag Italia. A unitary symplectic similarity transformation for a special class o...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
AbstractSymplectic QR-like methods use symplectic or unitary symplectic similarity transformations i...
AbstractA fast method for computing all the eigenvalues of a Hamiltonian matrix M is given. The meth...
AbstractThe algebraic Riccati equation can be solved by finding a certain invariant subspace of a re...
AbstractA Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplect...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractLie-algebraic generalizations of Hessenberg matrices are considered. We address the question...
[[abstract]]This paper presents algorithms far computing stable Lagrangian invariant subspaces of a ...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
We study canonical forms for Hamiltonian and symplectic matrices or pencils under equivalence tran...