A study of the s-step biconjugate gradient method
In this thesis we will examine how to solve linear systems using the s-step biconjugate gradient algorithm, which is an iterative method based on the Krylov subspaces. It is useful especially when we have a large and sparse matrix. We begin looking over the biconjugate gradient algorithm (BiCG), in order to understand how to construct the s-step BiCG algorithm. We will go through some numerical ex