/usr/include/trilinos/AbstractLinAlgPack_VectorStdOps.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
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 | // @HEADER
// ***********************************************************************
//
// Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
// Copyright (2003) 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.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
#define ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
#include "AbstractLinAlgPack_VectorMutable.hpp"
namespace AbstractLinAlgPack {
/** \defgroup VectorStdOps_grp Collection of standard vector operations.
*/
//@{
/** \defgroup VectorStdOps_ROp_grp Reduction operations */
//@{
/** \brief result = sum( v_rhs(i), i = 1,,,dim )
*/
value_type sum( const Vector& v_rhs );
/** \brief result = v_rhs1' * v_rhs2
*/
value_type dot( const Vector& v_rhs1, const Vector& v_rhs2 );
/** \brief result = v_rhs1' * sv_rhs2
*/
value_type dot( const Vector& v_rhs1, const SpVectorSlice& sv_rhs2 );
/** \brief result = sv_rhs1' * v_rhs2
*/
value_type dot( const SpVectorSlice& sv_rhs1, const Vector& v_rhs2 );
/** \brief Compute the maximum element in a vector.
*
* @param v [in] The vector being searched
* @param max_v_j [out] The value of the element with the max abs value.
* @param max_j [out] The index of the element with the max abs value.
*
* Returns:
\verbatim
max_v_j = v(max_j) s.t. |v(max_j)| <= |v(j)|, for j = 1...n
\endverbatim
* If there is a tie, the lowest index is returned so that the
* result is unique no matter what order the vector elements are
* searched.
*/
void max_abs_ele( const Vector& v, value_type* max_v_j, index_type* max_j );
//@}
/** \defgroup VectorStdOps_TOp_grp Transformation operations */
//@{
/** \brief v_lhs += alpha
*/
void Vp_S( VectorMutable* v_lhs, const value_type& alpha );
/** \brief v_lhs *= alpha
*
* This takes care of the special cases of <tt>alpha == 0.0</tt>
* (set <tt>v_lhs = 0.0</tt>) and <tt>alpha == 1.0</tt> (don't
* do anything).
*/
void Vt_S( VectorMutable* v_lhs, const value_type& alpha );
/** \brief v_lhs = alpha * v_rhs + v_lhs
*/
void Vp_StV( VectorMutable* v_lhs, const value_type& alpha, const Vector& v_rhs );
/** \brief v_lhs = alpha * sv_rhs + v_lhs
*/
void Vp_StV( VectorMutable* v_lhs, const value_type& alpha, const SpVectorSlice& sv_rhs );
/** \brief v_lhs(i) += alpha * v_rhs1(i) * v_rhs2(i), i = 1,,,dim.
*/
void ele_wise_prod(
const value_type& alpha, const Vector& v_rhs1, const Vector& v_rhs2
,VectorMutable* v_lhs );
/** \brief v_lhs(i) = alpha * v_rhs1(i) / v_rhs2(i), i = 1,,,dim.
*/
void ele_wise_divide(
const value_type& alpha, const Vector& v_rhs1, const Vector& v_rhs2
,VectorMutable* v_lhs );
/** \brief Seed the random number generator
*/
void seed_random_vector_generator( unsigned int );
/** \brief Generate a random vector with elements uniformly
* distrubuted elements.
*
* The elements are randomly generated between <tt>[l,u]</tt>.
*/
void random_vector( value_type l, value_type u, VectorMutable* v );
/** \brief Compute the sign of each element in an input vector.
*
\verbatim
/ -1.0 : if v(i) < 0.0
z(i) = | 0.0 : if v(i) == 0.0
\ +1.0 : if v(i) < 0.0
, for i = 1...n
\endverbatim
*/
void sign(
const Vector &v
,VectorMutable *z
);
//@}
//@}
} // end namespace AbstractLinAlgPack
// /////////////////////////////////////
// Inline members
inline
AbstractLinAlgPack::value_type
AbstractLinAlgPack::dot( const SpVectorSlice& sv_rhs1, const Vector& v_rhs2 )
{
return dot(v_rhs2,sv_rhs1);
}
#endif // ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
|