modif de LSQR qui fonctionne quand meme mieux (un poil moins rapide que CGLS quand...

[GMRES2stage.git] / code / ex29.c

diff --git a/code/ex29.c b/code/ex29.c
index 5e21c65b386f6c654ad382198ecf76891fa9250f..ede23559af1f7c1b3857d7b638259ae9ee7f9878 100644 (file)
--- a/code/ex29.c
+++ b/code/ex29.c
@@ -1,6 +1,6 @@
 
 
-//  /home/couturie/work/petsc-3.5.1/arch-linux2-c-debug/bin/mpirun -np 3 ex29 -da_grid_x 900 -da_grid_y 900
+//  /home/couturie/work/petsc-3.5.1/arch-linux2-c-debug/bin/mpirun -np 3 ex29 -da_grid_x 900 -da_grid_y 900 -ksp_type fgmres
 
 
 
@@ -240,7 +240,7 @@ int KrylovMinimizeLSQR(Mat A, Vec b, Vec x) {
 
   PetscScalar  alpha, beta;
   PetscReal norm=20, Eprecision=1e-5, tol=1e-40;     
-  PetscInt giter=0, ColS=12, col=0, Emaxiter=50000000, iter=0, iterations=15, Iiter=0;
+  PetscInt giter=0, ColS=12, col=0, Emaxiter=50000000, iter=0, iterations=20, Iiter=0;
   PetscErrorCode ierr;
   PetscScalar T1, T2;
   KSP ksp;
@@ -428,13 +428,6 @@ int KrylovMinimizeLSQR(Mat A, Vec b, Vec x) {
         VecAYPX(d,1/rho,zero_short);     //d=d/ rho;
 
 
-        if (normar/(norma*normr) <= tol) { // check for convergence in min{|b-A*x|}
-          break;
-        }
-        if (normr <= tolb) {           // check for convergence in A*x=b
-          break;
-        }
-
 
         VecAXPY(x_lsqr,phi,d);     // x_lsqr=x_lsqr+phi*d
         normr = abs(s) * normr;