Ifpack_ILUT.h

/*@HEADER
// ***********************************************************************
//
//       Ifpack: Object-Oriented Algebraic Preconditioner Package
//                 Copyright (2002) 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? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
//@HEADER
*/
 
#ifndef IFPACK_ILUT_H
#define IFPACK_ILUT_H
 
#if defined(Ifpack_SHOW_DEPRECATED_WARNINGS)
#ifdef __GNUC__
#warning "The Ifpack package is deprecated"
#endif
#endif
 
#include "Ifpack_ConfigDefs.h"
#include "Ifpack_CondestType.h"
#include "Ifpack_ScalingType.h"
#include "Ifpack_Preconditioner.h"
#include "Epetra_Vector.h"
#include "Epetra_CrsMatrix.h"
#include "Epetra_Time.h"
#include "Teuchos_RefCountPtr.hpp"
 
class Epetra_RowMatrix;
class Epetra_SerialComm;
class Epetra_Comm;
class Epetra_Map;
class Epetra_MultiVector;
 
namespace Teuchos {
  class ParameterList;
}
 
 
class Ifpack_ILUT: public Ifpack_Preconditioner {
 
public:
  // @{ Constructors and Destructors
  Ifpack_ILUT(const Epetra_RowMatrix* A);
 
  virtual ~Ifpack_ILUT();
 
  // @}
  // @{ Construction methods
  /* This method is only available if the Teuchos package is enabled.
     This method recognizes five parameter names: level_fill, drop_tolerance,
     absolute_threshold, relative_threshold and overlap_mode. These names are
     case insensitive. For level_fill the ParameterEntry must have type int, the
     threshold entries must have type double and overlap_mode must have type
     Epetra_CombineMode.
  */
  int SetParameters(Teuchos::ParameterList& parameterlis);
 
 
  int Initialize();
 
  bool IsInitialized() const
  {
    return(IsInitialized_);
  }
 
 
  int Compute();
 
  bool IsComputed() const {return(IsComputed_);};
 
  // Mathematical functions.
 
 
  int ApplyInverse(const Epetra_MultiVector& X, Epetra_MultiVector& Y) const;
 
  int Apply(const Epetra_MultiVector& X, Epetra_MultiVector& Y) const;
 
  double Condest(const Ifpack_CondestType CT = Ifpack_Cheap,
                 const int MaxIters = 1550,
                 const double Tol = 1e-9,
                 Epetra_RowMatrix* Matrix_in = 0);
 
  double Condest() const
  {
    return(Condest_);
  }
 
 
  int SetUseTranspose(bool UseTranspose_in) {UseTranspose_ = UseTranspose_in; return(0);};
 
  double NormInf() const {return(0.0);};
 
  bool HasNormInf() const {return(false);};
 
  bool UseTranspose() const {return(UseTranspose_);};
 
  const Epetra_Map & OperatorDomainMap() const {return(A_.OperatorDomainMap());};
 
  const Epetra_Map & OperatorRangeMap() const{return(A_.OperatorRangeMap());};
 
  const Epetra_Comm & Comm() const{return(Comm_);};
 
  const Epetra_RowMatrix& Matrix() const
  {
    return(A_);
  }
 
  const Epetra_CrsMatrix & L() const {return(*L_);};
 
  const Epetra_CrsMatrix & U() const {return(*U_);};
 
  const char* Label() const
  {
    return(Label_.c_str());
  }
 
  int SetLabel(const char* Label_in)
  {
    Label_ = Label_in;
    return(0);
  }
 
  virtual std::ostream& Print(std::ostream& os) const;
 
  virtual int NumInitialize() const
  {
    return(NumInitialize_);
  }
 
  virtual int NumCompute() const
  {
    return(NumCompute_);
  }
 
  virtual int NumApplyInverse() const
  {
    return(NumApplyInverse_);
  }
 
  virtual double InitializeTime() const
  {
    return(InitializeTime_);
  }
 
  virtual double ComputeTime() const
  {
    return(ComputeTime_);
  }
 
  virtual double ApplyInverseTime() const
  {
    return(ApplyInverseTime_);
  }
 
  virtual double InitializeFlops() const
  {
    return(0.0);
  }
 
  virtual double ComputeFlops() const
  {
    return(ComputeFlops_);
  }
 
  virtual double ApplyInverseFlops() const
  {
    return(ApplyInverseFlops_);
  }
 
  inline double LevelOfFill() const {
    return(LevelOfFill_);
  }
 
  inline double RelaxValue() const {
    return(Relax_);
  }
 
  inline double AbsoluteThreshold() const
  {
    return(Athresh_);
  }
 
  inline double RelativeThreshold() const
  {
    return(Rthresh_);
  }
 
  inline double DropTolerance() const
  {
    return(DropTolerance_);
  }
 
#ifndef EPETRA_NO_32BIT_GLOBAL_INDICES
  int NumGlobalNonzeros() const {
    // FIXME: diagonal of L_ should not be stored
    return(L().NumGlobalNonzeros() + U().NumGlobalNonzeros() - L().NumGlobalRows());
  }
#endif
  long long NumGlobalNonzeros64() const {
    // FIXME: diagonal of L_ should not be stored
    return(L().NumGlobalNonzeros64() + U().NumGlobalNonzeros64() - L().NumGlobalRows64());
  }
 
  int NumMyNonzeros() const {
    return(L().NumMyNonzeros() + U().NumMyNonzeros());
  }
 
private:
 
  // @}
  // @{ Internal methods
 
  Ifpack_ILUT(const Ifpack_ILUT& RHS) :
    A_(RHS.Matrix()),
    Comm_(RHS.Comm()),
    Time_(Comm())
  {};
 
  Ifpack_ILUT& operator=(const Ifpack_ILUT& /* RHS */)
  {
    return(*this);
  }
 
  template<typename int_type>
  int TCompute();
 
  void Destroy();
 
  // @}
  // @{ Internal data
 
  const Epetra_RowMatrix& A_;
  const Epetra_Comm& Comm_;
  Teuchos::RefCountPtr<Epetra_CrsMatrix> L_;
  Teuchos::RefCountPtr<Epetra_CrsMatrix> U_;
  double Condest_;
  double Relax_;
  double Athresh_;
  double Rthresh_;
  double LevelOfFill_;
  double DropTolerance_;
  std::string Label_;
  bool IsInitialized_;
  bool IsComputed_;
  bool UseTranspose_;
  int NumMyRows_;
  int NumInitialize_;
  int NumCompute_;
  mutable int NumApplyInverse_;
  double InitializeTime_;
  double ComputeTime_;
  mutable double ApplyInverseTime_;
  double ComputeFlops_;
  mutable double ApplyInverseFlops_;
  mutable Epetra_Time Time_;
  long long GlobalNonzeros_;
  Teuchos::RefCountPtr<Epetra_SerialComm> SerialComm_;
  Teuchos::RefCountPtr<Epetra_Map> SerialMap_;
}; // Ifpack_ILUT
 
#endif /* IFPACK_ILUT_H */