/usr/include/linbox/solutions/smith-form.h is in liblinbox-dev 1.4.2-3.
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 | /* Copyright (C) 2010 LinBox
*
*
*
*
* ========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========
*/
#ifndef __LINBOX_smith_form_H
#define __LINBOX_smith_form_H
#include <list>
#include <vector>
#include <iterator>
#include "linbox/util/error.h"
#include "linbox/algorithms/matrix-hom.h"
//#ifdef __LINBOX_HAVE_NTL
#include "linbox/algorithms/smith-form-adaptive.h"
//#endif
#include "givaro/zring.h"
//#include "linbox/algorithms/smith-form.h"
//#include "linbox/algorithms/smith-form-local.h"
namespace LinBox
{
// EC: pair(e,c) denotes c repetitions of element e.
#define EC(Elt) std::pair<typename Elt, size_t>
// EC_LIST: list of such pairs, compact form of invariant list.
#define EC_LIST(Elt) std::list<EC(Elt) >
// Convert from vector of invariants (with repeats) to EC_LIST form.
template<class Ring>
EC_LIST(Ring::Element) &
distinct(EC_LIST(Ring::Element) & c, const BlasVector<Ring>& v)
{
typename Ring::Element e;
size_t count = 0;
const Ring& R = v.field();
size_t n = v.size();
if (n > 0) R.assign(e, v[0]); else return c;
count = 1;
for (size_t i = 1; i < v.size(); ++i)
{ if (R.areEqual(v[i], e))
++count;
else
{ c.push_back(EC(Ring::Element)(e, count));
R.assign(e, v[i]); count = 1;
}
}
c.push_back(EC(Ring::Element)(e, count));
return c;
}
/** Compute the Smith form of A.
* \ingroup solutions
*
* The Smith form of a linear operator A, represented as a
* black box, is computed over a representation of \f$Z\f$ or \f$Z_m\f$.
*
* @param[out] S a list of invariant/repcount pairs.
* @param A Matrix of which to compute the Smith form
* @param M may be a \p Method::Hybrid (default), which uses the
algorithms/smith-form-adaptive.
@todo Other methods will be provided later.
For now see the examples/smith.C
for ways to call other smith form algorithms.
*/
/*
BB has to be dense matrix
PL means EC_list (list of value repcount pairs)
VL means diag of smith form as a BlasVector.
SNF function forms:
template<BB> smithForm(PL, BB) -> add Hybrid
template<BB> smithForm(VL, BB) -> add Hybrid
template<BB,Meth> smithForm(PL, BB, Meth) -> add IntegerTag
template<BB,Meth> smithForm(VL, BB, Meth) -> add IntegerTag
smithForm(PL, BB, IntegerTag, Hybrid) -> call adaptive
smithForm(VL, BB, IntegerTag, Hybrid) -> call adaptive
*/
template <class Blackbox, class Method>
EC_LIST(Blackbox::Field::Element) &
smithForm(EC_LIST(Blackbox::Field::Element) & S,
const Blackbox & A,
const Method & M)
{
smithForm(S, A, typename FieldTraits<typename Blackbox::Field>::categoryTag(), M);
return S;
}
template <class Blackbox, class Method>
BlasVector<typename Blackbox::Field> &
smithForm(BlasVector<typename Blackbox::Field> & V,
const Blackbox & A,
const Method & M)
{
smithForm(V, A, typename FieldTraits<typename Blackbox::Field>::categoryTag(), M);
return V;
}
#if 0
// for specialization with respect to the DomainCategory
template< class Output, class Blackbox, class SmithMethod, class DomainCategory>
Output &smithForm(Output & S,
const Blackbox &A,
const DomainCategory &tag,
const SmithMethod &M)
{
throw LinBoxError( "Smith form solution implemented only for NTL.\n Please reconfigure LinBox with NTL enabled.");
}
#endif
// The smithForm with default Method
template<class Blackbox>
EC_LIST(Blackbox::Field::Element) &
smithForm(EC_LIST(Blackbox::Field::Element) & S,
const Blackbox& A)
{
smithForm(S, A, Method::Hybrid());
return S;
}
template<class Blackbox>
BlasVector<typename Blackbox::Field> &
smithForm(BlasVector<typename Blackbox::Field> & V,
const Blackbox& A)
{
smithForm(V, A, Method::Hybrid());
return V;
}
#if 0
// The smithForm for ModularTag
template<class Output, class Blackbox, class MyMethod>
Output &smithForm(Output & S,
const Blackbox &A,
const RingCategories::ModularTag &tag,
const MyMethod& M)
{
typename Blackbox::Field F = A.field();
integer p, c; F.characteristic(p); F.cardinality(c);
if (probab_prime(p) && p == c)
{ size_t r; rank(r, A);
S.resize(0);
size_t n = (A.rowdim() > A.coldim() ? A.coldim() : A.rowdim())-r;
if (r > 0) S.push_back( std::pair<size_t, integer>(r, 1) );
if (n > 0) S.push_back( std::pair<size_t, integer>(n, 0) );
}
else
{
integer x; size_t c;
for(x = p, c = 0; divides(2, x); x /= 2, ++c);
if (x == 1 && c <= 32) // (a low power of 2)
{
List L;
LocalSmith<Local2_32> SmithForm;
SmithForm( L, M, R );
distinct(L.begin(), L.end(), S);
}
// if (a odd prime power) call local-smith
else
{
IliopoulosElimination::smithIn (M);
typedef std::list< PIR::Element > List;
List L;
for (size_t i = 0; i < M.rowdim(); ++i) L.push_back(M[i][i]);
distinct(L.begin(), L.end(), S);
}
}
return S;
}
#endif
//#ifdef __LINBOX_HAVE_NTL
/*template<>
std::list<std::pair<integer, size_t> > &
smithForm(std::list<std::pair<integer, size_t> >& S,
*/
EC_LIST(Givaro::ZRing<Integer>::Element) &
smithForm(EC_LIST(Givaro::ZRing<Integer>::Element) & S,
const BlasMatrix<Givaro::ZRing<Integer> > &A,
const RingCategories::IntegerTag &tag,
const Method::Hybrid & M)
{
Givaro::ZRing<Integer> Z;
BlasVector<Givaro::ZRing<Integer> > v (Z,A.rowdim() < A.coldim() ? A.rowdim() : A.coldim());
SmithFormAdaptive::smithForm(v, A);
//distinct(v.begin(), v.end(), S);
return distinct(S,v);
}
BlasVector<typename Givaro::ZRing<Integer> > &
smithForm(BlasVector<typename Givaro::ZRing<Integer> > & V,
const BlasMatrix<Givaro::ZRing<Integer> > &A,
const RingCategories::IntegerTag &tag,
const Method::Hybrid & M)
{
Givaro::ZRing<Integer> Z;
SmithFormAdaptive::smithForm(V, A);
return V;
}
//#endif
#if 0
// The smithForm with BlackBox Method
template<class Output, class Blackbox>
Output &smithForm(Output & S,
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::Blackbox &M)
{
// this will be binary search smith form (EGV')
}
#endif
#undef EC
#undef EC_LIST
} // end of LinBox namespace
#endif // __LINBOX_smith_form_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
|