preconditioners.hh

Go to the documentation of this file.

// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_ISTL_PRECONDITIONERS_HH
#define DUNE_ISTL_PRECONDITIONERS_HH
 
#include <cmath>
#include <complex>
#include <iostream>
#include <iomanip>
#include <memory>
#include <string>
 
#include <dune/common/unused.hh>
 
#include "preconditioner.hh"
#include "solver.hh"
#include "solvercategory.hh"
#include "istlexception.hh"
#include "matrixutils.hh"
#include "gsetc.hh"
#include "ildl.hh"
#include "ilu.hh"
 
 
namespace Dune {
  template<class O, int c = -1>
  class InverseOperator2Preconditioner :
    public Preconditioner<typename O::domain_type, typename O::range_type>
  {
  public:
    typedef typename O::domain_type domain_type;
    typedef typename O::range_type range_type;
    typedef typename range_type::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
    typedef O InverseOperator;
 
    InverseOperator2Preconditioner(InverseOperator& inverse_operator)
    : inverse_operator_(inverse_operator)
    {
      if(c != -1 && SolverCategory::category(inverse_operator_) != c)
        DUNE_THROW(InvalidStateException, "User supplied solver category does not match that of the supplied iverser operator");
    }
 
    virtual void pre(domain_type&,range_type&)
    {}
 
    virtual void apply(domain_type& v, const range_type& d)
    {
      InverseOperatorResult res;
      range_type copy(d);
      inverse_operator_.apply(v, copy, res);
    }
 
    virtual void post(domain_type&)
    {}
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::category(inverse_operator_);
    }
 
  private:
    InverseOperator& inverse_operator_;
  };
 
  //=====================================================================
  // Implementation of this interface for sequential ISTL-preconditioners
  //=====================================================================
 
 
  template<class M, class X, class Y, int l=1>
  class SeqSSOR : public Preconditioner<X,Y> {
  public:
    typedef M matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqSSOR (const M& A, int n, scalar_field_type w)
      : _A_(A), _n(n), _w(w)
    {
      CheckIfDiagonalPresent<M,l>::check(_A_);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
 
    }
 
    virtual void apply (X& v, const Y& d)
    {
      for (int i=0; i<_n; i++) {
        bsorf(_A_,v,d,_w,BL<l>());
        bsorb(_A_,v,d,_w,BL<l>());
      }
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    const M& _A_;
    int _n;
    scalar_field_type _w;
  };
 
 
 
  template<class M, class X, class Y, int l=1>
  class SeqSOR : public Preconditioner<X,Y> {
  public:
    typedef M matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqSOR (const M& A, int n, scalar_field_type w)
      : _A_(A), _n(n), _w(w)
    {
      CheckIfDiagonalPresent<M,l>::check(_A_);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      this->template apply<true>(v,d);
    }
 
    template<bool forward>
    void apply(X& v, const Y& d)
    {
      if(forward)
        for (int i=0; i<_n; i++) {
          bsorf(_A_,v,d,_w,BL<l>());
        }
      else
        for (int i=0; i<_n; i++) {
          bsorb(_A_,v,d,_w,BL<l>());
        }
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    const M& _A_;
    int _n;
    scalar_field_type _w;
  };
 
 
  template<class M, class X, class Y, int l=1>
  class SeqGS : public Preconditioner<X,Y> {
  public:
    typedef M matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqGS (const M& A, int n, scalar_field_type w)
      : _A_(A), _n(n), _w(w)
    {
      CheckIfDiagonalPresent<M,l>::check(_A_);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      for (int i=0; i<_n; i++) {
        dbgs(_A_,v,d,_w,BL<l>());
      }
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    const M& _A_;
    int _n;
    scalar_field_type _w;
  };
 
 
  template<class M, class X, class Y, int l=1>
  class SeqJac : public Preconditioner<X,Y> {
  public:
    typedef M matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqJac (const M& A, int n, scalar_field_type w)
      : _A_(A), _n(n), _w(w)
    {
      CheckIfDiagonalPresent<M,l>::check(_A_);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      for (int i=0; i<_n; i++) {
        dbjac(_A_,v,d,_w,BL<l>());
      }
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    const M& _A_;
    int _n;
    scalar_field_type _w;
  };
 
 
 
  template<class M, class X, class Y, int l=1>
  class SeqILU : public Preconditioner<X,Y> {
  public:
    typedef typename std::remove_const<M>::type matrix_type;
    typedef typename matrix_type :: block_type block_type;
    typedef X domain_type;
    typedef Y range_type;
 
    typedef typename X::field_type field_type;
 
    typedef SimdScalar<field_type> scalar_field_type;
 
    typedef typename ILU::CRS< block_type > CRS;
 
    SeqILU (const M& A, scalar_field_type w, const bool resort = false )
      : SeqILU( A, 0, w, resort ) // construct ILU(0)
    {
    }
 
    SeqILU (const M& A, int n, scalar_field_type w, const bool resort = false )
      : ILU_(),
        lower_(),
        upper_(),
        inv_(),
        w_(w),
        wNotIdentity_( std::abs( w_ - scalar_field_type(1) ) > 1e-15 )
    {
      if( n == 0 )
      {
        // copy A
        ILU_.reset( new matrix_type( A ) );
        // create ILU(0) decomposition
        bilu0_decomposition( *ILU_ );
      }
      else
      {
        // create matrix in build mode
        ILU_.reset( new matrix_type(  A.N(), A.M(), matrix_type::row_wise) );
        // create ILU(n) decomposition
        bilu_decomposition( A, n, *ILU_ );
      }
 
      if( resort )
      {
        // store ILU in simple CRS format
        ILU::convertToCRS( *ILU_, lower_, upper_, inv_ );
        ILU_.reset();
      }
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      if( ILU_ )
      {
        bilu_backsolve( *ILU_, v, d);
      }
      else
      {
        ILU::bilu_backsolve(lower_, upper_, inv_, v, d);
      }
 
      if( wNotIdentity_ )
      {
        v *= w_;
      }
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  protected:
    std::unique_ptr< matrix_type > ILU_;
 
    CRS lower_;
    CRS upper_;
    std::vector< block_type > inv_;
 
    const scalar_field_type w_;
    const bool wNotIdentity_;
  };
 
 
  template<class M, class X, class Y, int l=1>
  class SeqILU0 : public Preconditioner<X,Y> {
  public:
    typedef typename std::remove_const<M>::type matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqILU0 (const M& A, scalar_field_type w)
      : _w(w),
        ILU(A) // copy A
 
    {
      bilu0_decomposition(ILU);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      bilu_backsolve(ILU,v,d);
      v *= _w;
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    scalar_field_type _w;
    matrix_type ILU;
  };
 
 
  template<class M, class X, class Y, int l=1>
  class SeqILUn : public Preconditioner<X,Y> {
  public:
    typedef typename std::remove_const<M>::type matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    SeqILUn (const M& A, int n, scalar_field_type w)
      : ILU(A.N(),A.M(),M::row_wise),
        _n(n),
        _w(w)
    {
      bilu_decomposition(A,n,ILU);
    }
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      bilu_backsolve(ILU,v,d);
      v *= _w;
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    matrix_type ILU;
    int _n;
    scalar_field_type _w;
  };
 
 
 
  template<class X, class Y>
  class Richardson : public Preconditioner<X,Y> {
  public:
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    Richardson (scalar_field_type w=1.0) :
      _w(w)
    {}
 
    virtual void pre (X& x, Y& b)
    {
      DUNE_UNUSED_PARAMETER(x);
      DUNE_UNUSED_PARAMETER(b);
    }
 
    virtual void apply (X& v, const Y& d)
    {
      v = d;
      v *= _w;
    }
 
    virtual void post (X& x)
    {
      DUNE_UNUSED_PARAMETER(x);
    }
 
    virtual SolverCategory::Category category() const
    {
      return SolverCategory::sequential;
    }
 
  private:
    scalar_field_type _w;
  };
 
 
  template< class M, class X, class Y >
  class SeqILDL
    : public Preconditioner< X, Y >
  {
    typedef SeqILDL< M, X, Y > This;
    typedef Preconditioner< X, Y > Base;
 
  public:
    typedef std::remove_const_t< M > matrix_type;
    typedef X domain_type;
    typedef Y range_type;
    typedef typename X::field_type field_type;
    typedef SimdScalar<field_type> scalar_field_type;
 
    explicit SeqILDL ( const matrix_type &A, scalar_field_type relax = scalar_field_type( 1 ) )
      : decomposition_( A.N(), A.M(), matrix_type::random ),
        relax_( relax )
    {
      // setup row sizes for lower triangular matrix
      for( auto i = A.begin(), iend = A.end(); i != iend; ++i )
      {
        const auto &A_i = *i;
        const auto ij = A_i.find( i.index() );
        if( ij != A_i.end() )
          decomposition_.setrowsize( i.index(), ij.offset()+1 );
        else
          DUNE_THROW( ISTLError, "diagonal entry missing" );
      }
      decomposition_.endrowsizes();
 
      // setup row indices for lower triangular matrix
      for( auto i = A.begin(), iend = A.end(); i != iend; ++i )
      {
        const auto &A_i = *i;
        for( auto ij = A_i.begin(); ij.index() < i.index() ; ++ij )
          decomposition_.addindex( i.index(), ij.index() );
        decomposition_.addindex( i.index(), i.index() );
      }
      decomposition_.endindices();
 
      // copy values of lower triangular matrix
      auto i = A.begin();
      for( auto row = decomposition_.begin(), rowend = decomposition_.end(); row != rowend; ++row, ++i )
      {
        auto ij = i->begin();
        for( auto col = row->begin(), colend = row->end(); col != colend; ++col, ++ij )
          *col = *ij;
      }
 
      // perform ILDL decomposition
      bildl_decompose( decomposition_ );
    }
 
    void pre ( X &x, Y &b ) override
    {
      DUNE_UNUSED_PARAMETER( x );
      DUNE_UNUSED_PARAMETER( b );
    }
 
    void apply ( X &v, const Y &d ) override
    {
      bildl_backsolve( decomposition_, v, d, true );
      v *= relax_;
    }
 
    void post ( X &x ) override
    {
      DUNE_UNUSED_PARAMETER( x );
    }
 
    SolverCategory::Category category () const override { return SolverCategory::sequential; }
 
  private:
    matrix_type decomposition_;
    scalar_field_type relax_;
  };
 
} // end namespace
 
#endif