/usr/include/linbox/algorithms/matrix-hom.h is in liblinbox-dev 1.4.2-5build1.
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 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 | /* Copyright (C) 2010 LinBox
* Written by JG Dumas
*
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
/*! @file algorithms/matrix-hom.h
* @ingroup algorithms
* @brief Matrix Homomorphism
* A map function converts a matrix on a field/ring
* to its natural image in another field/ring.
* @sa
* \c rebind operator.
*/
#ifndef __LINBOX_matrix_hom_H
#define __LINBOX_matrix_hom_H
//! @bug it is dangerous to include matrices defs that include hom for their rebind...
#include "linbox/integer.h"
#include "linbox/field/hom.h"
#include "linbox/matrix/matrix-category.h"
#include "linbox/matrix/dense-matrix.h"
#include "linbox/matrix/sparse-matrix.h"
#include "linbox/blackbox/blackbox.h"
#include "linbox/vector/blas-vector.h"
namespace LinBox
{
/// \brief Limited doc so far. Used in RationalSolver.
namespace MatrixHom
{
// function class to hanle map to BlasMatrix (needed to allow partial specialization)
template< class Field, class IMatrix, class Type>
class BlasMatrixMAP {
public:
template<class _Rep>
void operator() (BlasMatrix<Field,_Rep> &Ap, const IMatrix& A, Type type);
};
template<class Field, class IMatrix>
class BlasMatrixMAP<Field, IMatrix, MatrixContainerCategory::Blackbox> {
public:
template<class _Rep>
void operator() (BlasMatrix<Field,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::Blackbox type)
{
typedef typename IMatrix::Field Ring;
Ring r = A.field();
std::vector<typename Ring::Element> e(A.coldim(), r.zero), tmp(A.rowdim());
typename BlasMatrix<Field,_Rep>::ColIterator col_p;
typename BlasMatrix<Field,_Rep>::Col::iterator elt_p;
typename std::vector<typename Ring::Element>::iterator e_p, tmp_p;
Hom<Ring, Field> hom(A. field(), Ap.field());
for (col_p = Ap.colBegin(), e_p = e.begin();
e_p != e.end(); ++ col_p, ++ e_p) {
r.assign(*e_p, r.one);
A.apply (tmp, e);
for (tmp_p = tmp.begin(), elt_p = col_p -> begin();
tmp_p != tmp.end(); ++ tmp_p, ++ elt_p)
hom.image (*elt_p, *tmp_p);
r.assign(*e_p, r.zero);
}
}
};
template<class Field, class IMatrix>
class BlasMatrixMAP<Field, IMatrix, MatrixContainerCategory::Container> {
public:
template<class _Rep>
void operator() (BlasMatrix<Field,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::Container type)
{
Hom<typename IMatrix::Field , Field> hom(A.field(), Ap.field());
typename Field::Element e;
for( typename IMatrix::ConstIndexedIterator indices = A.IndexedBegin();
(indices != A.IndexedEnd()) ;
++indices ) {
hom. image (e, A.getEntry(indices.rowIndex(),indices.colIndex()) );
if (!Ap.field().isZero(e))
Ap.setEntry (indices.rowIndex(),
indices.colIndex(), e);
else
Ap.setEntry (indices.rowIndex(),
indices.colIndex(), Ap.field().zero);
}
}
};
template<class Field, class IMatrix>
class BlasMatrixMAP<Field, IMatrix, MatrixContainerCategory::BlasContainer> {
public:
template<class _Rep>
void operator() (BlasMatrix<Field,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::BlasContainer type)
{
Hom<typename IMatrix::Field , Field> hom(A.field(), Ap.field());
typename IMatrix::ConstIterator iterA = A.Begin();
typename BlasMatrix<Field,_Rep>::Iterator iterAp = Ap.Begin();
for(; iterA != A.End(); ++iterA, ++iterAp)
hom. image (*iterAp, *iterA);
}
};
template<class Field, class _Rep>
class BlasMatrixMAP<Field, BlasMatrix<Givaro::ZRing<Integer>,_Rep>, MatrixContainerCategory::BlasContainer> {
public:
template<class _Rep2>
void operator() (BlasMatrix<Field,_Rep2> &Ap, const BlasMatrix<Givaro::ZRing<Integer>,_Rep> &A, MatrixContainerCategory::BlasContainer type)
{
Givaro::ZRing<Integer> ZZ ;
Hom<Givaro::ZRing<Integer> , Field> hom(ZZ, Ap.field());
typename BlasMatrix<Givaro::ZRing<Integer>,_Rep>::ConstIterator iterA = A.Begin();
typename BlasMatrix<Field,_Rep2>::Iterator iterAp = Ap.Begin();
for(; iterA != A.End(); ++iterA, ++iterAp)
hom. image (*iterAp, *iterA);
}
};
#ifdef __LINBOX_blas_matrix_multimod_H
template< class IMatrix>
class BlasMatrixMAP<MultiModDouble, IMatrix, MatrixContainerCategory::BlasContainer > {
public:
template<class _Rep>
void operator() (BlasMatrix<MultiModDouble,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::BlasContainer type)
{
for (size_t i=0; i<Ap.field().size();++i)
MatrixHom::map(Ap.getMatrix(i), A);
}
};
template< class IMatrix>
class BlasMatrixMAP<MultiModDouble, IMatrix, MatrixContainerCategory::Container > {
public:
template<class _Rep>
void operator() (BlasMatrix<MultiModDouble,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::Container type)
{
for (size_t i=0; i<Ap.field().size();++i)
MatrixHom::map(Ap.getMatrix(i), A);
}
};
template< class IMatrix>
class BlasMatrixMAP<MultiModDouble, IMatrix, MatrixContainerCategory::Blackbox > {
public:
template<class _Rep>
void operator() (BlasMatrix<MultiModDouble,_Rep> &Ap, const IMatrix &A, MatrixContainerCategory::Blackbox type)
{
for (size_t i=0; i<Ap.field().size();++i)
MatrixHom::map(Ap.getMatrix(i), A);
}
};
#endif
} // MatrixHom
namespace MatrixHom
{
template<class FMatrix, class IMatrix>
void map (FMatrix & Ap, const IMatrix& A)
{
typename IMatrix::template rebind<typename FMatrix::Field>()( Ap, A);
}
// construct a sparse matrix over finite field, such that Ap = A mod p, where F = Ring / <p>
template<class Ring, class Vect1, class Field, class Vect2>
void map (SparseMatrix<Field, Vect2>& Ap, const SparseMatrix<Ring, Vect1>& A)
{
// typename SparseMatrix<Ring,Vect1>::template rebind<Field, typename SparseVectorTranslate<Field,Vect2>::other_t >()( Ap, A);
typename SparseMatrix<Ring,Vect1>::template rebind<Field,Vect2>()( Ap, A);
}
// construct a BlasMatrix over finite field, such that Ap - A mod p, where F = Ring / <p>
template<class Ring, class Field, class _Rep>
void map (BlasMatrix<Field,_Rep> &Ap, const BlasMatrix<Ring,_Rep>& A )
{
typename BlasMatrix<Ring,_Rep>::template rebind<Field>()( Ap, A);
}
template <class Field, class IMatrix, class _Rep>
void map (BlasMatrix<Field,_Rep> &Ap, const IMatrix &A)
{
BlasMatrixMAP<Field, IMatrix, typename MatrixContainerTrait<IMatrix>::Type> ()(Ap, A, typename MatrixContainerTrait<IMatrix>::Type());
}
template <class Field, class IPoly, class IMatrix>
void map (PolynomialBB< typename IMatrix::template rebind<Field>::other,
typename IPoly::template rebind<Field>::other> &Ap,
const PolynomialBB<IMatrix, IPoly> &A)
{
typename PolynomialBB<IMatrix,IPoly>::template rebind<Field>() (Ap, A);
}
template <class Field, class Ring>
void map (ScalarMatrix<Field> &Ap,
const ScalarMatrix<Ring> &A)
{
typename ScalarMatrix<Ring>::template rebind<Field>() (Ap, A);
}
// construct a sparse matrix over finite field, such that Ap = A mod p, where F = Ring / <p>
template <class Field, class Vect, class IMatrix>
void map (SparseMatrix<Field, Vect> &Ap, const IMatrix& A)
{
typedef typename IMatrix::Field Ring;
Ring r = A.field();
BlasVector<Ring> e(r,A.coldim()), tmp(r,A.rowdim());
typename BlasVector<Ring>::iterator iter, e_p;
typename Field::Element val;
int i = 0;
Hom<Ring, Field> hom(A. field(), Ap.field());
for (e_p=e.begin();e_p != e.end(); ++e_p,++i){
r.assign(*e_p, r.one);
A.apply(tmp,e);
int j;
for (iter=tmp.begin(),j=0; iter != tmp.end(); ++iter,++j) {
hom. image (val, *iter);
if (!Ap.field().isZero(val))
Ap.setEntry ((size_t)j,(size_t)i, val);
}
r.assign(*e_p, r.zero);
}
}
} // MatrixHom
} // LinBox
#endif //__LINBOX_matrix_hom_H
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|