Chaste Release::3.1
|
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 00040 #include "SimplePetscNonlinearSolver.hpp" 00041 #include "Exception.hpp" 00042 #include "petscsnes.h" 00043 #include "PetscTools.hpp" 00044 #include <sstream> 00045 00046 Vec SimplePetscNonlinearSolver::Solve(PetscErrorCode (*pComputeResidual)(SNES,Vec,Vec,void*), 00047 PetscErrorCode (*pComputeJacobian)(SNES,Vec,Mat*,Mat*,MatStructure*,void*), 00048 Vec initialGuess, 00049 unsigned fill, 00050 void* pContext) 00051 { 00052 SNES snes; 00053 00054 // Create the residual vector by copying the structure of the initial guess 00055 Vec residual; 00056 VecDuplicate(initialGuess, &residual); 00057 00058 Mat jacobian; // Jacobian Matrix 00059 00060 PetscInt N; // number of elements 00061 00062 // Get the size of the Jacobian from the residual 00063 VecGetSize(initialGuess,&N); 00064 00065 PetscTools::SetupMat(jacobian, N, N, fill); 00066 00067 SNESCreate(PETSC_COMM_WORLD, &snes); 00068 SNESSetFunction(snes, residual, pComputeResidual, pContext); 00069 SNESSetJacobian(snes, jacobian, jacobian, pComputeJacobian, pContext); 00070 SNESSetType(snes,SNESLS); 00071 SNESSetTolerances(snes,1.0e-5,1.0e-5,1.0e-5,PETSC_DEFAULT,PETSC_DEFAULT); 00072 00073 // x is the iteration vector SNES uses when solving, set equal to initialGuess to start with 00074 Vec x; 00075 VecDuplicate(initialGuess, &x); 00076 VecCopy(initialGuess, x); 00077 00078 #if (PETSC_VERSION_MAJOR == 2 && PETSC_VERSION_MINOR == 2) //PETSc 2.2 00079 SNESSolve(snes, x); 00080 #else 00081 SNESSolve(snes, PETSC_NULL, x); 00082 #endif 00083 00084 PetscTools::Destroy(residual); 00085 PetscTools::Destroy(jacobian); // Free Jacobian 00086 00087 SNESConvergedReason reason; 00088 SNESGetConvergedReason(snes,&reason); 00089 #define COVERAGE_IGNORE 00090 if (reason < 0) 00091 { 00092 std::stringstream reason_stream; 00093 reason_stream << reason; 00094 PetscTools::Destroy(x); // Since caller can't free the memory in this case 00095 SNESDestroy(PETSC_DESTROY_PARAM(snes)); 00096 EXCEPTION("Nonlinear Solver did not converge. PETSc reason code:" 00097 +reason_stream.str()+" ."); 00098 } 00099 #undef COVERAGE_IGNORE 00100 SNESDestroy(PETSC_DESTROY_PARAM(snes)); 00101 00102 return x; 00103 }