EpetraExt Package Browser (Single Doxygen Collection) Development
EpetraExt_Reindex_LinearProblem2.cpp
Go to the documentation of this file.
00001 //@HEADER
00002 // ***********************************************************************
00003 //
00004 //     EpetraExt: Epetra Extended - Linear Algebra Services Package
00005 //                 Copyright (2011) 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 Michael A. Heroux (maherou@sandia.gov)
00038 //
00039 // ***********************************************************************
00040 //@HEADER
00041 
00042 #include <EpetraExt_Reindex_LinearProblem2.h>
00043 
00044 #include <EpetraExt_Reindex_CrsMatrix.h>
00045 #include <EpetraExt_Reindex_MultiVector.h>
00046 
00047 #include <Epetra_LinearProblem.h>
00048 #include <Epetra_CrsMatrix.h>
00049 #include <Epetra_MultiVector.h>
00050 #include <Epetra_Map.h>
00051 
00052 namespace EpetraExt {
00053 
00054 LinearProblem_Reindex2::
00055 ~LinearProblem_Reindex2()
00056 {
00057   if( newObj_ ) delete newObj_;
00058 
00059   if( MatTrans_ ) delete MatTrans_;
00060   if( LHSTrans_ ) delete LHSTrans_;
00061   if( RHSTrans_ ) delete RHSTrans_;
00062 
00063   if( NewRowMapOwned_ ) delete NewRowMap_;
00064 }
00065 
00066 LinearProblem_Reindex2::NewTypeRef
00067 LinearProblem_Reindex2::
00068 operator()( OriginalTypeRef orig )
00069 {
00070   // Save original object
00071   origObj_ = &orig;
00072 
00073   Epetra_CrsMatrix * OldMatrix = dynamic_cast<Epetra_CrsMatrix*>( orig.GetMatrix() );
00074   Epetra_MultiVector * OldRHS = orig.GetRHS();
00075   Epetra_MultiVector * OldLHS = orig.GetLHS();
00076   const Epetra_BlockMap & OldRowMap = OldMatrix->Map();
00077 
00078   //If new map not passed in create one with lex ordering
00079   if( !NewRowMap_ )
00080   {
00081     int NumMyElements = OldRowMap.NumMyElements();
00082     int NumGlobalElements = OldRowMap.NumGlobalElements();
00083 
00084     NewRowMap_ = new Epetra_Map( NumGlobalElements, NumMyElements, 0, OldRowMap.Comm() );
00085     NewRowMapOwned_ = true;
00086   }
00087 
00088   MatTrans_ = new CrsMatrix_Reindex( *NewRowMap_ );
00089   LHSTrans_ = new MultiVector_Reindex( *NewRowMap_ );
00090   RHSTrans_ = new MultiVector_Reindex( *NewRowMap_ );
00091 
00092   Epetra_CrsMatrix * NewMatrix = &((*MatTrans_)( *OldMatrix ));
00093   Epetra_MultiVector * NewLHS = &((*LHSTrans_)( *OldLHS ));
00094   Epetra_MultiVector * NewRHS = &((*RHSTrans_)( *OldRHS ));
00095 
00096   newObj_ = new Epetra_LinearProblem( NewMatrix, NewLHS, NewRHS );
00097 
00098   return *newObj_;
00099 }
00100 
00101 bool LinearProblem_Reindex2::fwd()
00102 {
00103   Epetra_MultiVector * OldRHS = origObj_->GetRHS();
00104   Epetra_MultiVector * OldLHS = origObj_->GetLHS();
00105 
00106   // Clean up x and b before creating new multivectors
00107   delete (newObj_->GetLHS());
00108   delete (newObj_->GetRHS());
00109 
00110   // Create new multivectors that view into the current LHS / RHS
00111   Epetra_MultiVector * NewLHS = &((*LHSTrans_)( *OldLHS ));
00112   Epetra_MultiVector * NewRHS = &((*RHSTrans_)( *OldRHS ));
00113 
00114   // Set the new LHS / RHS
00115   newObj_->SetLHS( NewLHS );
00116   newObj_->SetRHS( NewRHS );
00117 
00118   return true;
00119 }
00120 
00121 } //namespace EpetraExt
00122 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines