A variant of IDRstab with reliable update strategies for solving sparse linear systems. The IDRStab method is often more effective than the IDR(s) method and the BiCGstab(ℓ) method for solving large nonsymmetric linear systems. IDRStab can have a large so-called residual gap: the convergence of recursively computed residual norms does not coincide with that of explicitly computed residual norms because of the influence of rounding errors. We therefore propose an alternative recursion formula for updating the residuals to narrow the residual gap. The formula requires extra matrix-vector multiplications, but we reduce total computational costs by giving an alternative implementation which reduces the number of vector updates. Numerical experiments show that the alternative recursion formula reliably reduces the residual gap, and that our proposed variant of IDRStab is effective for sparse linear systems.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Neuenhofen, Martin P.; Greif, Chen: Mstab: stabilized induced dimension reduction for Krylov subspace recycling (2018)
- Aihara, Kensuke: Variants of the groupwise update strategy for short-recurrence Krylov subspace methods (2017)
- Aihara, Kensuke; Abe, Kuniyoshi; Ishiwata, Emiko: A variant of IDRstab with reliable update strategies for solving sparse linear systems (2014)
- Aihara, Kensuke; Abe, Kuniyoshi; Ishiwata, Emiko: A quasi-minimal residual variant of IDRstab using the residual smoothing technique (2014)
- Saito, Shusaku; Tadano, Hiroto; Imakura, Akira: Development of the block BiCGSTAB((\ell)) method for solving linear systems with multiple right hand sides (2014)