Cg.cxx

// Copyright (C) 2003-2009 Marc Duruflé
// Copyright (C) 2001-2009 Vivien Mallet
//
// This file is part of the linear-algebra library Seldon,
// http://seldon.sourceforge.net/.
//
// Seldon is free software; you can redistribute it and/or modify it under the
// terms of the GNU Lesser General Public License as published by the Free
// Software Foundation; either version 2.1 of the License, or (at your option)
// any later version.
//
// Seldon is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
// more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with Seldon. If not, see http://www.gnu.org/licenses/.
 
 
#ifndef SELDON_FILE_ITERATIVE_CG_CXX
 
namespace Seldon
{
 
 
#ifdef SELDON_WITH_VIRTUAL
  template<class T, class Vector1>
  int Cg(const VirtualMatrix<T>& A, Vector1& x, const Vector1& b,
         Preconditioner_Base<T>& M,
         Iteration<typename ClassComplexType<T>::Treal>& iter)
#else
  template <class Titer, class Matrix1, class Vector1, class Preconditioner>
  int Cg(const Matrix1& A, Vector1& x, const Vector1& b,
         Preconditioner& M, Iteration<Titer> & iter)
#endif
  {
    const int N = A.GetM();
    if (N <= 0)
      return 0;
 
    typedef typename Vector1::value_type Complexe;
    Complexe rho, rho_1, alpha, beta, delta;
    Vector1 p(b), q(b), r(b), z(b);
    Complexe zero, one;
    SetComplexZero(zero);
    SetComplexOne(one);
    rho = one; rho_1 = one;
    
    // we initialize iter
    int success_init = iter.Init(b);
    if (success_init != 0)
      return iter.ErrorCode();
 
    // we compute the initial residual r = b - Ax
    Copy(b, r);
    if (!iter.IsInitGuess_Null())
      iter.MltAdd(-one, A, x, one, r);
    else
      x.Fill(zero);
 
    iter.SetNumberIteration(0);
    // Loop until the stopping criteria are satisfied
    while (! iter.Finished(r))
      {
 
        // Preconditioning z = M^{-1} r
        M.Solve(A, r, z);
 
        // rho = (conj(r),z)
        rho = DotProdConj(r, z);
 
        if (rho == zero)
          {
            iter.Fail(1, "Cg breakdown #1");
            break;
          }
 
        if (iter.First())
          Copy(z, p);
        else
          {
            // p = beta*p + z  where  beta = rho_i/rho_{i-1}
            beta = rho / rho_1;
            Mlt(beta, p);
            Add(one, z, p);
          }
 
        // matrix vector product q = A*p
        iter.Mlt(A, p, q);
        delta = DotProdConj(p, q);
        if (delta == zero)
          {
            iter.Fail(2, "Cg breakdown #2");
            break;
          }
        alpha = rho / delta;
 
        // x = x + alpha*p  and r = r - alpha*q  where alpha = rho/(bar(p),q)
        Add(alpha, p, x);
        Add(-alpha, q, r);
 
        rho_1 = rho;
 
        ++iter;
      }
 
    return iter.ErrorCode();
  }
 
 
} // end namespace
 
#define SELDON_FILE_ITERATIVE_CG_CXX
#endif