Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
From MaRDI portal
Recommendations
Cited in
(13)- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices
- Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations
- Arnoldi-Riccati method for large eigenvalue problems
- A refined subspace iteration algorithm for large sparse eigenproblems
- Solution of the eigenvalue problems resulting from global non-parallel flow stability analysis
- Efficient preconditioner updates for unsymmetric shifted linear systems
- Algorithm 776: SRRIT
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
- An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
- A neutral stability curve for incompressible flows in a rectangular driven cavity
- A key to choose subspace size in implicitly restarted Arnoldi method
This page was built for publication: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371533)