ML(n)BiCGStab: reformulation, analysis and implementation
From MaRDI portal
Publication:4926679
DOI10.4208/NMTMA.2012.M1035zbMATH Open1274.65104arXiv1011.5314OpenAlexW2158032659MaRDI QIDQ4926679FDOQ4926679
Authors: M. C. Yeung
Publication date: 20 June 2013
Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)
Abstract: With the aid of index functions, we re-derive the ML(n)BiCGStab algorithm in a paper by Yeung and Chan in 1999 in a more systematic way. It turns out that there are n ways to define the ML(n)BiCGStab residual vector. Each definition will lead to a different ML(n)BiCGStab algorithm. We demonstrate this by presenting a second algorithm which requires less storage. In theory, this second algorithm serves as a bridge that connects the Lanczos-based BiCGStab and the Arnoldi-based FOM while ML(n)BiCG a bridge connecting BiCG and FOM. We also analyze the breakdown situations from the probabilistic point of view and summarize some useful properties of ML(n)BiCGStab. Implementation issues are also addressed.
Full work available at URL: https://arxiv.org/abs/1011.5314
Recommendations
Lanczosalgorithmiterative methodslinear systemsKrylov subspace methodfull orthogonalization method (FOM)Arnoldiconjugate gradients (CG)
Cited In (4)
This page was built for publication: ML(\(n\))BiCGStab: reformulation, analysis and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926679)