Ifpack_ReorderFilter.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_REORDERFILTER_H
#define IFPACK_REORDERFILTER_H
 
#if defined(Ifpack_SHOW_DEPRECATED_WARNINGS)
#ifdef __GNUC__
#warning "The Ifpack package is deprecated"
#endif
#endif
 
#include "Ifpack_ConfigDefs.h"
#include "Epetra_RowMatrix.h"
#include "Teuchos_RefCountPtr.hpp"
 
class Epetra_Comm;
class Epetra_Map;
class Epetra_MultiVector;
class Epetra_Import;
class Epetra_BlockMap;
class Ifpack_Reordering;
 
 
class Ifpack_ReorderFilter : public virtual Epetra_RowMatrix {
 
public:
  // Constructor.
  Ifpack_ReorderFilter(const Teuchos::RefCountPtr<Epetra_RowMatrix>& Matrix_in,
               const Teuchos::RefCountPtr<Ifpack_Reordering>& Reordering_in);
 
  Ifpack_ReorderFilter(const Ifpack_ReorderFilter& RHS);
 
  virtual ~Ifpack_ReorderFilter() {};
 
  Ifpack_ReorderFilter& operator=(const Ifpack_ReorderFilter& RHS);
 
  virtual inline int NumMyRowEntries(int MyRow, int & NumEntries) const
  {
    return(Matrix()->NumMyRowEntries(MyRow, NumEntries));
  }
 
  virtual int MaxNumEntries() const
  {
    return(MaxNumEntries_);
  }
  
  // Extracts a copy of the given row for the reordered matrix.
  virtual int ExtractMyRowCopy(int MyRow, int Length, int & NumEntries, double *Values, int * Indices) const;
 
  virtual int ExtractDiagonalCopy(Epetra_Vector & Diagonal) const;
 
  virtual int Multiply(bool TransA, const Epetra_MultiVector& X, 
               Epetra_MultiVector& Y) const;
 
  virtual int Solve(bool Upper, bool Trans, bool UnitDiagonal, 
            const Epetra_MultiVector& X,
            Epetra_MultiVector& Y) const;
 
  virtual int Apply(const Epetra_MultiVector& X,
            Epetra_MultiVector& Y) const;
 
  virtual int ApplyInverse(const Epetra_MultiVector& /* X */,
               Epetra_MultiVector& /* Y */) const
  {
    return(-1);
  }
 
  virtual int InvRowSums(Epetra_Vector& /* x */) const
  {
    return(-1);
  }
 
  virtual int LeftScale(const Epetra_Vector& /* x */)
  {
    return(-1);
  }
 
  virtual int InvColSums(Epetra_Vector& /* x */) const
  {
    return(-1);
  }
 
  virtual int RightScale(const Epetra_Vector& /* x */) 
  {
    return(-1);
  }
 
  virtual bool Filled() const
  {
    return(Matrix()->Filled());
  }
 
  virtual double NormInf() const
  {
    return(-1.0);
  }
 
  virtual double NormOne() const
  {
    return(-1.0);
  }
 
#ifndef EPETRA_NO_32BIT_GLOBAL_INDICES
 
  virtual int NumGlobalNonzeros() const
  {
    return(Matrix()->NumGlobalNonzeros());
  }
 
  virtual int NumGlobalRows() const
  {
    return(Matrix()->NumGlobalRows());
  }
 
  virtual int NumGlobalCols() const
  {
    return(Matrix()->NumGlobalCols());
  }
 
  virtual int NumGlobalDiagonals() const
  {
    return(Matrix()->NumGlobalDiagonals());
  }
#endif
 
  virtual long long NumGlobalNonzeros64() const
  {
    return(Matrix()->NumGlobalNonzeros64());
  }
 
  virtual long long NumGlobalRows64() const
  {
    return(Matrix()->NumGlobalRows64());
  }
 
  virtual long long NumGlobalCols64() const
  {
    return(Matrix()->NumGlobalCols64());
  }
 
  virtual long long NumGlobalDiagonals64() const
  {
    return(Matrix()->NumGlobalDiagonals64());
  }
 
  virtual int NumMyNonzeros() const
  {
    return(Matrix()->NumMyNonzeros());
  }
 
  virtual int NumMyRows() const
  {
    return(Matrix()->NumMyRows());
  }
 
  virtual int NumMyCols() const
  {
    return(Matrix()->NumMyCols());
  }
 
  virtual int NumMyDiagonals() const
  {
    return(Matrix()->NumMyDiagonals());
  }
 
  virtual bool LowerTriangular() const
  {
    return(false);
  }
 
  virtual bool UpperTriangular() const
  {
    return(false);
  }
 
  virtual const Epetra_Map & RowMatrixRowMap() const
  {
    return(Matrix()->RowMatrixRowMap());
  }
 
  virtual const Epetra_Map & RowMatrixColMap() const
  {
    return(Matrix()->RowMatrixColMap());
  }
 
  virtual const Epetra_Import * RowMatrixImporter() const
  {
    return(Matrix()->RowMatrixImporter());
  }
 
  int SetUseTranspose(bool UseTranspose_in)
  {
    return(Matrix()->SetUseTranspose(UseTranspose_in));
  }
 
  bool UseTranspose() const 
  {
    return(Matrix()->UseTranspose());
  }
  
  bool HasNormInf() const
  {
    return(true);
  }
 
  const Epetra_Comm & Comm() const
  {
    return(Matrix()->Comm());
  }
 
  const Epetra_Map & OperatorDomainMap() const 
  {
    return(Matrix()->OperatorDomainMap());
  }
 
  const Epetra_Map & OperatorRangeMap() const 
  {
    return(Matrix()->OperatorRangeMap());
  }
 
  const Epetra_BlockMap& Map() const 
  {
    return(Matrix()->Map());
  }
 
  const char* Label() const{
    return(Label_);
  }
 
  inline Teuchos::RefCountPtr<Epetra_RowMatrix> Matrix() const {
    return(A_);
  }
 
  inline Teuchos::RefCountPtr<Ifpack_Reordering> Reordering() const {
    return(Reordering_);
  }
 
private:
 
  Teuchos::RefCountPtr<Epetra_RowMatrix> A_;
  Teuchos::RefCountPtr<Ifpack_Reordering> Reordering_;
 
  int NumMyRows_;
  int MaxNumEntries_;
  char Label_[80];
 
};
 
 
#endif /* IFPACK_DROPFILTER_H */