40 Solver->SetUseTranspose(UseTranspose);
42 Solver->SetParameters(AmesosList);
46 A->Multiply(UseTranspose,*lhs,*rhs);
51 if (
Solver->SymbolicFactorization())
return(
false);
52 if (
Solver->NumericFactorization())
return(
false);
58 if (
Solver->Solve())
return(
false);
61 double d = 0.0, d_tot = 0.0;
65 d += ((*lhs)[j][i] - 1.0) * ((*lhs)[j][i] - 1.0);
67 A->Comm().SumAll(&d,&d_tot,1);
73 A->Multiply(UseTranspose, *lhs, Ax);
74 Ax.Update(1.0, *rhs, -1.0);
77 std::string msg = ProblemType;
79 if (!
A->Comm().MyPID())
81 std::cout << std::endl;
82 std::cout << msg <<
" : Using " <<
A->Comm().NumProc() <<
" processes, UseTranspose = " << UseTranspose << std::endl;
84 std::cout << msg <<
" : eq " << j
85 <<
", ||A x - b||_2 = " << Norm[j] << std::endl;
86 std::cout << msg <<
" : ||x_exact - x||_2 = " << sqrt(d_tot) << std::endl;
91 std::cerr << std::endl << msg <<
" WARNING : TEST FAILED!" << std::endl;
104 int main(
int argc,
char *argv[])
107 MPI_Init(&argc, &argv);
113 int NumGlobalRows = 100 * Comm.
NumProc();
126 for (
int LRID = 0 ; LRID < NumMyRows ; ++LRID)
128 int GRID = MyGlobalElements[LRID];
136 Indices[NumEntries] = GRID - 1;
137 Values[NumEntries] = -1.0;
140 if (GRID != NumGlobalRows - 1)
142 Indices[NumEntries] = GRID + 1;
143 Values[NumEntries] = -1.0;
157 std::vector<std::string> SolverType;
158 SolverType.push_back(
"Amesos_Lapack");
159 SolverType.push_back(
"Amesos_Klu");
160 SolverType.push_back(
"Amesos_Umfpack");
162 SolverType.push_back(
"Amesos_Taucs");
163 SolverType.push_back(
"Amesos_Superlu");
164 SolverType.push_back(
"Amesos_Superludist");
165 SolverType.push_back(
"Amesos_Mumps");
166 SolverType.push_back(
"Amesos_Dscpack");
167 SolverType.push_back(
"Amesos_Scalapack");
173 for (
unsigned int i = 0 ; i < SolverType.size() ; ++i)
175 std::string
Solver = SolverType[i];
183 &Matrix, &LHS, &RHS);
184 assert (res ==
true);
188 if (
Solver !=
"Amesos_Superludist") {
191 &Matrix, &LHS, &RHS);
192 assert (res ==
true);
199 std::cerr << std::endl;
200 std::cerr <<
"WARNING: SOLVER `" <<
Solver <<
"' NOT TESTED" << std::endl;
201 std::cerr << std::endl;
int main(int argc, char *argv[])
const Epetra_BlockMap & Map() const
int MyGlobalElements(int *MyGlobalElementList) const
void SetLHS(Epetra_MultiVector *X)
void SetOperator(Epetra_RowMatrix *A)
bool TestAmesos(char ProblemType[], Teuchos::ParameterList &AmesosList, bool UseTranspose, Epetra_RowMatrix *A, Epetra_MultiVector *lhs, Epetra_MultiVector *rhs)
int PutScalar(double ScalarConstant)
virtual int InsertGlobalValues(int GlobalRow, int NumEntries, const double *Values, const int *Indices)
int FillComplete(bool OptimizeDataStorage=true)
int NumMyElements() const
Factory for binding a third party direct solver to an Epetra_LinearProblem.
void SetRHS(Epetra_MultiVector *B)
Amesos_BaseSolver * Create(const char *ClassType, const Epetra_LinearProblem &LinearProblem)
Amesos Create method.
Amesos_BaseSolver: A pure virtual class for direct solution of real-valued double-precision operators...
bool Query(const char *ClassType)
Queries whether a given interface is available or not.