rgcr.hpp

// FEAT3: Finite Element Analysis Toolbox, Version 3
// Copyright (C) 2010 by Stefan Turek & the FEAT group
// FEAT3 is released under the GNU General Public License version 3,
// see the file 'copyright.txt' in the top level directory for details.
 
#pragma once
 
// includes, FEAT
#include <kernel/solver/iterative.hpp>
 
namespace FEAT
{
  namespace Solver
  {
    template<
      typename Matrix_,
      typename Filter_>
    class RGCR :
      public PreconditionedIterativeSolver<typename Matrix_::VectorTypeR>
    {
    public:
      typedef Matrix_ MatrixType;
      typedef Filter_ FilterType;
      typedef typename MatrixType::VectorTypeR VectorType;
      typedef typename MatrixType::DataType DataType;
      typedef PreconditionedIterativeSolver<VectorType> BaseClass;
 
      typedef SolverBase<VectorType> PrecondType;
 
    protected:
      const MatrixType& _system_matrix;
      const FilterType& _system_filter;
      VectorType _vec_r, _vec_p_hat, _vec_q_hat;
      std::vector<VectorType> p_list, q_list;
 
    public:
      explicit RGCR(const MatrixType& matrix, const FilterType& filter,
        std::shared_ptr<PrecondType> precond = nullptr) :
        BaseClass("RGCR", precond),
        _system_matrix(matrix),
        _system_filter(filter)
      {
        // set communicator by system matrix
        this->_set_comm_by_matrix(matrix);
      }
 
      explicit RGCR(const String& section_name, const PropertyMap* section,
        const MatrixType& matrix, const FilterType& filter,
        std::shared_ptr<PrecondType> precond = nullptr) :
        BaseClass("RGCR", section_name, section, precond),
        _system_matrix(matrix),
        _system_filter(filter)
      {
        // set communicator by system matrix
        this->_set_comm_by_matrix(matrix);
      }
 
      virtual String name() const override
      {
        return "RGCR";
      }
 
      virtual void init_symbolic() override
      {
        BaseClass::init_symbolic();
        _vec_r = this->_system_matrix.create_vector_r();
        _vec_p_hat = this->_system_matrix.create_vector_r();
        _vec_q_hat = this->_system_matrix.create_vector_r();
      }
 
      virtual void done_symbolic() override
      {
        this->_vec_q_hat.clear();
        this->_vec_p_hat.clear();
        this->_vec_r.clear();
        q_list.clear();
        p_list.clear();
        BaseClass::done_symbolic();
      }
 
      virtual Status apply(VectorType& vec_cor, const VectorType& vec_def) override
      {
        // save defect
        this->_vec_r.copy(vec_def);
        //this->_system_filter.filter_def(this->_vec_r);
 
        // clear solution vector
        vec_cor.format();
 
        // apply solver
        this->_status = _apply_intern(vec_cor);
 
        // plot summary
        this->plot_summary();
 
        p_list.resize(p_list.size() / 4);
        q_list.resize(q_list.size() / 4);
 
        // return status
        return this->_status;
      }
 
      virtual Status correct(VectorType& vec_sol, const VectorType& vec_rhs) override
      {
        // compute defect
        this->_system_matrix.apply(this->_vec_r, vec_sol, vec_rhs, -DataType(1));
        this->_system_filter.filter_def(this->_vec_r);
 
        // apply solver
        this->_status = _apply_intern(vec_sol);
 
        // plot summary
        this->plot_summary();
 
        p_list.resize(p_list.size() / 4);
        q_list.resize(q_list.size() / 4);
 
        // return status
        return this->_status;
      }
 
    protected:
      virtual Status _apply_intern(VectorType& vec_sol)
      {
        Statistics::add_solver_expression(std::make_shared<ExpressionStartSolve>(this->name()));
 
        const MatrixType& matrix(this->_system_matrix);
        const FilterType& filter(this->_system_filter);
        VectorType& vec_r(this->_vec_r);
        VectorType& vec_p_hat(this->_vec_p_hat);
        VectorType& vec_q_hat(this->_vec_q_hat);
 
        // set initial defect:
        // r[0] := b - A*x[0]
        Status status = this->_set_initial_defect(vec_r, vec_sol);
        if(status != Status::progress)
        {
          Statistics::add_solver_expression(std::make_shared<ExpressionEndSolve>(this->name(), status, this->get_num_iter()));
          return status;
        }
 
        // start iterating
        while(status == Status::progress)
        {
          IterationStats stat(*this);
 
          // no stored descent vectors left, calculate new one
          if (this->_num_iter >= p_list.size())
          {
            // apply preconditioner to defect vector
            if(!this->_apply_precond(vec_p_hat, vec_r, filter))
            {
              Statistics::add_solver_expression(std::make_shared<ExpressionEndSolve>(this->name(), Status::aborted, this->get_num_iter()));
              return Status::aborted;
            }
 
            //vec_p_hat.copy(vec_r);
            matrix.apply(vec_q_hat, vec_p_hat);
            filter.filter_def(vec_q_hat);
            for (Index j(0) ; j < this->_num_iter ; ++j)
            {
              auto beta = vec_q_hat.dot(q_list.at(j));
              vec_q_hat.axpy(q_list.at(j), -beta);
              vec_p_hat.axpy(p_list.at(j), -beta);
            }
            const auto gamma = DataType(1) / vec_q_hat.norm2();
            vec_q_hat.scale(vec_q_hat, gamma);
            q_list.push_back(vec_q_hat.clone());
            vec_p_hat.scale(vec_p_hat, gamma);
            p_list.push_back(vec_p_hat.clone());
          }
 
          auto alpha = vec_r.dot(q_list.at(this->_num_iter));
          vec_sol.axpy(p_list.at(this->_num_iter), alpha);
          vec_r.axpy(q_list.at(this->_num_iter), -alpha);
          // compute defect norm
          status = this->_set_new_defect(vec_r, vec_sol);
          if(status != Status::progress)
          {
            Statistics::add_solver_expression(std::make_shared<ExpressionEndSolve>(this->name(), status, this->get_num_iter()));
            return status;
          }
        }
 
        // we should never reach this point...
        Statistics::add_solver_expression(std::make_shared<ExpressionEndSolve>(this->name(), Status::undefined, this->get_num_iter()));
        return Status::undefined;
      }
    }; // class RGCR<...>
 
    template<typename Matrix_, typename Filter_>
    inline std::shared_ptr<RGCR<Matrix_, Filter_>> new_rgcr(
      const Matrix_& matrix, const Filter_& filter,
      std::shared_ptr<SolverBase<typename Matrix_::VectorTypeL>> precond = nullptr)
    {
      return std::make_shared<RGCR<Matrix_, Filter_>>(matrix, filter, precond);
    }
 
    template<typename Matrix_, typename Filter_>
    inline std::shared_ptr<RGCR<Matrix_, Filter_>> new_rgcr(
      const String& section_name, const PropertyMap* section,
      const Matrix_& matrix, const Filter_& filter,
      std::shared_ptr<SolverBase<typename Matrix_::VectorTypeL>> precond = nullptr)
    {
      return std::make_shared<RGCR<Matrix_, Filter_>>(section_name, section, matrix, filter, precond);
    }
  } // namespace Solver
} // namespace FEAT