/usr/include/trilinos/Ifpack_AMDReordering.h is in libtrilinos-ifpack-dev 12.10.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 | /*@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_AMDREORDERING_H
#define IFPACK_AMDREORDERING_H
#include "Ifpack_ConfigDefs.h"
#include "Ifpack_Reordering.h"
namespace Teuchos {
class ParameterList;
}
class Ifpack_Graph;
class Epetra_MultiVector;
class Epetra_RowMatrix;
//! Ifpack_AMDReordering: approximate minimum degree reordering.
class Ifpack_AMDReordering : public Ifpack_Reordering {
public:
//! Constructor for Ifpack_Graph's.
Ifpack_AMDReordering();
//! Copy Constructor.
Ifpack_AMDReordering(const Ifpack_AMDReordering& RHS);
//! Assignment operator.
Ifpack_AMDReordering& operator=(const Ifpack_AMDReordering& RHS);
//! Destructor.
virtual ~Ifpack_AMDReordering() {};
//! Sets integer parameters `Name'.
int SetParameter(const std::string Name, const int Value);
//! Sets double parameters `Name'.
int SetParameter(const std::string Name, const double Value);
//! Sets all parameters.
int SetParameters(Teuchos::ParameterList& List);
//! Computes all it is necessary to initialize the reordering object.
int Compute(const Ifpack_Graph& Graph);
//! Computes all it is necessary to initialize the reordering object.
int Compute(const Epetra_RowMatrix& Matrix);
//! Returns \c true is the reordering object has been successfully initialized, false otherwise.
bool IsComputed() const
{
return(IsComputed_);
}
//! Returns the reordered index of row \c i.
inline int Reorder(const int i) const;
//! Returns the inverse reordered index of row \c i.
inline int InvReorder(const int i) const;
//! Applies reordering to multivector X, whose local length equals the number of local rows.
int P(const Epetra_MultiVector& Xorig,
Epetra_MultiVector& Xreord) const;
//! Applies inverse reordering to multivector X, whose local length equals the number of local rows.
int Pinv(const Epetra_MultiVector& Xorig,
Epetra_MultiVector& Xinvreord) const;
//! Prints basic information on iostream. This function is used by operator<<.
std::ostream& Print(std::ostream& os) const;
//! Returns the number of local rows.
int NumMyRows() const
{
return(NumMyRows_);
}
private:
//! Number of local rows in the graph.
int NumMyRows_;
//! If \c true, the reordering has been successfully computed.
bool IsComputed_;
//! Contains the reordering.
std::vector<int> Reorder_;
//! Contains the inverse reordering.
std::vector<int> InvReorder_;
};
#endif
|