| [de061d] | 1 | /*
 | 
|---|
 | 2 |  *    vmg - a versatile multigrid solver
 | 
|---|
 | 3 |  *    Copyright (C) 2012 Institute for Numerical Simulation, University of Bonn
 | 
|---|
 | 4 |  *
 | 
|---|
 | 5 |  *  vmg is free software: you can redistribute it and/or modify
 | 
|---|
 | 6 |  *  it under the terms of the GNU General Public License as published by
 | 
|---|
 | 7 |  *  the Free Software Foundation, either version 3 of the License, or
 | 
|---|
 | 8 |  *  (at your option) any later version.
 | 
|---|
 | 9 |  *
 | 
|---|
 | 10 |  *  vmg is distributed in the hope that it will be useful,
 | 
|---|
 | 11 |  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
 | 12 |  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
 | 13 |  *  GNU General Public License for more details.
 | 
|---|
 | 14 |  *
 | 
|---|
 | 15 |  *  You should have received a copy of the GNU General Public License
 | 
|---|
 | 16 |  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 | 
|---|
 | 17 |  */
 | 
|---|
 | 18 | 
 | 
|---|
 | 19 | /**
 | 
|---|
 | 20 |  * @file   multigrid.hpp
 | 
|---|
 | 21 |  * @author Julian Iseringhausen <isering@ins.uni-bonn.de>
 | 
|---|
 | 22 |  * @date   Mon Apr 18 12:54:51 2011
 | 
|---|
 | 23 |  *
 | 
|---|
 | 24 |  * @brief  VMG::Multigrid
 | 
|---|
 | 25 |  *
 | 
|---|
 | 26 |  */
 | 
|---|
 | 27 | 
 | 
|---|
 | 28 | #ifndef MULTIGRID_HPP_
 | 
|---|
 | 29 | #define MULTIGRID_HPP_
 | 
|---|
 | 30 | 
 | 
|---|
 | 31 | #include <vector>
 | 
|---|
 | 32 | 
 | 
|---|
 | 33 | #include "base/object.hpp"
 | 
|---|
 | 34 | #include "grid/grid_properties.hpp"
 | 
|---|
 | 35 | 
 | 
|---|
 | 36 | namespace VMG
 | 
|---|
 | 37 | {
 | 
|---|
 | 38 | 
 | 
|---|
 | 39 | class Comm;
 | 
|---|
 | 40 | class Grid;
 | 
|---|
 | 41 | class Index;
 | 
|---|
 | 42 | class Interface;
 | 
|---|
 | 43 | 
 | 
|---|
 | 44 | class Multigrid : public Object
 | 
|---|
 | 45 | {
 | 
|---|
 | 46 | public:
 | 
|---|
 | 47 |   Multigrid(const Comm& comm, const Interface& interface);
 | 
|---|
 | 48 |   virtual ~Multigrid();
 | 
|---|
 | 49 | 
 | 
|---|
 | 50 |   Grid& operator()() {return *grids[levelIndex];}
 | 
|---|
 | 51 |   Grid& operator()(const int& level) {return *grids[levelMax-level];}
 | 
|---|
 | 52 | 
 | 
|---|
 | 53 |   const Grid& operator()() const {return *grids[levelIndex];}
 | 
|---|
 | 54 |   const Grid& operator()(const int& level) const {return *grids[levelMax-level];}
 | 
|---|
 | 55 | 
 | 
|---|
 | 56 |   const int& Level() const {return levelCurrent;}        ///< Current level
 | 
|---|
 | 57 |   int LevelIndex() const {return levelMax-levelCurrent;} ///< Index of current level
 | 
|---|
 | 58 | 
 | 
|---|
 | 59 |   const int& GlobalMaxLevel() const {return levelGlobalMax;}
 | 
|---|
 | 60 |   const int& MaxLevel() const {return levelMax;}             ///< Maximum level
 | 
|---|
 | 61 |   const int& MinLevel() const {return levelMin;}             ///< Minimum level
 | 
|---|
 | 62 |   const int& NumLevels() const {return numLevels;}           ///< Number of levels
 | 
|---|
 | 63 | 
 | 
|---|
 | 64 |   void SetLevel(int level);
 | 
|---|
 | 65 | 
 | 
|---|
 | 66 |   void ToCoarserLevel(); ///< Switch to next coarser level if possible
 | 
|---|
 | 67 |   void ToFinerLevel();   ///< Switch to next finer level if possible
 | 
|---|
 | 68 | 
 | 
|---|
 | 69 |   void ClearAll();             ///< Overwrites all grid points with zeros
 | 
|---|
 | 70 |   void ClearAllCoarseLevels(); ///< Overwrites all grid points on all levels except the finest one with zeros
 | 
|---|
 | 71 | 
 | 
|---|
 | 72 |   void SetCoarserDirichletValues();
 | 
|---|
 | 73 | 
 | 
|---|
 | 74 | protected:
 | 
|---|
 | 75 | 
 | 
|---|
 | 76 |   std::vector<Grid*> grids;
 | 
|---|
 | 77 | 
 | 
|---|
 | 78 |   int levelGlobalMax, levelMin, levelMax;
 | 
|---|
 | 79 |   int levelIndex, levelCurrent;
 | 
|---|
 | 80 |   int numLevels;
 | 
|---|
 | 81 | };
 | 
|---|
 | 82 | 
 | 
|---|
 | 83 | }
 | 
|---|
 | 84 | 
 | 
|---|
 | 85 | #endif /* MULTIGRID_HPP_ */
 | 
|---|