We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we focus on Hamiltonian symmetry, that is, the spectrum is symmetric with respect to the real and imaginary axes. After briefly discussing quadratic eigenproblems with Hamiltonian spectra we review structured Krylov subspace methods to aprroximate parts of the spectrum of Hamiltonian operators. We will discuss the optimization of the free parameters in the resulting symplectic Lanczos process in order to minimize the conditioning of the (non-orthonormal) Lanczos basis. The effects of our findings are demonstrated for several numerical examples
Large-scale eigenvalue problems arise in a number of DOE applications. This paper provides an overv...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
AbstractIn this paper we propose a general approach by which eigenvalues with a special property of ...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian ...
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...
Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be ...
Given a large square real matrix A and a rectangular tall matrix Q, many application problems requi...
AbstractWe consider solving eigenvalue problems or model reduction problems for a quadratic matrix p...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
We introduce a novel variant of the Lanczos method for computing a few eigenvalues of sparse and/or ...
An algorithm for constructing a \(J\)-orthogonal basis of the extended Krylov subspace \(\mathcal{K...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
Large-scale eigenvalue problems arise in a number of DOE applications. This paper provides an overv...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
AbstractIn this paper we propose a general approach by which eigenvalues with a special property of ...
We consider large and sparse eigenproblems where the spectrum exhibits special symmetries. Here we ...
Abstract. We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Ha...
We consider the numerical solution of quadratic eigenproblems with spectra that exhibit Hamiltonian ...
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...
Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be ...
Given a large square real matrix A and a rectangular tall matrix Q, many application problems requi...
AbstractWe consider solving eigenvalue problems or model reduction problems for a quadratic matrix p...
We consider solving eigenvalue problems or model reduction problems for a quadratic matrix polynomia...
We introduce a novel variant of the Lanczos method for computing a few eigenvalues of sparse and/or ...
An algorithm for constructing a \(J\)-orthogonal basis of the extended Krylov subspace \(\mathcal{K...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
Large-scale eigenvalue problems arise in a number of DOE applications. This paper provides an overv...
AbstractWe develop Jacobi algorithms for solving the complete eigenproblem for Hamiltonian and skew-...
AbstractIn this paper we propose a general approach by which eigenvalues with a special property of ...