On the convergence behavior of IDR(s) and related methods

DOI10.1137/100789889zbMATH Open1261.65035OpenAlexW2162277158MaRDI QIDQ4903732FDOQ4903732

Authors: Peter Sonneveld 

Publication date: 24 January 2013

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:13328fa2-8ebb-4846-aa44-a6cefbd94560

Recommendations

• An enhancement of the convergence of the IDR method
• IDR explained
• A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
• IDR: a new generation of Krylov subspace methods?
• IDR(\(s\)): A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations

zbMATH Keywords

convergenceKrylov subspace methodsiterative methodsGMRES methodnonsymmetric linear systemsIDRBi-CGSTAB

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Cited In (6)

• IDR: a new generation of Krylov subspace methods?
• 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
• Iterative processes in the Krylov-Sonneveld subspaces

Uses Software

• BiCGstab

This page was built for publication: On the convergence behavior of IDR(\(s\)) and related methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903732)