PolymerTmpl.h

#ifndef PSCF_POLYMER_TMPL_H
#define PSCF_POLYMER_TMPL_H
 
/*
* PSCF - Polymer Self-Consistent Field Theory
*
* Copyright 2016 - 2022, The Regents of the University of Minnesota
* Distributed under the terms of the GNU General Public License.
*/
 
#include <pscf/chem/Species.h>           // base class
#include <util/param/ParamComposite.h>   // base class
 
#include <pscf/chem/Monomer.h>           // member template argument
#include <pscf/chem/Vertex.h>            // member template argument
#include <pscf/chem/PolymerType.h>       // member 
#include <util/containers/Pair.h>        // member template
#include <util/containers/DArray.h>      // member template
#include <util/containers/DMatrix.h>
 
#include <cmath>
 
namespace Pscf
{ 
 
   class Block;
   using namespace Util;
 
   template <class Block>
   class PolymerTmpl : public Species, public ParamComposite
   {
 
   public:
 
      // Modified diffusion equation solver for one block.
      typedef typename Block::Propagator Propagator;
 
      // Monomer concentration field.
      typedef typename Propagator::CField CField;
 
      // Chemical potential field.
      typedef typename Propagator::WField WField;
 
      PolymerTmpl();
 
      ~PolymerTmpl();
 
      virtual void readParameters(std::istream& in);
 
      virtual void solve(double phiTot = 1.0);
 
 
      Block& block(int id);
 
      Block const& block(int id) const ;
 
      const Vertex& vertex(int id) const;
 
      Propagator& propagator(int blockId, int directionId);
   
      Propagator const & propagator(int blockId, int directionId) const;
   
      Propagator&  propagator(int id);
 
      const Pair<int>& propagatorId(int id) const;
 
 
      int nBlock() const; 
 
      int nVertex() const;
 
      int nPropagator() const;  //
 
      double length() const;
      
      PolymerType::Enum type() const;
      
 
   protected:
 
      virtual void makePlan();
 
   private:
 
      DArray<Block> blocks_;
 
      DArray<Vertex> vertices_;
 
      DArray< Pair<int> > propagatorIds_;
 
      int nBlock_;
 
      int nVertex_;
 
      int nPropagator_;
 
      PolymerType::Enum type_;
 
   };
 
   /*
   * Number of vertices (ends and/or junctions)
   */
   template <class Block>
   inline int PolymerTmpl<Block>::nVertex() const
   {  return nVertex_; }
 
   /*
   * Number of blocks.
   */
   template <class Block>
   inline int PolymerTmpl<Block>::nBlock() const
   {  return nBlock_; }
 
   /*
   * Number of propagators.
   */
   template <class Block>
   inline int PolymerTmpl<Block>::nPropagator() const
   {  return nPropagator_; }
 
   /*
   * Total length of all blocks = volume / reference volume
   */
   template <class Block>
   inline double PolymerTmpl<Block>::length() const
   {  
      double value = 0.0;
      for (int blockId = 0; blockId < nBlock_; ++blockId) {
         value += blocks_[blockId].length();
      }
      return value;
   }
 
   /*
   * Get a specified Vertex.
   */
   template <class Block>
   inline 
   const Vertex& PolymerTmpl<Block>::vertex(int id) const
   {  return vertices_[id]; }
 
   /*
   * Get a specified Block.
   */
   template <class Block>
   inline Block& PolymerTmpl<Block>::block(int id)
   {  return blocks_[id]; }
 
   /*
   * Get a specified Block by const reference.
   */
   template <class Block>
   inline Block const & PolymerTmpl<Block>::block(int id) const
   {  return blocks_[id]; }
 
   /*
   * Get a propagator id, indexed in order of computation.
   */
   template <class Block>
   inline 
   Pair<int> const & PolymerTmpl<Block>::propagatorId(int id) const
   {
      UTIL_CHECK(id >= 0);  
      UTIL_CHECK(id < nPropagator_);  
      return propagatorIds_[id]; 
   }
 
   /*
   * Get a propagator indexed by block and direction.
   */
   template <class Block>
   inline 
   typename Block::Propagator& 
   PolymerTmpl<Block>::propagator(int blockId, int directionId)
   {  return block(blockId).propagator(directionId); }
 
   /*
   * Get a const propagator indexed by block and direction.
   */
   template <class Block>
   inline 
   typename Block::Propagator const & 
   PolymerTmpl<Block>::propagator(int blockId, int directionId) const
   {  return block(blockId).propagator(directionId); }
 
   /*
   * Get a propagator indexed in order of computation.
   */
   template <class Block>
   inline 
   typename Block::Propagator& PolymerTmpl<Block>::propagator(int id)
   {
      Pair<int> propId = propagatorId(id);
      return propagator(propId[0], propId[1]); 
   }
   
   /*
   * Get Polymer type (Branched or Linear).
   */
   template <class Block>
   inline PolymerType::Enum PolymerTmpl<Block>::type() const
   { return type_; }
 
   // Non-inline functions
 
   /*
   * Constructor.
   */
   template <class Block>
   PolymerTmpl<Block>::PolymerTmpl()
    : Species(),
      blocks_(),
      vertices_(),
      propagatorIds_(),
      nBlock_(0),
      nVertex_(0),
      nPropagator_(0)
   {  setClassName("PolymerTmpl"); }
 
   /*
   * Destructor.
   */
   template <class Block>
   PolymerTmpl<Block>::~PolymerTmpl()
   {}
 
   template <class Block>
   void PolymerTmpl<Block>::readParameters(std::istream& in)
   {
      // Read polymer type (linear by default)
      type_ = PolymerType::Linear;
      readOptional<PolymerType::Enum>(in, "type", type_);
 
      read<int>(in, "nBlock", nBlock_);
 
      // Note: For any acyclic graph, nVertex = nBlock + 1
      nVertex_ = nBlock_ + 1;
 
      // Allocate all arrays (blocks_, vertices_ and propagatorIds_)
      blocks_.allocate(nBlock_);
      vertices_.allocate(nVertex_);
      propagatorIds_.allocate(2*nBlock_);
 
      // Set block id and polymerType for all blocks
      for (int blockId = 0; blockId < nBlock_; ++blockId) {
         blocks_[blockId].setId(blockId);
         blocks_[blockId].setPolymerType(type_);
      }
 
      // Set all vertex ids
      for (int vertexId = 0; vertexId < nVertex_; ++vertexId) {
         vertices_[vertexId].setId(vertexId);
      }
 
      // If polymer is linear polymer, set all block vertex Ids:
      // In a linear chain, block i connects vertex i and vertex i+1.
      if (type_ == PolymerType::Linear) {
         for (int blockId = 0; blockId < nBlock_; ++blockId) {
            blocks_[blockId].setVertexIds(blockId, blockId + 1);
         }
      }
 
      // Read all other required block data 
      readDArray<Block>(in, "blocks", blocks_, nBlock_);
 
      /*
      * The parameter file format for each block in the array blocks_
      * is different for branched and linear polymer. These formats
      * are defined in >> and << stream io operators for a Pscf::Block.
      * The choice of format is controlled by the Block::polymerType.
      *
      * For a branched polymer, the text format for each block is:
      * 
      *   monomerId length vertexId(0) vertexId(1) 
      *
      * where monomerId is the index of the block monomer type, length
      * is the block length, and vertexId(0) and vertexId(1) are the
      * indices of the two vertices to which the block is attached. 
      *
      * For a linear polymer, blocks must be entered sequentially, in
      * their order along the chain, and block vertex id values are
      * set automatically. In this case, the format for one block is:
      *
      *   monomerId length
      *
      * with no need for explicit vertex ids.
      */
 
      // Add blocks to attached vertices
      int vertexId0, vertexId1;
      Block* blockPtr;
      for (int blockId = 0; blockId < nBlock_; ++blockId) {
          blockPtr = &(blocks_[blockId]);
          vertexId0 = blockPtr->vertexId(0);
          vertexId1 = blockPtr->vertexId(1);
          vertices_[vertexId0].addBlock(*blockPtr);
          vertices_[vertexId1].addBlock(*blockPtr);
      }
 
      // Polymer topology is now fully specified.
 
      // Construct a plan for the order in which block propagators 
      // should be computed when solving the MDE.
      makePlan();
 
      // Read phi or mu (but not both)
      bool hasPhi = readOptional(in, "phi", phi_).isActive();
      if (hasPhi) {
         ensemble_ = Species::Closed;
      } else {
         ensemble_ = Species::Open;
         read(in, "mu", mu_);
      }
 
      // Set sources for all propagators
      Vertex const * vertexPtr = 0;
      Propagator const * sourcePtr = 0;
      Propagator * propagatorPtr = 0;
      Pair<int> propagatorId;
      int blockId, directionId, vertexId, i;
      for (blockId = 0; blockId < nBlock(); ++blockId) {
         // Add sources
         for (directionId = 0; directionId < 2; ++directionId) {
            vertexId = block(blockId).vertexId(directionId);
            vertexPtr = &vertex(vertexId);
            propagatorPtr = &block(blockId).propagator(directionId);
            for (i = 0; i < vertexPtr->size(); ++i) {
               propagatorId = vertexPtr->inPropagatorId(i);
               if (propagatorId[0] == blockId) {
                  UTIL_CHECK(propagatorId[1] != directionId);
               } else {
                  sourcePtr = 
                     &block(propagatorId[0]).propagator(propagatorId[1]);
                  propagatorPtr->addSource(*sourcePtr);
               }
            }
         }
 
      }
 
   }
 
   /*
   * Make a plan for the order of computation of block propagators.
   */
   template <class Block>
   void PolymerTmpl<Block>::makePlan()
   {
      if (nPropagator_ != 0) {
         UTIL_THROW("nPropagator !=0 on entry");
      }
 
      // Allocate and initialize isFinished matrix
      DMatrix<bool> isFinished;
      isFinished.allocate(nBlock_, 2);
      for (int iBlock = 0; iBlock < nBlock_; ++iBlock) {
         for (int iDirection = 0; iDirection < 2; ++iDirection) {
            isFinished(iBlock, iDirection) = false;
         }
      }
 
      Pair<int> propagatorId;
      Vertex* inVertexPtr = 0;
      int inVertexId = -1;
      bool isReady;
      while (nPropagator_ < nBlock_*2) {
         for (int iBlock = 0; iBlock < nBlock_; ++iBlock) {
            for (int iDirection = 0; iDirection < 2; ++iDirection) {
               if (isFinished(iBlock, iDirection) == false) {
                  inVertexId = blocks_[iBlock].vertexId(iDirection);
                  inVertexPtr = &vertices_[inVertexId];
                  isReady = true;
                  for (int j = 0; j < inVertexPtr->size(); ++j) {
                     propagatorId = inVertexPtr->inPropagatorId(j);
                     if (propagatorId[0] != iBlock) {
                        if (!isFinished(propagatorId[0], propagatorId[1])) {
                           isReady = false;
                           break;
                        }
                     }
                  }
                  if (isReady) {
                     propagatorIds_[nPropagator_][0] = iBlock;
                     propagatorIds_[nPropagator_][1] = iDirection;
                     isFinished(iBlock, iDirection) = true;
                     ++nPropagator_;
                  }
               }
            }
         }
      }
 
   }
 
   /*
   * Compute a solution to the MDE and block concentrations.
   */ 
   template <class Block>
   void PolymerTmpl<Block>::solve(double phiTot)
   {
 
      // Clear all propagators
      for (int j = 0; j < nPropagator(); ++j) {
         propagator(j).setIsSolved(false);
      }
 
      // Solve modified diffusion equation for all propagators in
      // the order specified by function makePlan.
      for (int j = 0; j < nPropagator(); ++j) {
         UTIL_CHECK(propagator(j).isReady());
         propagator(j).solve();
      }
 
      // Compute molecular partition function q_
      q_ = block(0).propagator(0).computeQ(); 
  
      // The Propagator::computeQ function returns a spatial average.
      // Correct for partial occupation of the unit cell.
      q_ = q_/phiTot;
 
      // Compute mu_ or phi_, depending on ensemble
      if (ensemble() == Species::Closed) {
         mu_ = log(phi_/q_);
      } else 
      if (ensemble() == Species::Open) {
         phi_ = exp(mu_)*q_;
      }
 
      // Compute block concentration fields
      double prefactor = phi_ / ( q_ * length() );
      for (int i = 0; i < nBlock(); ++i) {
         block(i).computeConcentration(prefactor);
      }
 
   }
 
}
#endif