ML(n)BiCGStab: Reformulation, Analysis and Implementation

Details ML(n)BiCGStab: Reformulation, Analysis and Implementation ML(n)BiCGStab: Reformulation, Analysis and Implementation

2010-11-24

arxiv.org/abs/1011.5314v1

Mathematics

Numerical Analysis

This paper is dedicated to the memory of Prof. Gene Golub. Most part of the paper was presented in Gene Golub Memorial Confere

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

ML(n)BiCGStab: Reformulation, Analysis and Implementation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with ML(n)BiCGStab: Reformulation, Analysis and Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ML(n)BiCGStab: Reformulation, Analysis and Implementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240577