/usr/include/trilinos/Teko_InvLSCStrategy.hpp is in libtrilinos-teko-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 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 | /*
// @HEADER
//
// ***********************************************************************
//
// Teko: A package for block and physics based preconditioning
// Copyright 2010 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// 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 Eric C. Cyr (eccyr@sandia.gov)
//
// ***********************************************************************
//
// @HEADER
*/
#ifndef __Teko_InvLSCStrategy_hpp__
#define __Teko_InvLSCStrategy_hpp__
#include "Teko_LSCStrategy.hpp"
namespace Teko {
namespace NS {
class LSCPrecondState; // forward declration
/** \brief A strategy that takes a single inverse factory and
* uses that for all inverses. If no mass matrix is
* passed in the diagonal of the 1,1 block is used.
*
* A strategy that takes a single inverse factory and uses that
* for all inverses. Optionally the mass matrix can be passed
* in, if it is the diagonal is extracted and that is used to
* form the inverse approximation.
*/
class InvLSCStrategy : public LSCStrategy {
public:
//! \name Constructors
//@{
InvLSCStrategy();
InvLSCStrategy(const Teuchos::RCP<InverseFactory> & factory,
bool rzn=false);
InvLSCStrategy(const Teuchos::RCP<InverseFactory> & factory,
LinearOp & mass,bool rzn=false);
InvLSCStrategy(const Teuchos::RCP<InverseFactory> & invFactF,
const Teuchos::RCP<InverseFactory> & invFactS,
bool rzn=false);
InvLSCStrategy(const Teuchos::RCP<InverseFactory> & invFactF,
const Teuchos::RCP<InverseFactory> & invFactS,
LinearOp & mass,bool rzn=false);
//@}
virtual ~InvLSCStrategy() {}
//! Functions inherited from LSCStrategy
//@{
/** This informs the strategy object to build the state associated
* with this operator.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*/
virtual void buildState(BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Get the inverse of \f$B Q_u^{-1} B^T\f$.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns An (approximate) inverse of \f$B Q_u^{-1} B^T\f$.
*/
virtual LinearOp getInvBQBt(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Get the inverse of \f$B H B^T - \gamma C\f$.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns An (approximate) inverse of \f$B H B^T - \gamma C\f$.
*/
virtual LinearOp getInvBHBt(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Get the inverse of the \f$F\f$ block.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns An (approximate) inverse of \f$F\f$.
*/
virtual LinearOp getInvF(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Get the inverse for stabilizing the whole schur complement approximation.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns The operator to stabilize the whole Schur complement.
*/
// virtual LinearOp getInvAlphaD(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
virtual LinearOp getOuterStabilization(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
virtual LinearOp getInnerStabilization(const BlockedLinearOp & A,BlockPreconditionerState & state) const
{ return Teuchos::null; }
/** Get the inverse mass matrix.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns The inverse of the mass matrix \f$Q_u\f$.
*/
virtual LinearOp getInvMass(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Get the \f$H\f$ scaling matrix.
*
* \param[in] A The linear operator to be preconditioned by LSC.
* \param[in] state State object for storying reusable information about
* the operator A.
*
* \returns The \f$H\f$ scaling matrix.
*/
virtual LinearOp getHScaling(const BlockedLinearOp & A,BlockPreconditionerState & state) const;
/** Should the approximation of the inverse use a full LDU decomposition, or
* is a upper triangular approximation sufficient.
*
* \returns True if the full LDU decomposition should be used, otherwise
* only an upper triangular version is used.
*/
virtual bool useFullLDU() const { return useFullLDU_; }
/** Tell strategy that this operator is supposed to be symmetric.
* Behavior of LSC is slightly different for non-symmetric case.
*
* \param[in] isSymmetric Is this operator symmetric?
*/
virtual void setSymmetric(bool isSymmetric)
{ isSymmetric_ = isSymmetric; }
//! Initialize from a parameter list
virtual void initializeFromParameterList(const Teuchos::ParameterList & pl,
const InverseLibrary & invLib);
//! For assiting in construction of the preconditioner
virtual Teuchos::RCP<Teuchos::ParameterList> getRequestedParameters() const;
//! For assiting in construction of the preconditioner
virtual bool updateRequestedParameters(const Teuchos::ParameterList & pl);
//@}
//! When computing the Schur complement, use the passed in matrix instead
//! of \f$C\f$ to stabilize the gradient operator.
virtual void setPressureStabMatrix(const Teko::LinearOp & psm)
{ userPresStabMat_ = psm; }
//! Initialize the state object using this blocked linear operator
virtual void initializeState(const BlockedLinearOp & A,LSCPrecondState * state) const;
/** Compute the inverses required for the LSC Schur complement
*
* \note This method assumes that the BQBt and BHBt operators have
* been constructed.
*/
void computeInverses(const BlockedLinearOp & A,LSCPrecondState * state) const;
// //! Initialize the state object using this blocked linear operator
// virtual void reinitializeState(const BlockedLinearOp & A,LSCPrecondState * state) const;
//! Set the number of power series iterations to use when finding the spectral radius
virtual void setEigSolveParam(int sz) { eigSolveParam_ = sz; }
//! Return the number of power series iterations to use when finding the spectral radius
virtual int getEigSolveParam() { return eigSolveParam_; }
//! Set to true to use the Full LDU decomposition, false otherwise
virtual void setUseFullLDU(bool val) { useFullLDU_ = val; }
//! Set to true to zero the rows of F when computing the spectral radius
virtual void setRowZeroing(bool val) { rowZeroingNeeded_ = val; }
//! set the mass matrix to use in computing the scaling
virtual void setMassMatrix(const LinearOp & mass) { massMatrix_ = mass; }
/** Set the \f$H\f$-Scaling operator used in \f$B H B^T\f$. It is expected
* that this will be a diagonal matrix.
*/
virtual void setHScaling(const LinearOp & hScaling) { hScaling_ = hScaling; }
/** Set the \f$H\f$-Scaling operator used in \f$B H B^T\f$. This method
* takes a vector and constructs the diagonal matrix.
*/
virtual void setHScaling(const MultiVector & hScaling)
{ hScaling_ = buildDiagonal(hScaling,"H"); }
/** Set the \f$W\f$-Scaling vector used in \f$B H B^T\f$. This method
* takes a vector.
*/
virtual void setWScaling(const MultiVector & wScaling)
{ wScaling_ = wScaling; }
protected:
LinearOp massMatrix_;
// how to invert the matrices
Teuchos::RCP<InverseFactory> invFactoryF_;
Teuchos::RCP<InverseFactory> invFactoryS_;
// number of power iterations when computing spectral radius
int eigSolveParam_;
// flags for handling various options
bool rowZeroingNeeded_;
bool useFullLDU_;
bool useMass_;
bool useLumping_;
bool useWScaling_;
DiagonalType scaleType_;
bool isSymmetric_;
bool assumeStable_;
// operators requested, to be filled by user
LinearOp userPresStabMat_;
mutable LinearOp hScaling_;
MultiVector wScaling_;
private:
InvLSCStrategy(const InvLSCStrategy &);
};
} // end namespace NS
} // end namespace Teko
#endif
|