MOOCHO (Single Doxygen Collection)  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
DenseLinAlgPack_PermVecMat.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 // Utilities for pivoting VectorSlices and GenMatrixSlices.
43 
44 #ifndef PIVOTVECMAT_H
45 #define PIVOTVECMAT_H
46 
47 #include <stdexcept>
48 
50 
51 /* * @name {\bf DVector / Matrix Permutations}.
52  *
53  * These are functions for pivoting the elements of a vector and the
54  * rows and/or columns of a rectandular matrix.
55  *
56  * For DVector and DVectorSlice pivot funcitions the #perm# argument
57  * gives the mapping from the new sequence to the old sequence.
58  * The statement #i_old = perm(i_new)# gives the index in the
59  * old vector. After the permutation is performed the postcondition:
60  \verbatim
61 
62  perm_vs(i) == vs(perm(i)), for i = 1,2,...,vs.size()
63 
64  \endverbatim
65  * is true.
66  *
67  * For the DMatrix permutation functions the #row_perm# argument
68  * gives the row permutations and the #col_perm# argument gives the column
69  * permutations respectively.
70  *
71  * In each of these functions the permuted object can be the same
72  * as the unpermuted object.
73  */
74 
75 // @{
76 
77 // @Include: DenseLinAlgPack_IVector.hpp
78 
79 // /////////////////////////////////////////////////////////////////////////////////////////
80 // Public Permutation functions
81 
82 namespace DenseLinAlgPack {
83 
85 /* * Initialize a permutation to the identiy permutation.
86  *
87  * Preconditions: <ul>
88  * <li> #perm.size() > 0# (throw std::length_error)
89  * </ul>
90  *
91  * Postconditions: <ul>
92  * <li> #perm(i) = i#, for i = 1, 2, ... m #perm.size()#
93  * </ul>
94  */
95 void identity_perm(IVector* perm);
96 
98 /* * Find the inverse permutation (inv_perm) given a permutation vector (perm).
99  *
100  * Postconditions: <ul>
101  * <li> #inv_perm.size() == perm.size()#
102  * </ul>
103  */
104 void inv_perm(const IVector& perm, IVector* inv_perm);
105 
107 void perm_ele(const IVector& perm, DVectorSlice* vs);
108 
110 void perm_ele(const DVectorSlice& x, const IVector& perm, DVectorSlice* y);
111 
113 void inv_perm_ele(const DVectorSlice& y, const IVector& perm, DVectorSlice* x);
114 
116 void perm_rows(const IVector& row_perm, DMatrixSlice* gms);
117 
119 void perm_cols(const IVector& col_perm, DMatrixSlice* gms);
120 
122 void perm_rows_cols(const IVector& row_perm, const IVector& col_perm, DMatrixSlice* gms);
123 
124 #ifdef TEUCHOS_DEBUG
125 extern bool PermVecMat_print;
126 #endif
127 
128 } // end namespace DenseLinAlgPack
129 
130 // @}
131 
132 #endif // PIVOTVECMAT_H
void perm_rows(const IVector &row_perm, DMatrixSlice *gms)
Permute a GenMatrixSlices rows.
void inv_perm(const IVector &perm, IVector *inv_perm)
VectorSliceTmpl< value_type > DVectorSlice
void perm_cols(const IVector &col_perm, DMatrixSlice *gms)
Permute a GenMatrixSlices columns.
void perm_rows_cols(const IVector &row_perm, const IVector &col_perm, DMatrixSlice *gms)
Permute a GenMatrixSlices rows and columns.
void identity_perm(IVector *perm)
DenseLinAlgPack::DMatrixSlice DMatrixSlice
void inv_perm_ele(const DVectorSlice &y, const IVector &perm, DVectorSlice *x)
Perform x = P'*y.
void perm_ele(const IVector &perm, DVectorSlice *vs)
Permute a DVectorSlice in place.