Eigenvalue computations based on IDR
DOI10.1137/100804012zbMATH Open1273.65055OpenAlexW4243014279MaRDI QIDQ2848612FDOQ2848612
Authors: Martin H. Gutknecht, Jens-Peter M. Zemke 
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c7620e829f8587ac8d8054f3b1b4263dd350830a
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
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Cited In (12)
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- A Hessenberg-type algorithm for computing PageRank problems
- IDR: a new generation of Krylov subspace methods?
- A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
- Nested Krylov Methods for Shifted Linear Systems
- Revisiting \((k,\ell)\)-step methods
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- Accelerating the induced dimension reduction method using spectral information
- Induced dimension reduction method to solve the quadratic eigenvalue problem
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)
