This file is indexed.

/usr/include/trilinos/ROL_BelosKrylov.hpp is in libtrilinos-rol-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
// @HEADER
// ************************************************************************
//
//               Rapid Optimization Library (ROL) Package
//                 Copyright (2014) 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 lead developers:
//              Drew Kouri   (dpkouri@sandia.gov) and
//              Denis Ridzal (dridzal@sandia.gov)
//
// ************************************************************************
// @HEADER


/** 
    \class BelosKrylov
    \brief Provides interface for using ROL::Vector with Belos solvers
                
    \author Created by Greg von Winckel
*/


#ifndef ROL_BELOS_KRYLOV_HPP
#define ROL_BELOS_KRYLOV_HPP

#include "BelosSolverFactory.hpp"   
#include "BelosSolverManager.hpp"   

#include "ROL_Krylov.hpp"
#include "ROL_BelosMultiVector.hpp"
#include "ROL_BelosOperator.hpp"
#include "ROL_MultiVectorDefault.hpp"

namespace ROL {

    template<class Real>
    class BelosKrylov : public Krylov<Real> {
        typedef Real                      ST;
        typedef LinearOperator<ST>        OP;
        typedef Vector<Real>              V; 
        typedef MultiVector<ST>           MV;
        typedef MultiVectorDefault<ST>    MVD;

        // For testing
	typedef Belos::MultiVecTraits<ST,MV>    MVT;
        typedef Belos::OperatorTraits<ST,MV,OP> OPT;

        private:

            Belos::SolverFactory<ST,MV,OP> factory_;
            Teuchos::RCP<Belos::SolverManager<ST,MV,OP> > solver_;
            Teuchos::RCP<Belos::LinearProblem<ST,MV,OP> > problem_;  

        public:
           
            /// \brief Create a Belos solver 
            BelosKrylov(Teuchos::ParameterList &parlist) : 
                problem_(Teuchos::rcp(new Belos::LinearProblem<ST,MV,OP>)) {

                Teuchos::RCP<Teuchos::ParameterList> solverParams = Teuchos::rcp(new Teuchos::ParameterList());

                // Options likely to be of interest include CG, MINRES, GMRES, and RCG
                int blockSize          = 1; // Only support single solution & single RHS for now 
                std::string solverName = parlist.get("Krylov Method","MINRES");  
                int maxit              = parlist.get("Maximum Number of Krylov Iterations",50);
                Real abstol            = parlist.get("Absolute Krylov Tolerance",1.e-4);
                int numVectors         = parlist.get("Number of Stored Vectors",3);
 
                solverParams->setName("Belos input parameters"); 
                solverParams->set("Block Size",blockSize);
                solverParams->set("Maximum Iterations",maxit);
                solverParams->set("Convergence Tolerance",abstol);  
                solverParams->set("Num Blocks",numVectors);

                solver_ = factory_.create(solverName,solverParams);                 
            }


            /// \brief Compute solution vector
            void run( V &x, OP& A, const V &b, OP &M, int &iter, int &flag )  {

                using Teuchos::RCP;
                using Teuchos::rcp;
                using Teuchos::rcpFromRef;


                // Get pointers to ROL::Vectors
                RCP<V>        xp = Teuchos::rcpFromRef(x);

                // Wasteful, but have not yet implemented const case for MV
                RCP<V>        bp = b.clone();
                bp->set(b);

                // Make ROL::MultiVectors from the pointers to ROL::Vectors
                RCP<MV> xmvp = rcp(new MultiVectorDefault<Real>(xp));
                RCP<MV> bmvp = rcp(new MultiVectorDefault<Real>(bp));

                RCP<OP> Ap = Teuchos::rcpFromRef(A);
                RCP<OP> Mp = Teuchos::rcpFromRef(M);

                // Wrap x and b in ROL::MultiVector objects 
                MVD xmv(xp);
                MVD bmv(bp);
 
                problem_->setOperator(Ap);
                problem_->setLeftPrec(Mp);
                problem_->setProblem(xmvp,bmvp);

                solver_->setProblem(problem_);

                flag = static_cast<int>(solver_->solve());

                iter = solver_->getNumIters();
            }
    };
}

#endif