Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be attacked directly, or they can rst be transformed to problems having some related structure, such as symplectic or skew Hamiltonian. In the interest of eciency, stability, and accuracy, such problems should be solved by methods that preserve the structure, whether it be Hamiltonian, skew Hamiltonian, or symplectic
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
. An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is present...
AbstractThe goal of solving an algebraic Riccati equation is to find the stable invariant subspace c...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lancz...
AbstractAn implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is ...
This work aims to present a structure-preserving block Lanczos-like method. The Lanczos-like algorit...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
We discuss a Krylov-Schur like restarting technique applied within the symplec-tic Lanczos algorithm...
Balancing a matrix by a simple and accurate similarity transformation can improve the speed and accu...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
Abstract Skew-Hamiltonian and Hamiltonian eigenvalue problems arise from a number of applications, p...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
AbstractBalancing a matrix by a simple and accurate similarity transformation can improve the speed ...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
. An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is present...
AbstractThe goal of solving an algebraic Riccati equation is to find the stable invariant subspace c...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lancz...
AbstractAn implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is ...
This work aims to present a structure-preserving block Lanczos-like method. The Lanczos-like algorit...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
We discuss a Krylov-Schur like restarting technique applied within the symplec-tic Lanczos algorithm...
Balancing a matrix by a simple and accurate similarity transformation can improve the speed and accu...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
Abstract Skew-Hamiltonian and Hamiltonian eigenvalue problems arise from a number of applications, p...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
AbstractBalancing a matrix by a simple and accurate similarity transformation can improve the speed ...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
. An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is present...
AbstractThe goal of solving an algebraic Riccati equation is to find the stable invariant subspace c...