SimplePetscNonlinearSolver.cpp

00001 /*
00002 
00003 Copyright (c) 2005-2015, 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 
00040 #include <sstream>
00041 #include "petscsnes.h"
00042 #include "SimplePetscNonlinearSolver.hpp"
00043 #include "Exception.hpp"
00044 #include "PetscTools.hpp"
00045 
00046 Vec SimplePetscNonlinearSolver::Solve(PetscErrorCode (*pComputeResidual)(SNES,Vec,Vec,void*),
00047 #if ( PETSC_VERSION_MAJOR==3 && PETSC_VERSION_MINOR>=5 )
00048                                       PetscErrorCode (*pComputeJacobian)(SNES,Vec,Mat,Mat,void*),
00049 #else
00050                                       PetscErrorCode (*pComputeJacobian)(SNES,Vec,Mat*,Mat*,MatStructure*,void*),
00051 #endif
00052                                       Vec initialGuess,
00053                                       unsigned fill,
00054                                       void* pContext)
00055 {
00056     SNES snes;
00057 
00058     // Create the residual vector by copying the structure of the initial guess
00059     Vec residual;
00060     VecDuplicate(initialGuess, &residual);
00061 
00062     Mat jacobian; // Jacobian Matrix
00063     PetscInt N; // number of elements
00064 
00065     // Get the size of the Jacobian from the residual
00066     VecGetSize(initialGuess, &N);
00067 
00068     // Note that the Jacobian matrix might involve new non-zero elements in the course of a SNES solve
00069     PetscTools::SetupMat(jacobian, N, N, fill, PETSC_DECIDE, PETSC_DECIDE, true, false /*malloc flag*/);
00070 
00071     SNESCreate(PETSC_COMM_WORLD, &snes);
00072 
00073     SNESSetFunction(snes, residual, pComputeResidual, pContext);
00074     SNESSetJacobian(snes, jacobian, jacobian, pComputeJacobian, pContext);
00075 
00076 #if (PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR >= 4) //PETSc 3.4 or later
00077     SNESSetType(snes, SNESNEWTONLS);
00078 #else
00079     SNESSetType(snes, SNESLS);
00080 #endif
00081 
00082     SNESSetTolerances(snes,1.0e-5,1.0e-5,1.0e-5,PETSC_DEFAULT,PETSC_DEFAULT);
00083 #if (PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR == 3) //PETSc 3.3
00084     SNESLineSearch linesearch;
00085     SNESGetSNESLineSearch(snes, &linesearch);
00086     SNESLineSearchSetType(linesearch, "bt"); //Use backtracking search as default
00087 #elif (PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR >= 4) //PETSc 3.4 or later
00088     SNESLineSearch linesearch;
00089     SNESGetLineSearch(snes, &linesearch);
00090     SNESLineSearchSetType(linesearch, "bt"); //Use backtracking search as default
00091 #endif
00092 
00093     // x is the iteration vector SNES uses when solving, set equal to initialGuess to start with
00094     Vec x;
00095 
00096     VecDuplicate(initialGuess, &x);
00097     VecCopy(initialGuess, x);
00098 
00099 #if (PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR >= 5)
00100     // Seems to want the preconditioner to be explicitly set to none now
00101     // Copied this from the similar PETSc example at:
00102     // http://www.mcs.anl.gov/petsc/petsc-current/src/snes/examples/tutorials/ex1.c
00103     // Which got it to work...
00104     KSP ksp;
00105     SNESGetKSP(snes,&ksp);
00106     PC pc;
00107     KSPGetPC(ksp,&pc);
00108     PCSetType(pc,PCNONE);
00109 #endif
00110 
00111 #if (PETSC_VERSION_MAJOR == 2 && PETSC_VERSION_MINOR == 2) //PETSc 2.2
00112     SNESSolve(snes, x);
00113 #else
00114     SNESSolve(snes, PETSC_NULL, x);
00115 #endif
00116     PetscTools::Destroy(residual);
00117     PetscTools::Destroy(jacobian); // Free Jacobian
00118 
00119     SNESConvergedReason reason;
00120     SNESGetConvergedReason(snes,&reason);
00121 #define COVERAGE_IGNORE
00122     if (reason < 0)
00123     {
00124         std::stringstream reason_stream;
00125         reason_stream << reason;
00126         PetscTools::Destroy(x); // Since caller can't free the memory in this case
00127         SNESDestroy(PETSC_DESTROY_PARAM(snes));
00128         EXCEPTION("Nonlinear Solver did not converge. PETSc reason code:"
00129                   +reason_stream.str()+" .");
00130     }
00131 #undef COVERAGE_IGNORE
00132     SNESDestroy(PETSC_DESTROY_PARAM(snes));
00133 
00134     return x;
00135 }

Generated by  doxygen 1.6.2