EpetraExt  Development
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
EpetraExt_Reindex_LinearProblem2.cpp
Go to the documentation of this file.
1 //@HEADER
2 // ***********************************************************************
3 //
4 // EpetraExt: Epetra Extended - Linear Algebra Services Package
5 // Copyright (2011) Sandia Corporation
6 //
7 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
8 // the U.S. Government retains certain rights in this software.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38 //
39 // ***********************************************************************
40 //@HEADER
41 
43 
46 
47 #include <Epetra_LinearProblem.h>
48 #include <Epetra_CrsMatrix.h>
49 #include <Epetra_MultiVector.h>
50 #include <Epetra_Map.h>
51 
52 namespace EpetraExt {
53 
56 {
57  if( newObj_ ) delete newObj_;
58 
59  if( MatTrans_ ) delete MatTrans_;
60  if( LHSTrans_ ) delete LHSTrans_;
61  if( RHSTrans_ ) delete RHSTrans_;
62 
63  if( NewRowMapOwned_ ) delete NewRowMap_;
64 }
65 
69 {
70  // Save original object
71  origObj_ = &orig;
72 
73  Epetra_CrsMatrix * OldMatrix = dynamic_cast<Epetra_CrsMatrix*>( orig.GetMatrix() );
74  Epetra_MultiVector * OldRHS = orig.GetRHS();
75  Epetra_MultiVector * OldLHS = orig.GetLHS();
76  const Epetra_BlockMap & OldRowMap = OldMatrix->Map();
77 
78  //If new map not passed in create one with lex ordering
79  if( !NewRowMap_ )
80  {
81  int NumMyElements = OldRowMap.NumMyElements();
82 
83 #ifndef EPETRA_NO_32BIT_GLOBAL_INDICES
84  if(OldRowMap.GlobalIndicesInt()) {
85  int NumGlobalElements = OldRowMap.NumGlobalElements();
86  NewRowMap_ = new Epetra_Map( NumGlobalElements, NumMyElements, 0, OldRowMap.Comm() );
87  }
88  else
89 #endif
90 #ifndef EPETRA_NO_64BIT_GLOBAL_INDICES
91  if(OldRowMap.GlobalIndicesLongLong()) {
92  long long NumGlobalElements = OldRowMap.NumGlobalElements64();
93  NewRowMap_ = new Epetra_Map( NumGlobalElements, NumMyElements, 0LL, OldRowMap.Comm() );
94  }
95  else
96 #endif
97  throw "LinearProblem_Reindex2::operator(): GlobalIndices type unknown";
98 
99  NewRowMapOwned_ = true;
100  }
101 
102  MatTrans_ = new CrsMatrix_Reindex( *NewRowMap_ );
103  LHSTrans_ = new MultiVector_Reindex( *NewRowMap_ );
104  RHSTrans_ = new MultiVector_Reindex( *NewRowMap_ );
105 
106  Epetra_CrsMatrix * NewMatrix = &((*MatTrans_)( *OldMatrix ));
107  Epetra_MultiVector * NewLHS = &((*LHSTrans_)( *OldLHS ));
108  Epetra_MultiVector * NewRHS = &((*RHSTrans_)( *OldRHS ));
109 
110  newObj_ = new Epetra_LinearProblem( NewMatrix, NewLHS, NewRHS );
111 
112  return *newObj_;
113 }
114 
116 {
117  Epetra_MultiVector * OldRHS = origObj_->GetRHS();
118  Epetra_MultiVector * OldLHS = origObj_->GetLHS();
119 
120  // Clean up x and b before creating new multivectors
121  delete (newObj_->GetLHS());
122  delete (newObj_->GetRHS());
123 
124  // Create new multivectors that view into the current LHS / RHS
125  Epetra_MultiVector * NewLHS = &((*LHSTrans_)( *OldLHS ));
126  Epetra_MultiVector * NewRHS = &((*RHSTrans_)( *OldRHS ));
127 
128  // Set the new LHS / RHS
129  newObj_->SetLHS( NewLHS );
130  newObj_->SetRHS( NewRHS );
131 
132  return true;
133 }
134 
135 } //namespace EpetraExt
136 
int NumGlobalElements() const
bool GlobalIndicesLongLong() const
bool fwd()
Forward transfer of data from orig object input in the operator() method call to the new object creat...
bool GlobalIndicesInt() const
int NumMyElements() const
NewTypeRef operator()(OriginalTypeRef orig)
Constructs a new view the original LP, &quot;reindexed&quot; using the given NewRowMap.
const Epetra_Comm & Comm() const
Given an Epetra_CrsMatrix, a &quot;reindexed&quot; version is returned based on the new row map...
Given an input Epetra_MultiVector, a &quot;reindexed&quot; view is returned.
const Epetra_BlockMap & Map() const