void Trilinos_Util_GenerateCrsProblem(int nx, int ny, int npoints, int * xoff, int * yoff,
const Epetra_Comm &comm,
Epetra_Map *& map,
Epetra_CrsMatrix *& A,
Epetra_Vector *& x,
Epetra_Vector *& b,
Epetra_Vector *&xexact, int indexBase) {
Epetra_MultiVector * x1, * b1, * xexact1;
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, 1, comm, map, A, x1, b1, xexact1, indexBase);
x = dynamic_cast<Epetra_Vector *>(x1);
b = dynamic_cast<Epetra_Vector *>(b1);
xexact = dynamic_cast<Epetra_Vector *>(xexact1);
return;
}
int main(int argc, char *argv[]) {
#ifdef EPETRA_MPI
MPI_Init(&argc,&argv);
Epetra_MpiComm comm (MPI_COMM_WORLD);
#else
Epetra_SerialComm comm;
#endif
int MyPID = comm.MyPID();
bool verbose = false;
bool verbose1 = false;
// Check if we should print results to standard out
if (argc > 1) {
if ((argv[1][0] == '-') && (argv[1][1] == 'v')) {
verbose1 = true;
if (MyPID==0) verbose = true;
}
}
if (verbose)
std::cout << EpetraExt::EpetraExt_Version() << std::endl << std::endl;
if (verbose1) std::cout << comm << std::endl;
// Uncomment the next three lines to debug in mpi mode
//int tmp;
//if (MyPID==0) cin >> tmp;
//comm.Barrier();
Epetra_Map * map;
Epetra_CrsMatrix * A;
Epetra_Vector * x;
Epetra_Vector * b;
Epetra_Vector * xexact;
int nx = 20*comm.NumProc();
int ny = 30;
int npoints = 7;
int xoff[] = {-1, 0, 1, -1, 0, 1, 0};
int yoff[] = {-1, -1, -1, 0, 0, 0, 1};
int ierr = 0;
// Call routine to read in HB problem 0-base
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, comm, map, A, x, b, xexact);
ierr += runTests(*map, *A, *x, *b, *xexact, verbose);
delete A;
delete x;
delete b;
delete xexact;
delete map;
// Call routine to read in HB problem 1-base
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, comm, map, A, x, b, xexact, 1);
ierr += runTests(*map, *A, *x, *b, *xexact, verbose);
delete A;
delete x;
delete b;
delete xexact;
delete map;
// Call routine to read in HB problem -1-base
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, comm, map, A, x, b, xexact, -1);
ierr += runTests(*map, *A, *x, *b, *xexact, verbose);
delete A;
delete x;
delete b;
delete xexact;
delete map;
int nx1 = 5;
int ny1 = 4;
Poisson2dOperator Op(nx1, ny1, comm);
ierr += runOperatorTests(Op, verbose);
generateHyprePrintOut("MyMatrixFile", comm);
EPETRA_CHK_ERR(EpetraExt::HypreFileToCrsMatrix("MyMatrixFile", comm, A));
runHypreTest(*A);
delete A;
#ifdef EPETRA_MPI
MPI_Finalize() ;
#endif
return(ierr);
}
int main(int argc, char *argv[]) {
int i;
#ifdef EPETRA_MPI
// Initialize MPI
MPI_Init(&argc,&argv);
Epetra_MpiComm comm(MPI_COMM_WORLD);
#else
Epetra_SerialComm comm;
#endif
// Uncomment to debug in parallel int tmp; if (comm.MyPID()==0) cin >> tmp; comm.Barrier();
bool verbose = false;
bool veryVerbose = false;
// Check if we should print results to standard out
if (argc>1) if (argv[1][0]=='-' && argv[1][1]=='v') verbose = true;
if (!verbose) comm.SetTracebackMode(0); // This should shut down any error traceback reporting
if (verbose) cout << comm << endl << flush;
bool verbose1 = verbose;
if (verbose) verbose = (comm.MyPID()==0);
int nx = 4;
int ny = comm.NumProc()*nx; // Scale y grid with number of processors
// Create funky stencil to make sure the matrix is non-symmetric (transpose non-trivial):
// (i-1,j-1) (i-1,j )
// (i ,j-1) (i ,j ) (i ,j+1)
// (i+1,j-1) (i+1,j )
int npoints = 2;
int xoff[] = {-1, 0, 1, -1, 0, 1, 0};
int yoff[] = {-1, -1, -1, 0, 0, 0, 1};
Epetra_Map * map;
Epetra_CrsMatrix * A;
Epetra_Vector * x, * b, * xexact;
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, comm, map, A, x, b, xexact);
if (verbose)
cout << "npoints = " << npoints << " nx = " << nx << " ny = " << ny << endl ;
if (verbose && nx<6 ) {
cout << *A << endl;
cout << "B = " << endl << *b << endl;
}
// Construct linear problem object
Epetra_LinearProblem origProblem(A, x, b);
Epetra_LinearProblem *redistProblem;
Epetra_Time timer(comm);
// Construct redistor object, use all processors and replicate full problem on each
double start = timer.ElapsedTime();
Epetra_LinearProblemRedistor redistor(&origProblem, comm.NumProc(), true);
if (verbose) cout << "\nTime to construct redistor = "
<< timer.ElapsedTime() - start << endl;
bool ConstructTranspose = true;
bool MakeDataContiguous = true;
start = timer.ElapsedTime();
redistor.CreateRedistProblem(ConstructTranspose, MakeDataContiguous, redistProblem);
if (verbose) cout << "\nTime to create redistributed problem = "
<< timer.ElapsedTime() - start << endl;
// Now test output of redistor by performing matvecs
int ierr = 0;
ierr += checkResults( ConstructTranspose, &redistor, &origProblem,
redistProblem, verbose);
// Now change values in original rhs and test update facility of redistor
// Multiply b by 2
double Value = 2.0;
b->Scale(Value); // b = 2*b
redistor.UpdateRedistRHS(b);
if (verbose) cout << "\nTime to update redistributed RHS = "
<< timer.ElapsedTime() - start << endl;
ierr += checkResults( ConstructTranspose, &redistor,
&origProblem, redistProblem, verbose);
// Now change values in original matrix and test update facility of redistor
#define CREATE_CONST_MATRIX
#ifdef CREATE_CONST_MATRIX
// The easiest way that I could find to change the matrix without EPETRA_CHK_ERRs
A->PutScalar(13.0);
#else
// This has no effect on matrices, such as when nx = 4, that have no
// diagonal entries. However, it does cause many EPETRA_CHK_ERR prints.
// Add 2 to the diagonal of each row
for (i=0; i< A->NumMyRows(); i++) {
// for (i=0; i < 1; i++)
cout << " i = " << i ;
A->SumIntoMyValues(i, 1, &Value, &i);
}
#endif
start = timer.ElapsedTime();
redistor.UpdateRedistProblemValues(&origProblem);
if (verbose) cout << "\nTime to update redistributed problem = "
<< timer.ElapsedTime() - start << endl;
ierr += checkResults(ConstructTranspose, &redistor, &origProblem, redistProblem, verbose);
delete A;
delete b;
delete x;
delete xexact;
delete map;
#ifdef EPETRA_MPI
MPI_Finalize();
#endif
return ierr;
}
int main(int argc, char *argv[])
{
int i;
#ifdef EPETRA_MPI
// Initialize MPI
MPI_Init(&argc,&argv);
Epetra_MpiComm comm(MPI_COMM_WORLD);
#else
Epetra_SerialComm comm;
#endif
// Uncomment to debug in parallel int tmp; if (comm.MyPID()==0) cin >> tmp; comm.Barrier();
bool verbose = false;
// Check if we should print results to standard out
if (argc>1) if (argv[1][0]=='-' && argv[1][1]=='v') verbose = true;
if (!verbose) comm.SetTracebackMode(0); // This should shut down any error traceback reporting
if (verbose) cout << comm << endl << flush;
if (verbose) verbose = (comm.MyPID()==0);
if (verbose)
cout << EpetraExt::EpetraExt_Version() << endl << endl;
int nx = 128;
int ny = comm.NumProc()*nx; // Scale y grid with number of processors
// Create funky stencil to make sure the matrix is non-symmetric (transpose non-trivial):
// (i-1,j-1) (i-1,j )
// (i ,j-1) (i ,j ) (i ,j+1)
// (i+1,j-1) (i+1,j )
int npoints = 7;
int xoff[] = {-1, 0, 1, -1, 0, 1, 0};
int yoff[] = {-1, -1, -1, 0, 0, 0, 1};
Epetra_Map * map;
Epetra_CrsMatrix * A;
Epetra_Vector * x, * b, * xexact;
Trilinos_Util_GenerateCrsProblem(nx, ny, npoints, xoff, yoff, comm, map, A, x, b, xexact);
if (nx<8)
{
cout << *A << endl;
cout << "X exact = " << endl << *xexact << endl;
cout << "B = " << endl << *b << endl;
}
// Construct transposer
Epetra_Time timer(comm);
double start = timer.ElapsedTime();
//bool IgnoreNonLocalCols = false;
bool MakeDataContiguous = true;
EpetraExt::RowMatrix_Transpose transposer( MakeDataContiguous );
if (verbose) cout << "\nTime to construct transposer = " << timer.ElapsedTime() - start << endl;
Epetra_CrsMatrix & transA = dynamic_cast<Epetra_CrsMatrix&>(transposer(*A));
start = timer.ElapsedTime();
if (verbose) cout << "\nTime to create transpose matrix = " << timer.ElapsedTime() - start << endl;
// Now test output of transposer by performing matvecs
int ierr = 0;
ierr += checkResults(A, &transA, xexact, verbose);
// Now change values in original matrix and test update facility of transposer
// Add 2 to the diagonal of each row
double Value = 2.0;
for (i=0; i< A->NumMyRows(); i++)
A->SumIntoMyValues(i, 1, &Value, &i);
start = timer.ElapsedTime();
transposer.fwd();
if (verbose) cout << "\nTime to update transpose matrix = " << timer.ElapsedTime() - start << endl;
ierr += checkResults(A, &transA, xexact, verbose);
delete A;
delete b;
delete x;
delete xexact;
delete map;
if (verbose) cout << endl << "Checking transposer for VbrMatrix objects" << endl<< endl;
int nsizes = 4;
int sizes[] = {4, 6, 5, 3};
Epetra_VbrMatrix * Avbr;
Epetra_BlockMap * bmap;
Trilinos_Util_GenerateVbrProblem(nx, ny, npoints, xoff, yoff, nsizes, sizes,
comm, bmap, Avbr, x, b, xexact);
if (nx<8)
{
cout << *Avbr << endl;
cout << "X exact = " << endl << *xexact << endl;
cout << "B = " << endl << *b << endl;
}
start = timer.ElapsedTime();
EpetraExt::RowMatrix_Transpose transposer1( MakeDataContiguous );
Epetra_CrsMatrix & transA1 = dynamic_cast<Epetra_CrsMatrix&>(transposer1(*Avbr));
if (verbose) cout << "\nTime to create transpose matrix = " << timer.ElapsedTime() - start << endl;
// Now test output of transposer by performing matvecs
;
ierr += checkResults(Avbr, &transA1, xexact, verbose);
// Now change values in original matrix and test update facility of transposer
// Scale matrix on the left by rowsums
Epetra_Vector invRowSums(Avbr->RowMap());
Avbr->InvRowSums(invRowSums);
Avbr->LeftScale(invRowSums);
start = timer.ElapsedTime();
transposer1.fwd();
if (verbose) cout << "\nTime to update transpose matrix = " << timer.ElapsedTime() - start << endl;
ierr += checkResults(Avbr, &transA1, xexact, verbose);
delete Avbr;
delete b;
delete x;
delete xexact;
delete bmap;
#ifdef EPETRA_MPI
MPI_Finalize();
#endif
return ierr;
}
