ML(n)BiCGStab:重新表述、分析与实现
ML(n)BiCGStab: Reformulation, Analysis and Implementation
AI总结:
本文通过索引函数系统重新推导ML(n)BiCGStab算法,提出一种存储需求更少的变体,并分析了其与Lanczos型BiCGStab和Arnoldi型FOM的联系,以及从概率角度分析算法中断情况。
摘要:
借助索引函数,我们以更系统的方式重新推导了Yeung和Chan在1999年论文中的ML(n)BiCGStab算法。结果表明,定义ML(n)BiCGStab残差向量有n种方式,每种定义都会产生不同的ML(n)BiCGStab算法。我们通过提出第二种算法来证明这一点,该算法需要更少的存储空间。理论上,第二种算法作为连接基于Lanczos的BiCGStab和基于Arnoldi的FOM的桥梁,而ML(n)BiCG则是连接BiCG和FOM的桥梁。我们还从概率角度分析了中断情况,并总结了ML(n)BiCGStab的一些有用性质。同时讨论了实现问题。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。