Biconjugate gradient stabilized method
From CFDWiki
(Difference between revisions)
(replact \bullet by \cdot denoting a dot product) 
m (→System of equation: typos corrected) 

Line 8:  Line 8:  
A = coefficient matrix <br>  A = coefficient matrix <br>  
  M = the  +  M = the preconditioning matrix constructed by matrix A <br> 
  +  
=== Algorithm ===  === Algorithm === 
Revision as of 18:02, 28 July 2006
Contents 
Biconjugate gradient stabilized method
Biconjugate gradient stabilized 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
Algorithm
 Allocate temperary vectors p, phat, s, shat, t, v, rtilde
 Allocate temerary reals rho_1, rho_2 , alpha, beta, omega

 r := b  Ax
 rtilde = r

 for i := 1 step 1 until max_itr do
 rho_1 = rtilder
 if i = 1 then p := r else
 beta = (rho_1/rho_2) * (alpha/omega)
 p = r + beta * (p  omega * v)
 beta = (rho_1/rho_2) * (alpha/omega)
 end if
 solve (Mphat = p )
 v = Aphat
 alpha = rho_1 / (rtildev)
 s = r  alpha * v
 solve (Mshat = s )
 t = A * shat;
 omega = (ts) / (tt)
 x = x + alpha * phat + omega * shat
 r = s  omega * t
 rho_2 = rho_1
 rho_1 = rtilder
 end (iloop)

 deallocate all temp memory
 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"
Return to Numerical Methods