Truncated QZ methods for large scale generalized eigenvalue problems
This paper presents three methods for the large scale generalized eigenvalue problem \(Ax= \lambda Bx\). The methods are developed within a Krylov subspace projection framework as truncations of the QZ-algorithm for dense problems. These techniques provide natural extensions of the implicitly restarted Arnoldi method and the truncated RQ method for large scale generalized eigenvalue problems. These two methods require the accurate solution of linear systems at each step of the iteration. A two-block method is developed that incorporates \(k\) approximate Newton corrections at each iteration. Computational experience is presented to compare the three new methods.
- Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
- An iterated shift-and-invert Arnoldi algorithm for cubic eigenvalue problems
- An extended QR-solver for large profiled matrices
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- A rational QZ method
- Implicitly restarted refined partially orthogonal projection method with deflation
- A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems
- A new algorithm for solving large-scale generalized eigenvalue problem based on projection methods
This page was built for publication: Truncated \(QZ\) methods for large scale generalized eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279542)