Eigenvalue computations based on IDR
From MaRDI portal
Publication:2848612
Recommendations
- IDR: a new generation of Krylov subspace methods?
- IDR explained
- Accelerating the induced dimension reduction method using spectral information
- Algorithm 913: An elegant \(\mathrm{IDR}(s)\) variant that efficiently exploits biorthogonality properties
- IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
Cited in
(12)- Revisiting \((k,\ell)\)-step methods
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- Induced dimension reduction method to solve the quadratic eigenvalue problem
- Nested Krylov Methods for Shifted Linear Systems
- A Hessenberg-type algorithm for computing PageRank problems
- Accelerating the induced dimension reduction method using spectral information
- A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
- IDR: a new generation of Krylov subspace methods?
This page was built for publication: Eigenvalue computations based on IDR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848612)