A new method is presented for the numerical computation of the generalized eigen- values of real Hamiltonian or symplectic pencils and matrices. The method is strongly backward stable, i.e., it is numerically backward stable and preserves the structure (i.e., Hamiltonian or symplectic). In the case of a Hamiltonian matrix the method is closely related to the square reduced method of Van Loan, but in contrast to that method which may suffer from a loss of accuracy of order sqrt(epsilon), where epsilon is the machine precision, the new method computes the eigenvalues to full possible accuracy
A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lancz...
A new MATLAB toolbox for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamil...
AbstractWe discuss some aspects of the recently proposed symplectic butterfly form which is a conden...
A new method is presented for the numerical computation of the generalized eigen- values of real Ham...
AbstractThis paper presents an algorithm for computing the eigenvalues of a symplectic pencil that a...
Working title was “Numerical Computation of Deflating Subspaces of Embedded Hamiltonian and Symplect...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
AbstractA fast method for computing all the eigenvalues of a Hamiltonian matrix M is given. The meth...
Abstract. Various applications give rise to eigenvalue problems for which the matrices are Hamiltoni...
Various applications give rise to eigenvalue problems for which the matrices are Hamiltonian or skew...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
In this paper we solve a long-standing open problem in numerical analysis called 'Van Loan's Curse'....
Abstract. We discuss the numerical solution of structured generalized eigenvalue problems that arise...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lancz...
A new MATLAB toolbox for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamil...
AbstractWe discuss some aspects of the recently proposed symplectic butterfly form which is a conden...
A new method is presented for the numerical computation of the generalized eigen- values of real Ham...
AbstractThis paper presents an algorithm for computing the eigenvalues of a symplectic pencil that a...
Working title was “Numerical Computation of Deflating Subspaces of Embedded Hamiltonian and Symplect...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
AbstractA fast method for computing all the eigenvalues of a Hamiltonian matrix M is given. The meth...
Abstract. Various applications give rise to eigenvalue problems for which the matrices are Hamiltoni...
Various applications give rise to eigenvalue problems for which the matrices are Hamiltonian or skew...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
In this paper we solve a long-standing open problem in numerical analysis called 'Van Loan's Curse'....
Abstract. We discuss the numerical solution of structured generalized eigenvalue problems that arise...
AbstractA new backward stable, structure preserving method of complexity O(n3) is presented for comp...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lancz...
A new MATLAB toolbox for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamil...
AbstractWe discuss some aspects of the recently proposed symplectic butterfly form which is a conden...