Bridge++  Ver. 1.2.x
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
solver_BiCGStab.cpp
Go to the documentation of this file.
1 
14 #include "solver_BiCGStab.h"
15 
16 
17 #ifdef USE_FACTORY
18 namespace {
19  Solver *create_object(Fopr *fopr)
20  {
21  return new Solver_BiCGStab(fopr);
22  }
23 
24 
25  bool init = Solver::Factory::Register("BiCGStab", create_object);
26 }
27 #endif
28 
29 //- parameter entries
30 namespace {
31  void append_entry(Parameters& param)
32  {
33  param.Register_int("maximum_number_of_iteration", 0);
34  param.Register_double("convergence_criterion_squared", 0.0);
35 
36  param.Register_string("verbose_level", "NULL");
37  }
38 
39 
40 #ifdef USE_PARAMETERS_FACTORY
41  bool init_param = ParametersFactory::Register("Solver.BiCGStab", append_entry);
42 #endif
43 }
44 //- end
45 
46 //- parameters class
48 //- end
49 
50 const std::string Solver_BiCGStab::class_name = "Solver_BiCGStab";
51 
52 //====================================================================
54 {
55  const string str_vlevel = params.get_string("verbose_level");
56 
57  m_vl = vout.set_verbose_level(str_vlevel);
58 
59  //- fetch and check input parameters
60  int Niter;
61  double Stop_cond;
62 
63  int err = 0;
64  err += params.fetch_int("maximum_number_of_iteration", Niter);
65  err += params.fetch_double("convergence_criterion_squared", Stop_cond);
66 
67  if (err) {
68  vout.crucial(m_vl, "%s: fetch error, input parameter not found.\n", class_name.c_str());
69  abort();
70  }
71 
72 
73  set_parameters(Niter, Stop_cond);
74 }
75 
76 
77 //====================================================================
78 void Solver_BiCGStab::set_parameters(const int Niter, const double Stop_cond)
79 {
81 
82  //- print input parameters
83  vout.general(m_vl, "%s: input parameters\n", class_name.c_str());
84  vout.general(m_vl, " Niter = %d\n", Niter);
85  vout.general(m_vl, " Stop_cond = %16.8e\n", Stop_cond);
86 
87  //- range check
88  int err = 0;
89  err += ParameterCheck::non_negative(Niter);
90  err += ParameterCheck::square_non_zero(Stop_cond);
91 
92  if (err) {
93  vout.crucial(m_vl, "%s: parameter range check failed.\n", class_name.c_str());
94  abort();
95  }
96 
97  //- store values
98  m_Niter = Niter;
99  m_Stop_cond = Stop_cond;
100 }
101 
102 
103 //====================================================================
104 void Solver_BiCGStab::solve(Field& xq, const Field& b,
105  int& Nconv, double& diff)
106 {
107  //#pragma omp parallel
108  {
109  double bnorm2 = b.norm2();
110  double snorm = 1.0 / bnorm2;
111  int bsize = b.size();
112 
115 
116 #pragma omp master
117  {
118  vout.paranoiac(m_vl, "%s: solver starts\n", class_name.c_str());
119  vout.paranoiac(m_vl, " norm of b = %16.8e\n", bnorm2);
120  vout.paranoiac(m_vl, " size of b = %d\n", bsize);
121  }
122 #pragma omp barrier
123 
124 
125  reset_field(b);
126 
127  copy(s, b); // s = b;
128 
129  double rr;
130  int Nconv2 = -1;
131 
132  solve_init(b, rr);
133 
134  bool is_converged = false;
135 
136 #pragma omp master
137  vout.detailed(m_vl, " iter: %8d %22.15e\n", 0, rr * snorm);
138 #pragma omp barrier
139 
140 
141  for (int iter = 0; iter < m_Niter; iter++) {
142  if (!is_converged) {
143  solve_step(rr);
144 
145 #pragma omp master
146  vout.detailed(m_vl, " iter: %8d %22.15e\n", 2 * (iter + 1), rr * snorm);
147 #pragma omp barrier
148 
149  if (rr * snorm < m_Stop_cond) {
150  m_fopr->mult(s, x); // s = m_fopr->mult(x);
151  axpy(s, -1.0, b); // s -= b;
152 
153  double diff2 = s.norm2();
155 
157  if (ith == 0) vout.detailed(m_vl, " iter0: %8d %22.15e\n", nth, diff2 * snorm);
158 
159  if (diff2 * snorm < m_Stop_cond) {
160  Nconv2 = 2 * (iter + 1);
161 
162  // break;
163  is_converged = true;
164  }
165 
166  copy(s, x); // s = x;
167  solve_init(b, rr);
168 
170  if (ith == 0) vout.detailed(m_vl, " iter1: %8d %22.15e\n", nth, rr * snorm);
171  }
172  }
173  }
174  if (Nconv2 == -1) {
175 #pragma omp master
176  vout.crucial(m_vl, "%s: not converged.\n", class_name.c_str());
177 #pragma omp barrier
178  abort();
179  }
180 
181  m_fopr->mult(p, x); // p = m_fopr->mult(x);
182  axpy(p, -1.0, b); // p -= b;
183 
184  copy(xq, x); // xq = x;
185 
186  double diff2 = p.norm2();
187 
188 #pragma omp master
189  {
190  diff = sqrt(diff2);
191  Nconv = Nconv2;
192  }
193 #pragma omp barrier
194  } // end of parallel region
195 }
196 
197 
198 //====================================================================
200 {
201 #pragma omp master
202  {
203  int Nin = b.nin();
204  int Nvol = b.nvol();
205  int Nex = b.nex();
206 
207  if ((s.nin() != Nin) || (s.nvol() != Nvol) || (s.nex() != Nex)) {
208  s.reset(Nin, Nvol, Nex);
209  r.reset(Nin, Nvol, Nex);
210  x.reset(Nin, Nvol, Nex);
211  p.reset(Nin, Nvol, Nex);
212  v.reset(Nin, Nvol, Nex);
213  t.reset(Nin, Nvol, Nex);
214  rh.reset(Nin, Nvol, Nex);
215 
216  vout.detailed(m_vl, " %s: field size reset.\n", class_name.c_str());
217  }
218  }
219 #pragma omp barrier
220 }
221 
222 
223 //====================================================================
224 void Solver_BiCGStab::solve_init(const Field& b, double& rr)
225 {
226  copy(x, s); // x = s;
227 
228  //- r = b - A x_0
229  m_fopr->mult(v, s); // v = m_fopr->mult(s);
230  copy(r, b); // r = b;
231  axpy(r, -1.0, v); // r -= v;
232  copy(rh, r); // rh = r;
233 
234  rr = r.norm2(); // rr = r * r;
235 
236  p.set(0.0); // p = 0.0
237  v.set(0.0); // v = 0.0
238 
239 #pragma omp master
240  {
241  rho_prev = 1.0;
242  alpha_prev = 1.0;
243  omega_prev = 1.0;
244  }
245 #pragma omp barrier
246 }
247 
248 
249 //====================================================================
251 {
252  double rho = dot(rh, r); // double rho = rh * r;
253  double bet = rho * alpha_prev / (rho_prev * omega_prev);
254 
255  // p = r + bet * (p - omega_prev * v);
256  axpy(p, -omega_prev, v); // p += - omega_prev * v;
257  aypx(bet, p, r); // p = bet * p + r;
258 
259  m_fopr->mult(v, p); // v = m_fopr->mult(p);
260 
261  double aden = dot(rh, v); // dcomplex aden = rh * v;
262  double alpha = rho / aden;
263 
264  copy(s, r); // s = r
265  axpy(s, -alpha, v); // s += - alpha * v;
266 
267  m_fopr->mult(t, s); // t = m_fopr->mult(s);
268 
269  double omega_d = dot(t, t); // omega_d = t * t;
270  double omega_n = dot(t, s); // omega_n = t * s;
271  double omega = omega_n / omega_d;
272 
273  axpy(x, omega, s); // x += omega * s;
274  axpy(x, alpha, p); // x += alpha * p;
275 
276  copy(r, s); // r = s
277  axpy(r, -omega, t); // r += - omega * t;
278 
279  rr = r.norm2(); // rr = r * r;
280 
281 #pragma omp master
282  {
283  rho_prev = rho;
284  alpha_prev = alpha;
285  omega_prev = omega;
286  }
287 #pragma omp barrier
288 }
289 
290 
291 //====================================================================
292 //============================================================END=====
BridgeIO vout
Definition: bridgeIO.cpp:207
void detailed(const char *format,...)
Definition: bridgeIO.cpp:50
static int get_num_threads()
returns available number of threads.
void Register_string(const string &, const string &)
Definition: parameters.cpp:352
double norm2() const
Definition: field.cpp:469
void solve(Field &solution, const Field &source, int &Nconv, double &diff)
void set(const int jin, const int site, const int jex, double v)
Definition: field.h:128
double dot(const Field &y, const Field &x)
Definition: field.cpp:46
virtual const Field mult(const Field &)=0
multiplies fermion operator to a given field and returns the resultant field.
void general(const char *format,...)
Definition: bridgeIO.cpp:38
void Register_int(const string &, const int)
Definition: parameters.cpp:331
Container of Field-type object.
Definition: field.h:37
int nvol() const
Definition: field.h:101
void set_parameters(const Parameters &params)
Class for parameters.
Definition: parameters.h:40
void copy(Field &y, const Field &x)
copy(y, x): y = x
Definition: field.cpp:409
void solve_init(const Field &, double &)
static int get_thread_id()
returns thread id.
int square_non_zero(const double v)
Definition: checker.cpp:41
int nin() const
Definition: field.h:100
void reset(const int Nin, const int Nvol, const int Nex, const element_type cmpl=COMPLEX)
Definition: field.h:82
static void sync_barrier_all()
barrier among all the threads and nodes.
void aypx(const double a, Field &y, const Field &x)
aypx(y, a, x): y := a * y + x
Definition: field.cpp:489
int nex() const
Definition: field.h:102
void paranoiac(const char *format,...)
Definition: bridgeIO.cpp:62
void axpy(Field &y, const double a, const Field &x)
axpy(y, a, x): y := a * x + y
Definition: field.cpp:193
void crucial(const char *format,...)
Definition: bridgeIO.cpp:26
static const std::string class_name
Base class for linear solver class family.
Definition: solver.h:37
static bool Register(const std::string &realm, const creator_callback &cb)
BiCGStab algorithm.
void solve_step(double &)
int non_negative(const int v)
Definition: checker.cpp:21
void Register_double(const string &, const double)
Definition: parameters.cpp:324
void reset_field(const Field &)
Base class of fermion operator family.
Definition: fopr.h:39
int fetch_double(const string &key, double &val) const
Definition: parameters.cpp:124
string get_string(const string &key) const
Definition: parameters.cpp:85
int fetch_int(const string &key, int &val) const
Definition: parameters.cpp:141
Bridge::VerboseLevel m_vl
Definition: solver.h:56
static VerboseLevel set_verbose_level(const std::string &str)
Definition: bridgeIO.cpp:191
static void assert_single_thread(const std::string &classname)
assert currently running on single thread.
int size() const
Definition: field.h:106