| RTOpPack::IncompatibleVecs | |
| RTOpPack::InvalidNumTargVecs | |
| RTOpPack::InvalidNumVecs | |
| RTOpPack::InvalidUsage | |
| RTOpPack::MutableSubMultiVectorT< Scalar > | Class for a mutable sub-vector |
| RTOpPack::MutableSubVectorT< Scalar > | Class for a mutable sub-vector |
| RTOpPack::ReductTarget | Abstract base class for all reduction object |
| RTOpPack::ReductTargetScalar< Scalar > | Simple ReductTarget subclass for simple scalar objects |
| RTOpPack::ReductTargetScalarIndex< Scalar > | Simple ReductTarget subclass for Scalar,Index objects |
| RTOpPack::ReductTargetSubVectorT< Scalar > | |
| RTOpPack::ROpCountNanInf< Scalar > | Reduction operator that counts the number of entries that are NaN or Inf |
| RTOpPack::ROpDotProd< Scalar > | Dot product reduction operator: result = sum( conj(v0[i])*v1[i], i=1...n ) |
| RTOpPack::ROpGetSubVector< Scalar > | Reduction operator that extracts a sub-vector in the range of global indexes [l,u] |
| RTOpPack::ROpIndexReductionBase< Scalar > | Simple base class for all reduction operators that return a simple index reduction object |
| RTOpPack::ROpMax< Scalar > | Returns the maximum element: result = max{ v0[i], i=1...n } |
| RTOpPack::ROpMaxIndex< Scalar > | Returns the maximum element and its index: result.scalar = x(k) and result.index = k such that x(k) >= x(i) for i=1...n and k is the minimum index to break ties |
| RTOpPack::ROpMaxIndexLessThanBound< Scalar > | Returns the maximum element less than some bound along with its index: result.scalar = x(k) and result.index = k such that x(k) >= x(i) for all i where x(i) < bound and k is the minimum index to break ties |
| RTOpPack::ROpMin< Scalar > | Returns the minimum element: result = min{ v0[i], i=1...n } |
| RTOpPack::ROpMinIndex< Scalar > | Returns the minimum element and its index: result.scalar = x(k) and result.index = k such that x(k) <= x(i) for i=1...n and k is the minimum index to break ties |
| RTOpPack::ROpMinIndexGreaterThanBound< Scalar > | Returns the minimum element greater than some bound along with its index: result.scalar = x(k) and result.index = k such that x(k) <= x(i) for all i where x(i) > bound and k is the minimum index to break ties |
| RTOpPack::ROpNorm1< Scalar > | One norm reduction operator: result = max( |v0[i]|, i=1...n ) |
| RTOpPack::ROpNorm2< Scalar > | Two (Euclidean) norm reduction operator: result = sqrt( sum( conj(v0[i])*v0[i], i=1...n ) ) |
| RTOpPack::ROpNormInf< Scalar > | Infinity norm reduction operator: result = sum( |v0[i]|, i=1...n ) |
| RTOpPack::ROpScalarIndexReductionBase< Scalar > | Base class for all reduction operators that return a ScalarIndex reduction object |
| RTOpPack::ROpScalarReductionBase< Scalar > | Simple base class for all reduction operators that return a simple scalar reduction object |
| RTOpPack::ROpScalarScalarTransformationBase< Scalar > | Simple base class for all transformation operators that use a pair of Scalar data members |
| RTOpPack::ROpScalarTransformationBase< Scalar > | Simple base class for all transformation operators that use a single piece of Scalar data |
| RTOpPack::ROpSum< Scalar > | Summation reduction operator: result = sum( v0[i], i=1...n ) |
| RTOpPack::ROpWeightedNorm2< Scalar > | Weighted Two (Euclidean) norm reduction operator: result = sqrt( sum( v0[i]*conj(v1[i])*v1[i], i=1...n ) ) |
| RTOpPack::RTOpServer< Scalar > | Server for creating RTOpT objects given just the operators name |
| RTOpPack::RTOpT< Scalar > | Templated interface to vector reduction/transformation operators {abstract} |
| RTOpPack::ScalarIndex< Scalar > | Simple struct for a Scalar and an Index object |
| RTOpPack::SparseSubVectorT< Scalar > | Class for a (sparse or dense) sub-vector |
| RTOpPack::SubMultiVectorT< Scalar > | Class for a non-mutable sub-multi-vector (submatrix) |
| RTOpPack::SubVectorT< Scalar > | Class for a non-mutable sub-vector |
| RTOpPack::TOpAbs< Scalar > | Transformation operator that takes absolute values of elements: z0[i] = abs(v0[i]), i=1...n |
| RTOpPack::TOpAddScalar< Scalar > | Add a scalar to a vector transformation operator: z0[i] += alpha, i=1...n |
| RTOpPack::TOpAssignScalar< Scalar > | Assign a scalar to a vector transformation operator: z0[i] = alpha, i=1...n |
| RTOpPack::TOpAssignVectors< Scalar > | VectorBase assignment transformation operator: z0[i] = v0[i], i=1...n |
| RTOpPack::TOpAXPY< Scalar > | AXPY transformation operator: z0[i] += alpha*v0[i], i=1...n |
| RTOpPack::TOpEleWiseDivide< Scalar > | Element-wise division transformation operator: z0[i] += alpha*v0[i]/v1[i], i=1...n |
| RTOpPack::TOpEleWiseProd< Scalar > | Element-wise product transformation operator: z0[i] += alpha*v0[i]*v1[i], i=1...n |
| RTOpPack::TOpLinearCombination< Scalar > | Linear combination transformation operator: z0[i] = beta*z0[i] + sum( alpha[k]*v[k][i], k=0...num_vecs-1 ), i=1...n |
| RTOpPack::TOpRandomize< Scalar > | Generate a random vector in the range [l,u]: z0[i] = 0.5*((u-l)*Teuchos::ScalarTraits<Scalar>::random()+(u+l)), i=1...n |
| RTOpPack::TOpReciprocal< Scalar > | VectorBase assignment transformation operator: z0[i] = v0[i], i=1...n |
| RTOpPack::TOpScaleVector< Scalar > | Simple transformation operator that scales every vector element by a scalar alpha |
| RTOpPack::TOpSetSubVector< Scalar > | Advanced transformation operator that assigns elements from a sparse explicit vector |
| RTOpPack::TOpUnaryFuncPtr< Scalar > | RTOpT subclass for unary transformation functions using a function pointer |
| RTOpPack::UnknownError | |
