We analyze the s-step biconjugate gradient algorithm in nite precision arithmetic
and derive a bound for the residual norm in terms of a minimum polynomial of a perturbed matrix
multiplied by an amplication factor. Our bound enables comparison of s-step and classical biconju-
gate gradient in terms of amplication factors. Our results show that for s-step biconjugate gradient,
the amplication factor depends heavily on the quality of s-step polynomial bases generated in each outer loop.