CFD Online Logo CFD Online URL
Home > Wiki > Biconjugate gradient method

Biconjugate gradient method

From CFD-Wiki

Jump to: navigation, search


Biconjugate gradient method

Biconjugate gradient method could be summarized as follows

System of equation

For the given system of equation
Ax = b ;
b = source vector
x = solution variable for which we seek the solution
A = coefficient matrix

M = the preconditioning matrix constructed by matrix A


Allocate temperary vectors r,z,p,q, rtilde,ztilde,qtilde
Allocate temerary reals rho_1, rho_2 , alpha, beta

r := b - A\cdotx
rtilde := r

for i := 1 step 1 until max_itr do
solve (M\cdotz = r )
solve (MT\cdotztilde = rtilde )
rho_1 := z\cdotrtilde
if i = 1 then
p := z
ptilde := ztilde
beta := (rho_1/rho_2)
p := z + beta * p
ptilde := ztilde + beta * ptilde
end if
q := A\cdotp
qtilde := AT\cdotptilde
alpha := rho_1 / (ptilde\cdotq)
x := x + alpha * p
r := r - alpha * q
rtilde := rtilde - alpha * qtilde
rho_2 := rho_1
end (i-loop)

deallocate all temp memory
return TRUE


  1. Richard Barret, Michael Berry, Tony F. Chan, James Demmel, June M. Donato, Jack Dongarra, Victor Eijihout, Roldan Pozo, Charles Romine, Henk Van der Vorst, "Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods", Philadelphia, PA: SIAM, 1994. |

Return to Numerical Methods

My wiki