A restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. Breakdowns and near-breakdowns are overcome by inexpensive implicit restarts. The method is used to compute eigenvalues, eigenvectors and invariant subspaces of large and sparse Hamiltonian matrices and low rank approximations to the solution of continuous-time algebraic Riccati equations with large and sparse coecient matrices
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
Available from British Library Document Supply Centre- DSC:DXN065210 / BLDSC - British Library Docum...
[[abstract]]We present a fast method for computing the closed-loop eigenvalues of a discrete-time al...
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 ...
. An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is present...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
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 ...
Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be ...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
This work aims to present a structure-preserving block Lanczos-like method. The Lanczos-like algorit...
AbstractThe goal of solving an algebraic Riccati equation is to find the stable invariant subspace c...
[[abstract]]The goal of solving an algebraic Riccati equation is to find the stable invariant subspa...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
Available from British Library Document Supply Centre- DSC:DXN065210 / BLDSC - British Library Docum...
[[abstract]]We present a fast method for computing the closed-loop eigenvalues of a discrete-time al...
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 ...
. An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is present...
AbstractWe discuss a Krylov–Schur like restarting technique applied within the symplectic Lanczos al...
AbstractLarge sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems ...
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 ...
Large sparse Hamiltonian eigenvalue problems arise in a variety of contexts. These problems can be ...
We discuss a Krylov-Schur like restarting technique applied within the symplectic Lanczos algorithm ...
This work aims to present a structure-preserving block Lanczos-like method. The Lanczos-like algorit...
AbstractThe goal of solving an algebraic Riccati equation is to find the stable invariant subspace c...
[[abstract]]The goal of solving an algebraic Riccati equation is to find the stable invariant subspa...
Includes bibliographical references (p. 70-74)We are interested in computing eigenvalues and eigenve...
Available from British Library Document Supply Centre- DSC:DXN065210 / BLDSC - British Library Docum...
[[abstract]]We present a fast method for computing the closed-loop eigenvalues of a discrete-time al...