Eigenvalue Computations Based on IDR

DOI10.1137/100804012zbMath1273.65055OpenAlexW4243014279MaRDI QIDQ2848612

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

zbMATH Keywords

iterative methodinduced dimension reductionKrylov space methodlarge nonsymmetric eigenvalue problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items

Nested Krylov Methods for Shifted Linear Systems ⋮ IDR: a new generation of Krylov subspace methods? ⋮ Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems ⋮ IDR(\(s\)) for solving shifted nonsymmetric linear systems ⋮ A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices ⋮ A variant of the IDR\((s)\) method with the quasi-minimal residual strategy ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ ML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transpose ⋮ Accelerating the induced dimension reduction method using spectral information ⋮ Revisiting \((k,\ell)\)-step methods ⋮ Induced Dimension Reduction Method to Solve the Quadratic Eigenvalue Problem ⋮ A Hessenberg-type algorithm for computing PageRank problems