Amesos_Superlu.h

Go to the documentation of this file.

// @HEADER
// ***********************************************************************
//
//                Amesos: Direct Sparse Solver Package
//                 Copyright (2004) 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.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
// @HEADER
 
//
//  Coding tasks:
//  1)  Create the dense matrices in Solve()   DONE
//  2)  Make the call to dgsvx() in Factor() dONE
//  3)  Make the call to dgsvx() in Solve()  DONE
//
//  Later coding tasks:
//  0)  Factor called twice
//  1)  Refactor()
//  2)  Parameter list
//  3)  Transpose  - DONE
//  4)  Destructor - In particular, need to call the SuperLU_FREE routines.
//  5)  Coments - especially in Amesos_Superlu.h
//
//  SymbolicFactorization() performs no action other than making sure that Factorization
//    s performed
//  NumericFactorization() performs the factorization but no solve (right hand side is
//    is set to 0 vectors) reuses factors only if ReuseFactorization_ is set.
//    If FactorizationOK_() && ReuseSymbolic_
//       ReFactor()
//    else
//       Factor()
//
//  Solve()
//
//  Factor() does everything from scratch:
//    Redistributes the data if necessary
//      Deletes any data structures left over from the previous call to Factor()
//    Copies the data into the format that SuperLU wants it
//    Calls dgssvx to factor the matrix with factor set to true
//  ReFactor()
//    Redistributes the data if necessary
//      - Attempting to check to make sure that the non-zero structure is unchanged
//    Copies the data into the format that SuperLU already has it
//       FIRST PASS - assert( false )
//
 
#ifndef AMESOS_SUPERLU_H
#define AMESOS_SUPERLU_H
 
#include "Amesos_ConfigDefs.h"
#include "Amesos_BaseSolver.h"
#include "Amesos_NoCopiable.h"
#include "Amesos_Utils.h"
#include "Amesos_Time.h"
#include "Amesos_Status.h"
#include "Amesos_Control.h"
#include "Teuchos_RCP.hpp"
 
class SLUData;
class Epetra_Comm;
class Epetra_CrsMatrix;
class Epetra_LinearProblem;
 
 
class Amesos_Superlu: public Amesos_BaseSolver,
                      private Amesos_Time,
                      private Amesos_NoCopiable,
                      private Amesos_Utils,
                      private Amesos_Control,
                      private Amesos_Status {
 
public:
 
 
  Amesos_Superlu(const Epetra_LinearProblem& LinearProblem );
 
  ~Amesos_Superlu();
 
 
 
  int SymbolicFactorization();
 
  int NumericFactorization();
 
  int Solve();
 
 
 
  const Epetra_LinearProblem *GetProblem() const { return(Problem_); };
 
  bool MatrixShapeOK() const ;
 
  int SetUseTranspose (bool useTheTranspose) {
    UseTranspose_ = useTheTranspose; return(0);
  }
 
  bool UseTranspose() const {return(UseTranspose_);};
 
  const Epetra_Comm& Comm() const {return(GetProblem()->GetOperator()->Comm());};
 
  int SetParameters( Teuchos::ParameterList &ParameterList )  ;
 
  int NumSymbolicFact() const { return( Amesos_Status::NumSymbolicFact_ ); }
 
  int NumNumericFact() const { return( Amesos_Status::NumNumericFact_ ); }
 
  int NumSolve() const { return( Amesos_Status::NumSolve_ ); }
 
  void PrintTiming() const;
 
  void PrintStatus() const;
 
  void GetTiming( Teuchos::ParameterList &TimingParameterList ) const { Amesos_Time::GetTiming(TimingParameterList); }
 
private:
 
 
 
  // Note: this method is delicate!
  const Epetra_Map& SerialMap() const
  {
    return(*(SerialMap_.get()));
  }
 
  // Note: this method is delicate!
  const Epetra_Import& ImportToSerial() const
  {
    return(*(ImportToSerial_.get()));
  }
 
  int Factor();
  int ReFactor();
 
  int ConvertToSerial();
 
  // Note:  All action is performed on process 0
  int PerformNumericFactorization();
 
 
  SLUData* data_;
  std::vector<double> berr_;
  std::vector<double> ferr_;
  std::vector<int> perm_r_;
  std::vector<int> perm_c_;
  std::vector<int> etree_;
  std::vector<double> R_;
  std::vector<double> C_;
  char equed_;
  // no idea of the following.
  double* DummyArray;
 
  std::vector <int> Ap_;
  std::vector <int> Ai_;
  std::vector <double> Aval_;
  long long NumGlobalRows_;
  long long NumGlobalNonzeros_;
  bool UseTranspose_;
  bool FactorizationOK_;
  bool FactorizationDone_;
  bool ReuseSymbolic_;
  int iam_;
  int MtxConvTime_, MtxRedistTime_, VecRedistTime_;
  int NumFactTime_, SolveTime_, OverheadTime_;
  Teuchos::RCP<Epetra_Map> SerialMap_;
  Teuchos::RCP<Epetra_CrsMatrix> SerialCrsMatrixA_;
  Teuchos::RCP<Epetra_Import> ImportToSerial_;
  Epetra_RowMatrix* SerialMatrix_ ;
  const Epetra_LinearProblem* Problem_;
  Epetra_RowMatrix* RowMatrixA_;
 
};  // End of  class Amesos_Superlu
#endif /* AMESOS_SUPERLU_H */