This file is indexed.

/usr/include/trilinos/Ifpack_LinePartitioner.h is in libtrilinos-ifpack-dev 12.12.1-5.

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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
/*@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_LINEPARTITIONER_H
#define IFPACK_LINEPARTITIONER_H

#include "Ifpack_ConfigDefs.h"
#include "Ifpack_Partitioner.h"
#include "Ifpack_OverlappingPartitioner.h"
#include "Ifpack_Graph_Epetra_RowMatrix.h"
#include "Teuchos_ParameterList.hpp"
class Epetra_Comm;
class Ifpack_Graph;
class Epetra_Map;
class Epetra_BlockMap;
class Epetra_Import;
class Epetra_RowMatrix;

/* \brief Ifpack_LinePartitioner: A class to define partitions into a set of lines.

These "line" partitions could then be used in to do block Gauss-Seidel smoothing, for instance.

The current implementation uses a local (on processor) line detection in one of two forms.
Both are inspired by the work of Mavriplis for convection-diffusion (AIAA Journal, Vol 37(10), 1999).  


Algorithm 1: Matrix entries

Here we use the matrix entries, running lines across the "large" matrix entries, if they are sufficiently
large relative to the small ones.


Algorithms 2: Coordinates

Here we use coordinate information to pick "close" points if they are sufficiently far away
from the "far" points.  We also make sure the line can never double back on itself, so that
the associated sub-matrix could (in theory) be handed off to a fast triangular solver.  This 
implementation doesn't actual do that, however.

This implementation is deived from the related routine in ML.


Supported parameters:
  \c "partitioner: line type": "matrix entries" or "coordinates" (char *)
  \c "partitioner: line detection threshold": if ||x_j - x_i||^2 < thresh * max_k||x_k - x_i||^2, then the points are close enough to line smooth (double)
  \c "partitioner: x-coordinates": x coordinates of local nodes (double *)
  \c "partitioner: y-coordinates": y coordinates of local nodes (double *)
  \c "partitioner: z-coordinates": z coordinates of local nodes (double *)
  \c "partitioner: PDE equations": number of equations per node (integer)

*/

class Ifpack_LinePartitioner : public Ifpack_OverlappingPartitioner {

public:
  // Useful typedef
  typedef enum {COORDINATES=0, MATRIX_ENTRIES,} LINE_MODE;


  //! Constructor.
  Ifpack_LinePartitioner(const Ifpack_Graph* Graph) :
  Ifpack_OverlappingPartitioner(Graph),
    Matrix_(0),
    mode_(COORDINATES),
    NumEqns_(1),
    xcoord_(0),
    ycoord_(0),
    zcoord_(0),
    threshold_(0.0)    
  {
	
  }

 Ifpack_LinePartitioner(const Epetra_RowMatrix* Matrix) :
  Ifpack_OverlappingPartitioner(0),
    Matrix_(Matrix),
    mode_(COORDINATES),
    NumEqns_(1),
    xcoord_(0),
    ycoord_(0),
    zcoord_(0),
    threshold_(0.0)    
  {    
    GraphWrapper_ = Teuchos::rcp(new Ifpack_Graph_Epetra_RowMatrix(Teuchos::rcp(Matrix,false)));
    Graph_ = &*GraphWrapper_;
	    
  }


  //! Destructor.
  virtual ~Ifpack_LinePartitioner() {}

  //! Sets all the parameters for the partitioner
  int SetPartitionParameters(Teuchos::ParameterList& List)
  {
    std::string mymode;
    mode_=COORDINATES;
    mymode = List.get("partitioner: line mode",mymode);
    if(mymode=="coordinates")         mode_=COORDINATES;
    else if(mymode=="matrix entries") mode_=MATRIX_ENTRIES;

    threshold_ = List.get("partitioner: line detection threshold",threshold_);
    if(threshold_ < 0.0)  IFPACK_CHK_ERR(-1);
    if(mode_==COORDINATES && threshold_ > 1.0)  IFPACK_CHK_ERR(-1);


    NumEqns_   = List.get("partitioner: PDE equations",NumEqns_);
    if(NumEqns_ < 1 )  IFPACK_CHK_ERR(-2);
    
    xcoord_   = List.get("partitioner: x-coordinates",xcoord_);
    ycoord_   = List.get("partitioner: y-coordinates",ycoord_);
    zcoord_   = List.get("partitioner: z-coordinates",zcoord_);
    if(mode_==COORDINATES && !xcoord_ && !ycoord_ && !zcoord_) IFPACK_CHK_ERR(-3);

    return(0);
  }

  //! Computes the partitions. Returns 0 if successful.
  int ComputePartitions();

private:

  // Useful functions
  int Compute_Blocks_AutoLine(int * blockIndices) const;
  void local_automatic_line_search(int NumEqns, int * blockIndices, int last, int next, int LineID, double tol, int *itemp, double * dtemp) const;

  // Stuff I allocated
  Teuchos::RCP<const Ifpack_Graph> GraphWrapper_;

  // User data
  const Epetra_RowMatrix* Matrix_;
  LINE_MODE mode_;
  int NumEqns_;
  double * xcoord_;
  double * ycoord_;
  double * zcoord_;
  double threshold_;


  // State data
};

#endif // IFPACK_LINEPARTITIONER_H