Didasko  Development
 All Classes Namespaces Files Functions Variables Pages
// @HEADER
// ***********************************************************************
//
// Didasko Tutorial Package
// Copyright (2005) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions about Didasko? Contact Marzio Sala (marzio.sala _AT_ gmail.com)
//
// ***********************************************************************
// @HEADER
// Use of Epetra_FECrsMatrix
// This code should be run with at least two processes
#include "Didasko_ConfigDefs.h"
#ifdef HAVE_DIDASKO_EPETRA
#include "Epetra_ConfigDefs.h"
#ifdef HAVE_MPI
#include "mpi.h"
#include "Epetra_MpiComm.h"
#else
#include "Epetra_SerialComm.h"
#endif
#include "Epetra_Map.h"
#include "Epetra_Vector.h"
#include "Epetra_FECrsMatrix.h"
// =========== //
// main driver //
// ----------- //
int main(int argc, char *argv[]) {
#ifdef HAVE_MPI
MPI_Init(&argc, &argv);
Epetra_MpiComm Comm(MPI_COMM_WORLD);
#else
#endif
// Create a linear map of size 10 (could be any number > 1)
//
// Note that a linear map is distributed approximately evenly over
// all processors.
//
int NumGlobalElements = 10;
Epetra_Map Map(NumGlobalElements,0,Comm);
// create a diagonal FE crs matrix (one nonzero per row)
Epetra_FECrsMatrix A(Copy,Map,1);
// Next, set the matrix entries.
//
// Note 1: Matrix entries are only contributed from processor
// 0, regardless of how many processors the program is running on.
// Proc 0 fills the entire global matrix. Data that belongs in
// matrix rows owned by procs 1 .. numprocs-1 gets sent to those
// processors during the call to 'A.GlobalAssemble()' below.
//
// Note 2: We fill the matrix using 'InsertGlobalValues'. An
// alternative approach that would be more efficient for large
// matrices in most cases would be to first create and fill a
// graph (Epetra_FECrsGraph), then construct the matrix with the
// graph (after calling graph.FillComplete) and fill the matrix
// using the method 'SumIntoGlobalValues'.
//
if( Comm.MyPID() == 0 ) {
for( int i=0 ; i<NumGlobalElements ; ++i ) {
int index = i;
double value = 1.0*i;
A.InsertGlobalValues(1,&index,&value);
}
}
A.GlobalAssemble();
cout << A;
#ifdef HAVE_MPI
MPI_Finalize();
#endif
return(EXIT_SUCCESS);
}
#else
#include <stdlib.h>
#include <stdio.h>
#ifdef HAVE_MPI
#include "mpi.h"
#endif
int main(int argc, char *argv[])
{
#ifdef HAVE_MPI
MPI_Init(&argc,&argv);
#endif
puts("Please configure Didasko with:\n"
"--enable-epetra");
#ifdef HAVE_MPI
MPI_Finalize();
#endif
return 0;
}
#endif