(Difference between revisions)
 Revision as of 00:30, 15 September 2005 (view source)Zxaar (Talk | contribs)← Older edit Revision as of 00:42, 15 September 2005 (view source)Zxaar (Talk | contribs) Newer edit → Line 43: Line 43: :  return TRUE
:  return TRUE
---- ---- + + + === Reference === + #'''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"

## Contents

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 precondioning matrix constructued by matrix A

### Algorithm

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

r := b - A$\bullet$x
rtilde = r

for i := 1 step 1 until max_itr do
solve (M$\bullet$z = r )
solve (MT$\bullet$ztilde = rtilde )
rho_1 = z$\bullet$rtilde
if i = 1 then
p := z
ptilde := ztilde
else
beta = (rho_1/rho_2)
p = z + beta * p
ptilde = ztilde + beta * ptilde
end if
q := A$\bullet$p
qtilde := AT$\bullet$ptilde
alpha = rho_1 / (ptilde$\bullet$q)
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

### Reference

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"