We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian symmetry. We propose to solve such problems by applying a Krylov-Schur-type method based on the symplectic Lanczos process to a structured linearization of the quadratic matrix polynomial. In order to compute interior eigenvalues, we propose several shift-and-invert operators with Hamiltonian structure. Our approach is tested for several examples from structural analysis and gyroscopic systems
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
[[abstract]]Numerical methods for the solution of large scale structured quadratic eigenvalue proble...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
AbstractWe consider solving eigenvalue problems or model reduction problems for a quadratic matrix p...
We discuss the numerical solution of eigenvalue problems for matrix polynomials, where the coefficie...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
The SHIRA method of Mehrmann and Watkins belongs among the structure preserving Krylov subspace meth...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
[[abstract]]Numerical methods for the solution of large scale structured quadratic eigenvalue proble...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
AbstractWe consider solving eigenvalue problems or model reduction problems for a quadratic matrix p...
We discuss the numerical solution of eigenvalue problems for matrix polynomials, where the coefficie...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
The SHIRA method of Mehrmann and Watkins belongs among the structure preserving Krylov subspace meth...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of H...