/usr/include/linbox/algorithms/gauss/gauss-gf2.inl is in liblinbox-dev 1.3.2-1.1build2.
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 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 | /* linbox/algorithms/gauss-gf2.inl
* Copyright (C) 2009 The LinBox group
*
* Time-stamp: <15 Jun 10 16:20:16 Jean-Guillaume.Dumas@imag.fr>
*
*
* ========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_gauss_gf2_INL
#define __LINBOX_gauss_gf2_INL
// SparseSeqMatrix is container< container< size_t > >
#include "linbox/algorithms/gauss.h"
#include "linbox/util/commentator.h"
#include <utility>
#ifdef __LINBOX_ALL__ //BB: ???
#ifndef __LINBOX_COUNT__
#define __LINBOX_COUNT__
#endif
#ifndef __LINBOX_OFTEN__
#define __LINBOX_OFTEN__ __LINBOX_ALL__
#endif
#ifndef __LINBOX_FILLIN__
#define __LINBOX_FILLIN__
#endif
#endif
namespace LinBox
{
// Specialization over GF2
template <class SparseSeqMatrix, class Perm>
inline unsigned long&
GaussDomain<GF2>::InPlaceLinearPivoting (unsigned long &Rank,
bool &determinant,
SparseSeqMatrix &LigneA,
Perm &P,
unsigned long Ni,
unsigned long Nj) const
{
// Requirements : LigneA is an array of sparse rows
// In place (LigneA is modified)
// With reordering (D is a density type. Density is allocated here)
// long Ni = LigneA.n_row (), Nj = LigneA.n_col ();
commentator().start ("Gaussian elimination with reordering over GF2",
"IPLRGF2", Ni);
commentator().report (Commentator::LEVEL_NORMAL, INTERNAL_DESCRIPTION)
<< "Gaussian QLUP elimination on " << Ni << " x " << Nj << " matrix" << std::endl;
#ifdef __LINBOX_COUNT__
long long nbelem = 0;
#endif
determinant = true;
// allocation of the column density
std::vector<size_t> col_density (Nj);
// assignment of LigneA with the domain object
for (unsigned long jj = 0; jj < Ni; ++jj)
for (unsigned long k = 0; k < LigneA[jj].size (); k++)
++col_density[LigneA[jj][k]];
long last = Ni - 1;
long c;
Rank = 0;
#ifdef __LINBOX_OFTEN__
long sstep = last/40;
if (sstep > __LINBOX_OFTEN__) sstep = __LINBOX_OFTEN__;
#else
long sstep = 1000;
#endif
// Elimination steps with reordering
typename SparseSeqMatrix::iterator LigneA_k = LigneA.begin();
for (long k = 0; k < last; ++k, ++LigneA_k) {
long p = k, s = 0;
#ifdef __LINBOX_FILLIN__
if ( ! (k % 100) )
#else
if ( ! (k % sstep) )
#endif
{
commentator().progress (k);
#ifdef __LINBOX_FILLIN__
long sl(0);
for (size_t l = 0; l < Ni; ++l)
sl += LigneA[l].size ();
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Fillin (" << Rank << "/" << Ni << ") = "
<< sl
<< " (" << double(sl)*100.0/double(Ni-k)/double(Nj-k) << "%, "
<< double(sl)/double(Ni-k) << " avg)"
<< std::endl;
#endif
}
long l;
for(l = k; l < static_cast<long>(Ni); ++l) {
if ( (s = LigneA[l].size()) != 0 ) {
p = l;
break;
}
}
if (s) {
long sl;
// Row permutation for the sparsest row
for (; l < static_cast<long>(Ni); ++l)
if (((sl = LigneA[l].size ()) < s) && (sl)) {
s = sl;
p = l;
}
if (p != k) {
// std::cerr << "Permuting rows: " << k << " <--> " << p << std::endl;
std::swap( *LigneA_k, LigneA[p]);
}
SparseFindPivotBinary (*LigneA_k, Rank, c, col_density, determinant);
if (c != -1) {
long ll;
if ( c != (static_cast<long>(Rank)-1) ) {
P.permute(Rank-1,c);
for (ll=0 ; ll < k ; ++ll)
permuteBinary( LigneA[ll], Rank, c);
}
long npiv=LigneA_k->size();
for (ll = k+1; ll < static_cast<long>(Ni); ++ll) {
bool elim=false;
eliminateBinary (elim, LigneA[ll], *LigneA_k, Rank, c, npiv, col_density);
}
}
// LigneA.write(std::cerr << "AFT " )<<std::endl;
#ifdef __LINBOX_COUNT__
nbelem += LigneA_k->size ();
#endif
}
// LigneA.write(rep << "U:= ", FORMAT_MAPLE) << std::endl;
}//for k
SparseFindPivotBinary ( LigneA[last], Rank, c, determinant);
if (c != -1) {
if ( c != (static_cast<long>(Rank)-1) ) {
P.permute(Rank-1,c);
for (long ll=0 ; ll < last ; ++ll)
permuteBinary( LigneA[ll], Rank, c);
}
}
#ifdef __LINBOX_COUNT__
nbelem += LigneA[last].size ();
commentator().report (Commentator::LEVEL_NORMAL, PARTIAL_RESULT)
<< "Left elements : " << nbelem << std::endl;
#endif
#ifdef __LINBOX_FILLIN__
long sl(0);
for (size_t l=0; l < Ni; ++l)
sl += LigneA[l].size ();
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Fillin (" << Rank << "/" << Ni << ") = " << sl
<< std::endl;
#endif
if ((Rank < Ni) || (Rank < Nj) || (Ni == 0) || (Nj == 0))
determinant = false;
integer card;
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Determinant : " << determinant
<< " over GF (2)" << std::endl;
// LigneA.write(rep << "U:= ", FORMAT_MAPLE) << ':' << std::endl;
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Rank : " << Rank
<< " over GF (2)" << std::endl;
commentator().stop ("done", 0, "IPLRGF2");
return Rank;
}
// Specialization over GF2
template <class SparseSeqMatrix, class Perm> inline unsigned long&
GaussDomain<GF2>::QLUPin (unsigned long &Rank,
bool &determinant,
Perm &Q,
SparseSeqMatrix &LigneL,
SparseSeqMatrix &LigneA,
Perm &P,
unsigned long Ni,
unsigned long Nj) const
{
linbox_check( Q.coldim() == Q.rowdim() );
linbox_check( P.coldim() == P.rowdim() );
linbox_check( Q.coldim() == LigneL.size() );
typedef typename SparseSeqMatrix::value_type Vector;
typedef typename Vector::value_type E;
// Requirements : LigneA is an array of sparse rows
// In place (LigneA is modified)
// With reordering (D is a density type. Density is allocated here)
// long Ni = LigneA.n_row (), Nj = LigneA.n_col ();
commentator().start ("Gaussian elimination with reordering over GF2",
"IPLRGF2", Ni);
commentator().report (Commentator::LEVEL_NORMAL, INTERNAL_DESCRIPTION)
<< "Gaussian QLUP elimination on " << Ni << " x " << Nj << " matrix" << std::endl;
#ifdef __LINBOX_COUNT__
long long nbelem = 0;
#endif
determinant = true;
// allocation of the column density
std::vector<size_t> col_density (Nj);
for(typename SparseSeqMatrix::iterator LigneL_it = LigneL.begin() ;
LigneL_it != LigneL.end(); ++LigneL_it)
LigneL_it->reserve(16);
std::deque<std::pair<size_t,size_t> > invQ;
// assignment of LigneA with the domain object
for (unsigned long jj = 0; jj < Ni; ++jj)
for (unsigned long k = 0; k < LigneA[jj].size (); k++)
++col_density[LigneA[jj][k]];
long last = Ni - 1;
long c;
Rank = 0;
#ifdef __LINBOX_OFTEN__
long sstep = last/40;
if (sstep > __LINBOX_OFTEN__) sstep = __LINBOX_OFTEN__;
#else
long sstep = 1000;
#endif
// Elimination steps with reordering
typename SparseSeqMatrix::iterator LigneA_k = LigneA.begin();
for (long k = 0; k < last; ++k, ++LigneA_k) {
long p = k, s = 0;
#ifdef __LINBOX_FILLIN__
if ( ! (k % 100) )
#else
if ( ! (k % sstep) )
#endif
{
commentator().progress (k);
#ifdef __LINBOX_FILLIN__
long sl(0);
for (size_t l = 0; l < Ni; ++l)
sl += LigneA[l].size ();
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Fillin (" << Rank << "/" << Ni << ") = "
<< sl
<< " (" << double(sl)*100.0/double(Ni-k)/double(Nj-k) << "%, "
<< double(sl)/double(Ni-k) << " avg)"
<< std::endl;
#endif
}
long l;
for(l = k; l < static_cast<long>(Ni); ++l) {
if ( (s = LigneA[l].size()) ) {
p = l;
break;
}
}
if (s) {
long sl;
// Row permutation for the sparsest row
for (; l < static_cast<long>(Ni); ++l)
if (((sl = LigneA[l].size ()) < s) && (sl)) {
s = sl;
p = l;
}
if (p != k) {
// std::cerr << "Permuting rows: " << k << " <--> " << p << std::endl;
invQ.push_front( std::pair<size_t,size_t>(k,p) );
std::swap( *LigneA_k, LigneA[p]);
std::swap( LigneL[k], LigneL[p]);
}
SparseFindPivotBinary (*LigneA_k, Rank, c, col_density, determinant);
if (c != -1) {
long ll;
if ( c != (static_cast<long>(Rank)-1) ) {
P.permute(Rank-1,c);
for (ll=0 ; ll < k ; ++ll)
permuteBinary( LigneA[ll], Rank, c);
}
long npiv=LigneA_k->size();
for (ll = k+1; ll < static_cast<long>(Ni); ++ll) {
E hc; hc=Rank-1; bool elim=false;
eliminateBinary (elim, LigneA[ll], *LigneA_k, Rank, c, npiv, col_density);
if(elim) LigneL[ll].push_back(hc);
}
}
// LigneA.write(std::cerr << "AFT " )<<std::endl;
#ifdef __LINBOX_COUNT__
nbelem += LigneA_k->size ();
#endif
}
LigneL[k].push_back(k);
// LigneL.write(rep << "L:= ", FORMAT_MAPLE) << std::endl;
// LigneA.write(rep << "U:= ", FORMAT_MAPLE) << std::endl;
}//for k
SparseFindPivotBinary ( LigneA[last], Rank, c, determinant);
if (c != -1) {
if ( c != (static_cast<long>(Rank)-1) ) {
P.permute(Rank-1,c);
for (long ll=0 ; ll < last ; ++ll)
permuteBinary( LigneA[ll], Rank, c);
}
}
LigneL[last].push_back(last);
#ifdef __LINBOX_COUNT__
nbelem += LigneA[last].size ();
commentator().report (Commentator::LEVEL_NORMAL, PARTIAL_RESULT)
<< "Left elements : " << nbelem << std::endl;
#endif
#ifdef __LINBOX_FILLIN__
long sl(0);
for (size_t l=0; l < Ni; ++l)
sl += LigneA[l].size ();
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Fillin (" << Rank << "/" << Ni << ") = " << sl
<< std::endl;
#endif
if ((Rank < Ni) || (Rank < Nj) || (Ni == 0) || (Nj == 0))
determinant = false;
integer card;
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Determinant : " << determinant
<< " over GF (2)" << std::endl;
for(std::deque<std::pair<size_t,size_t> >::const_iterator it = invQ.begin(); it!=invQ.end();++it)
Q.permute( it->first, it->second );
#if 0
Q.write(rep << "Q:= ", FORMAT_MAPLE) << ':' << std::endl;
LigneL.write(rep << "L:= ", FORMAT_MAPLE) << ':' << std::endl;
LigneA.write(rep << "U:= ", FORMAT_MAPLE) << ':' << std::endl;
P.write(rep << "P:= ", FORMAT_MAPLE) << ':' << std::endl;
#endif
commentator().report (Commentator::LEVEL_IMPORTANT, PARTIAL_RESULT)
<< "Rank : " << Rank
<< " over GF (2)" << std::endl;
commentator().stop ("done", 0, "IPLRGF2");
return Rank;
}
} // namespace LinBox
#endif // __LINBOX_gauss_gf2_INL
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|