PlayaPoissonBoltzmannJacobian.cpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                 Playa: Programmable Linear Algebra
00005 //                 Copyright 2012 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
00041 
00042 #include "PlayaPoissonBoltzmannJacobian.hpp"
00043 #include "PlayaEpetraMatrix.hpp"
00044 #include "PlayaIncrementallyConfigurableMatrixFactory.hpp"
00045 #include "PlayaTabs.hpp"
00046 
00047 
00048 #ifndef HAVE_TEUCHOS_EXPLICIT_INSTANTIATION
00049 #include "PlayaVectorImpl.hpp"
00050 #include "PlayaLinearOperatorImpl.hpp"
00051 #endif
00052 using namespace Playa;
00053 using namespace Teuchos;
00054 
00055 
00056 PoissonBoltzmannJacobian
00057 ::PoissonBoltzmannJacobian(int nLocalRows, 
00058   const VectorType<double>& type)
00059   : OperatorBuilder<double>(nLocalRows, type), op_(), nLocalRows_(nLocalRows),
00060     h_(1.0)
00061 {
00062   h_ = 1.0/((double) domain().dim() - 1);
00063 }
00064 
00065 void PoissonBoltzmannJacobian::setEvalPoint(const Vector<double>& x)
00066 {
00067   Tabs tab;
00068   Out::os() << tab << "in PBJ::setEvalPoint()" << std::endl;
00069   int rank = MPIComm::world().getRank();
00070   int nProc = MPIComm::world().getNProc();
00071   RCP<MatrixFactory<double> > mFact 
00072     = vecType().createMatrixFactory(domain(), range());
00073   
00074   int lowestLocalRow = nLocalRows_ * rank;
00075 
00076   IncrementallyConfigurableMatrixFactory* icmf 
00077     = dynamic_cast<IncrementallyConfigurableMatrixFactory*>(mFact.get());
00078   for (int i=0; i<nLocalRows_; i++)
00079   {
00080     int row = lowestLocalRow + i;
00081     Array<int> colIndices;
00082     if ((rank==0 && i==0) || (rank==nProc-1 && i==nLocalRows_-1))
00083     {
00084       colIndices = tuple(row);
00085     }
00086     else
00087     {
00088       colIndices = tuple(row-1, row, row+1);
00089     }
00090     icmf->initializeNonzerosInRow(row, colIndices.size(),
00091       &(colIndices[0]));
00092   }
00093   icmf->finalize();
00094       
00095   op_ = mFact->createMatrix();
00096       
00097   RCP<LoadableMatrix<double> > mat = op_.matrix();
00098 
00099   /* fill in with the Laplacian operator plus exp(-x) */
00100   for (int i=0; i<nLocalRows_; i++)
00101   {
00102     int row = lowestLocalRow + i;
00103     Array<int> colIndices;
00104     Array<double> colVals;
00105     if ((rank==0 && i==0) || (rank==nProc-1 && i==nLocalRows_-1))
00106     {
00107       colIndices = tuple(row);
00108       colVals = tuple(1.0);
00109     }
00110     else
00111     {
00112       colIndices = tuple(row-1, row, row+1);
00113       colVals = tuple(1.0/h_/h_, 
00114         -2.0/h_/h_ + exp(-x[i]), 
00115         1.0/h_/h_);
00116     }
00117     mat->addToRow(row, colIndices.size(), 
00118       &(colIndices[0]), &(colVals[0]));
00119   }
00120   Out::os() << tab << "done PBJ::setEvalPoint()" << std::endl;
00121 }

Site Contact