MOOCHO (Single Doxygen Collection)  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
AbstractLinAlgPack_VectorStdOps.hpp
Go to the documentation of this file.
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #ifndef ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
43 #define ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
44 
46 
47 namespace AbstractLinAlgPack {
48 
52 
55 
58 value_type sum( const Vector& v_rhs );
59 
62 value_type dot( const Vector& v_rhs1, const Vector& v_rhs2 );
63 
66 value_type dot( const Vector& v_rhs1, const SpVectorSlice& sv_rhs2 );
67 
70 value_type dot( const SpVectorSlice& sv_rhs1, const Vector& v_rhs2 );
71 
87 void max_abs_ele( const Vector& v, value_type* max_v_j, index_type* max_j );
88 
90 
93 
96 void Vp_S( VectorMutable* v_lhs, const value_type& alpha );
97 
104 void Vt_S( VectorMutable* v_lhs, const value_type& alpha );
105 
108 void Vp_StV( VectorMutable* v_lhs, const value_type& alpha, const Vector& v_rhs );
109 
112 void Vp_StV( VectorMutable* v_lhs, const value_type& alpha, const SpVectorSlice& sv_rhs );
113 
116 void ele_wise_prod(
117  const value_type& alpha, const Vector& v_rhs1, const Vector& v_rhs2
118  ,VectorMutable* v_lhs );
119 
122 void ele_wise_divide(
123  const value_type& alpha, const Vector& v_rhs1, const Vector& v_rhs2
124  ,VectorMutable* v_lhs );
125 
128 void seed_random_vector_generator( unsigned int );
129 
135 void random_vector( value_type l, value_type u, VectorMutable* v );
136 
148 void sign(
149  const Vector &v
150  ,VectorMutable *z
151  );
152 
154 
156 
157 } // end namespace AbstractLinAlgPack
158 
159 // /////////////////////////////////////
160 // Inline members
161 
162 inline
164 AbstractLinAlgPack::dot( const SpVectorSlice& sv_rhs1, const Vector& v_rhs2 )
165 {
166  return dot(v_rhs2,sv_rhs1);
167 }
168 
169 #endif // ABSTRACT_LINALG_PACK_VECTOR_STD_OPS_H
Abstract interface for immutable, finite dimensional, coordinate vectors {abstract}.
void sign(const Vector &v, VectorMutable *z)
Compute the sign of each element in an input vector.
void Vt_S(VectorMutable *v_lhs, const value_type &alpha)
v_lhs *= alpha
void seed_random_vector_generator(unsigned int)
Seed the random number generator.
void Vp_StV(VectorMutable *v_lhs, const value_type &alpha, const Vector &v_rhs)
v_lhs = alpha * v_rhs + v_lhs
void ele_wise_divide(const value_type &alpha, const Vector &v_rhs1, const Vector &v_rhs2, VectorMutable *v_lhs)
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)
v_lhs(i) += alpha * v_rhs1(i) * v_rhs2(i), i = 1,,,dim.
value_type dot(const Vector &v_rhs1, const Vector &v_rhs2)
result = v_rhs1' * v_rhs2
SparseVectorSlice< SparseElement< index_type, value_type > > SpVectorSlice
void Vp_S(VectorMutable *v_lhs, const value_type &alpha)
v_lhs += alpha
value_type dot(const SpVectorSlice &sv_rhs1, const Vector &v_rhs2)
result = sv_rhs1' * v_rhs2
void max_abs_ele(const Vector &v, value_type *max_v_j, index_type *max_j)
Compute the maximum element in a vector.
value_type sum(const Vector &v_rhs)
result = sum( v_rhs(i), i = 1,,,dim )
const f_int f_dbl_prec const f_int f_int const f_int f_int const f_dbl_prec & u
void random_vector(value_type l, value_type u, VectorMutable *v)
Generate a random vector with elements uniformly distrubuted elements.