Chaste Release::3.1
AbstractLinearPdeSolver.hpp
00001 /*
00002 
00003 Copyright (c) 2005-2012, University of Oxford.
00004 All rights reserved.
00005 
00006 University of Oxford means the Chancellor, Masters and Scholars of the
00007 University of Oxford, having an administrative office at Wellington
00008 Square, Oxford OX1 2JD, UK.
00009 
00010 This file is part of Chaste.
00011 
00012 Redistribution and use in source and binary forms, with or without
00013 modification, are permitted provided that the following conditions are met:
00014  * Redistributions of source code must retain the above copyright notice,
00015    this list of conditions and the following disclaimer.
00016  * Redistributions in binary form must reproduce the above copyright notice,
00017    this list of conditions and the following disclaimer in the documentation
00018    and/or other materials provided with the distribution.
00019  * Neither the name of the University of Oxford nor the names of its
00020    contributors may be used to endorse or promote products derived from this
00021    software without specific prior written permission.
00022 
00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00024 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00025 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00026 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
00027 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00028 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
00029 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00030 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00031 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
00032 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033 
00034 */
00035 
00036 #ifndef ABSTRACTLINEARPDESOLVER_HPP_
00037 #define ABSTRACTLINEARPDESOLVER_HPP_
00038 
00039 #include "LinearSystem.hpp"
00040 #include "BoundaryConditionsContainer.hpp"
00041 #include "AbstractTetrahedralMesh.hpp"
00042 #include "HeartEventHandler.hpp"
00043 
00048 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00049 class AbstractLinearPdeSolver : private boost::noncopyable
00050 {
00051 protected:
00052 
00054     LinearSystem* mpLinearSystem;
00055 
00057     AbstractTetrahedralMesh<ELEMENT_DIM,SPACE_DIM>* mpMesh;
00058 
00059 public:
00060 
00066     AbstractLinearPdeSolver(AbstractTetrahedralMesh<ELEMENT_DIM,SPACE_DIM>* pMesh)
00067         : mpLinearSystem(NULL),
00068           mpMesh(pMesh)
00069     {
00070         assert(pMesh!=NULL);
00071     }
00072 
00076     virtual ~AbstractLinearPdeSolver()
00077     {
00078         if (mpLinearSystem)
00079         {
00080             delete mpLinearSystem;
00081         }
00082     }
00083 
00093     virtual void InitialiseForSolve(Vec initialSolution = NULL);
00094 
00101     virtual void PrepareForSetupLinearSystem(Vec currentSolution)
00102     {
00103     }
00104 
00112     virtual void FinaliseLinearSystem(Vec currentSolution)
00113     {
00114     }
00115 
00125     virtual void FollowingSolveLinearSystem(Vec currentSolution)
00126     {
00127     }
00128 
00140     virtual void SetupLinearSystem(Vec currentSolution, bool computeMatrix)=0;
00141 
00145     LinearSystem* GetLinearSystem()
00146     {
00147         return mpLinearSystem;
00148     }
00149 };
00150 
00151 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00152 void AbstractLinearPdeSolver<ELEMENT_DIM, SPACE_DIM, PROBLEM_DIM>::InitialiseForSolve(Vec initialSolution)
00153 {
00154     if (this->mpLinearSystem == NULL)
00155     {
00156         unsigned preallocation=(mpMesh->CalculateMaximumContainingElementsPerProcess() + ELEMENT_DIM);
00157         if (ELEMENT_DIM > 1)
00158         {
00159             // Highest connectivity is closed
00160             preallocation--;
00161         }
00162         preallocation *= PROBLEM_DIM;
00163 
00164         HeartEventHandler::BeginEvent(HeartEventHandler::COMMUNICATION);
00165         if (initialSolution == NULL)
00166         {
00167             /*
00168              * Static problem, create linear system. The following ensures
00169              * all the unknowns for a particular node are on the same processor.
00170              */
00171             Vec template_vec = mpMesh->GetDistributedVectorFactory()->CreateVec(PROBLEM_DIM);
00172 
00173             this->mpLinearSystem = new LinearSystem(template_vec, preallocation);
00174 
00175             PetscTools::Destroy(template_vec);
00176         }
00177         else
00178         {
00179             /*
00180              * Use the current solution (ie the initial solution)
00181              * as the template in the alternative constructor of
00182              * LinearSystem. This is to avoid problems with VecScatter.
00183              */
00184             this->mpLinearSystem = new LinearSystem(initialSolution, preallocation);
00185         }
00186 
00187         HeartEventHandler::EndEvent(HeartEventHandler::COMMUNICATION);
00188     }
00189 }
00190 
00191 #endif /*ABSTRACTLINEARPDESOLVER_HPP_*/