/usr/include/linbox/algorithms/block-coppersmith-domain.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 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 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 | /* linbox/algorithms/block-coppersmith-domain.h
* Copyright (C) 2012 George Yuhasz
*
* ========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_coppersmith_block_domain_H
#define __LINBOX_coppersmith_block_domain_H
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include "linbox/util/timer.h"
#include "givaro/givtimer.h"
#if defined(__LINBOX_USE_OPENMP) and defined(__GIVARO_USE_OPENMP)
#include <omp.h>
namespace LinBox {
typedef Givaro::OMPTimer CTimer;
}
#else
namespace LinBox {
typedef Givaro::Timer CTimer;
}
#endif
#include "linbox/util/commentator.h"
#define DEFAULT_BLOCK_EARLY_TERM_THRESHOLD 10
//Preprocessor variables for the state of BM_iterators
#define DeltaExceeded 4
#define SequenceExceeded 3
#define GeneratorFound 2
#define GeneratorUnconfirmed 1
namespace LinBox
{
double g_time1=0.0,g_time2=0.0,g_time3=0.0,g_time4=0.0;
/** Compute the linear generator of a sequence of matrices.
*
* This class encapsulates the functionality required for computing
* the block minimal polynomial of a matrix.
* @bib
* Yuhasz thesis ...
*/
template<class _Domain, class _Sequence>
class BlockCoppersmithDomain {
public:
typedef _Domain Domain;
typedef typename Domain::Field Field;
typedef typename Domain::Element Element;
typedef _Sequence Sequence;
typedef typename Domain::OwnMatrix Coefficient;
typedef typename Domain::Matrix Sub;
protected:
Sequence *_container;
const Domain *_MD;
unsigned long EARLY_TERM_THRESHOLD;
public:
BlockCoppersmithDomain (const BlockCoppersmithDomain<Field,
Sequence> &Mat, unsigned long ett_default =
DEFAULT_BLOCK_EARLY_TERM_THRESHOLD) :
_container(Mat._container), _MD(Mat._MD),
EARLY_TERM_THRESHOLD (ett_default)
{}
BlockCoppersmithDomain (const Domain& MD, Sequence *D, unsigned long ett_default
= DEFAULT_BLOCK_EARLY_TERM_THRESHOLD) :
_container(D), _MD(&MD),
EARLY_TERM_THRESHOLD (ett_default)
{}
//matrix domain
const Domain &domain () const { return *_MD; }
// field of the domain
const Field &field () const { return domain().field(); }
const Field &getField () const { return domain().field(); } // deprecated
// sequence of the domain
Sequence *getSequence () const
{ return _container; }
// the principal function
std::vector<size_t> right_minpoly (std::vector<Coefficient> &P);
// left minimal generating polynomial of the sequence
// This _MAY_ get defined eventually.
std::vector<size_t> & left_minpoly (std::vector<Coefficient> &P);
// { /* transpose seq and transpose result*/ }
// For compatibility with massey-domain (element sequence case).
std::vector<size_t> /* & */ operator()(std::vector<Coefficient> &P)
{
return right_minpoly(P);
}
private:
// bm-seq.h stuff can go here.
class BM_Seq {
public:
typedef typename std::list<Coefficient>::const_iterator const_iterator;
typedef int size_type;
inline const Domain &domain() const { return *_MD;}
inline const Field &field() const {return domain().field();}
private:
const Domain *_MD;
std::list<Coefficient> _seq;
size_type _size;
size_t _row, _col;
public:
BM_Seq(const Domain & MD, size_t r, size_t c) : _MD(&MD)
{
_row = r;
_col = c;
_size = 0;
}
BM_Seq(const Domain & MD, size_t r) : _MD(&MD)
{
_row = r;
_col = r;
_size = 0;
}
BM_Seq(const Domain &MD, int n, Coefficient& M) : _MD(&MD), _seq(n, M), _size(n)
{
_row = M.rowdim();
_col = M.coldim();
}
BM_Seq() {}
BM_Seq(const BM_Seq& S) :
_MD(S._MD), _seq(S._seq), _size(S._size), _row(S._row), _col(S._col)
{}
BM_Seq & operator=(const BM_Seq& S)
{
if(this != &S){
(*this)._size = S._size;
(*this)._row = S._row;
(*this)._col = S._col;
(*this)._MD = S._MD;
_seq.clear();
for(typename std::list<Coefficient>::const_iterator it = S._seq.begin(); it != S._seq.end(); ++it)
_seq.push_back(*it);
}
return *this;
}
size_t rowdim()
{
return _row;
}
size_t coldim()
{
return _col;
}
const_iterator begin() const
{
return _seq.begin();
}
const_iterator end() const
{
return _seq.end();
}
void push_back(const Coefficient &M)
{
if(_row==M.rowdim() && _col==M.coldim()){
_seq.push_back(M);
++_size;
}
}
bool operator==(const BM_Seq& l)
{
typename std::list<Coefficient>::const_iterator it, lit;
bool test = false;
if(_size==l._size && _row==l._row && _col==l._col){
test = true;
it = _seq.begin();
lit = l._seq.begin();
if(_size==0){
return test;
}
else{
while(test && it!=_seq.end()){
test = domain().areEqual(*it,*lit);
++it;
++lit;
}
}
}
return test;
}
bool operator!=(const BM_Seq& l)
{
return !(*this == l);
}
size_type size()
{
return _size;
}
class BM_iterator {
public:
typedef std::list<Coefficient> value_type;
private:
const Domain *_MD;
BM_Seq& _seq;
typename BM_Seq::size_type _size;
typename BM_Seq::size_type _t;
typename BM_Seq::const_iterator _seqel;
std::list<Coefficient> _gen;
std::vector<size_t> _deg;
size_t _delta;
size_t _mu;
size_t _beta;
size_t _sigma;
size_t _gensize;
size_t _row, _col;
size_t _ett;
size_t _etc;
public:
// This is an enumeration class that tells what state the berlekamp/massey algoithm iterator is in.
// The four states are:
// DeltaExceeded = 4
// SequenceExceeded = 3
// GeneratorFound = 2
// GeneratorUnconfirmed = 1
class TerminationState{
private:
int _state;
friend class BM_iterator;
TerminationState() : _state(GeneratorUnconfirmed) {}
TerminationState(int m) : _state(m) {}
public:
TerminationState(const TerminationState& t) : _state(t._state) {}
TerminationState & operator=(const TerminationState & t){
if(this != &t){
(*this)._state = t._state;
}
return *this;
}
bool IsGeneratorUnconfirmed(){
return _state==GeneratorUnconfirmed;
}
bool IsGeneratorFound()
{
return _state==GeneratorFound;
}
bool IsSequenceExceeded()
{
return _state==SequenceExceeded;
}
bool IsDeltaExceeded()
{
return _state==DeltaExceeded;
}
}; // TerminationState
private:
TerminationState _state;
public:
TerminationState state() const
{
return _state;
}
void setDelta(int d)
{
_delta=d;
if((/* _delta < 0 ||*/ _beta < _delta - _sigma + _mu +1) && _state._state!=3){
if(_sigma <= _delta /*|| _delta < 0*/)
_state._state = GeneratorUnconfirmed;
else
_state._state = DeltaExceeded;
}
else{
if(_sigma > _delta)
_state._state = DeltaExceeded;
else
_state._state = GeneratorFound;
}
}
//field and matrix domain functions
inline const Domain &domain() const { return *_MD;}
inline const Field &field() const { return domain().field();}
//Constructor
explicit BM_iterator(BM_Seq& s,
unsigned long earlyTermThreshold=DEFAULT_BLOCK_EARLY_TERM_THRESHOLD,
typename BM_Seq::size_type elinit=0) :
_MD(&s.domain()), _seq(s)
{
_row = s.rowdim();
_col = s.coldim();
_size = _seq.size();
_t = elinit;
_delta = (size_t)-1; // BB: is it meant ?
_seqel = _seq.begin();
_deg = std::vector<size_t>(_row+_col);
_ett=earlyTermThreshold;
_etc=0;
for(size_t i = _col; i < _row+_col; ++i)
_deg[i] = 1;
Coefficient gen1(field(),_col,_row+_col);
for(size_t i = 0; i<_col; ++i)
gen1.setEntry(i,i,field().one);
_gen.push_back(gen1);
_gensize = 1;
if(_size==0 || _t==_size)
_state._state = SequenceExceeded;
_sigma = 0;
_mu = 0;
_beta = 1;
}
//Copy constructor
BM_iterator(const BM_Seq::BM_iterator & it) :
_MD(&it.domain()), _seq(it._seq), _size(it._size), _t(it._t),
_seqel(it._seqel), _gen(it._gen), _deg(it._deg),
_delta(it._delta), _mu(it._mu), _beta(it._beta),
_sigma(it._sigma), _gensize(it._gensize),
_row(it._row), _col(it._col),
_ett(it._ett), _etc(it._etc), _state(it._state) {}
//Assignment operator not overloaded since BlasMatrix class has overloaded assignment error
//Overloaded assignment operator
BM_iterator& operator=(const typename BM_Seq::BM_iterator& it)
{
if(this != &it){
(*this)._MD = it._MD;
(*this)._row = it._row;
(*this)._col = it._col;
(*this)._seq = it._seq;
(*this)._size = it._size;
(*this)._t = it._t;
(*this)._seqel = it._seqel;
(*this)._deg = it._deg;
(*this)._gensize = it._gensize;
(*this)._delta = it._delta;
(*this)._mu = it._mu;
(*this)._sigma = it._sigma;
(*this)._beta = it._beta;
(*this)._state = it._state;
(*this)._ett = it._ett;
(*this)._etc = it._etc;
_gen.clear();
for(typename std::list<Coefficient>::const_iterator git = it._gen.begin(); git != it._gen.end(); ++git)
_seq.push_back(*git);
}
return (*this);
}
bool operator==(const BM_Seq::BM_iterator& it)
{
TerminationState check = it.state();
bool test1 = (_seq==it._seq);
bool test2 = (_t==it._t);
bool test3 = _delta==it._delta;
bool test4 = (_state._state == check._state && _state.IsSequenceExceeded());
return (test1 && test2 && (test3 || test4));
}
bool operator!=(const BM_iterator& it)
{
return !((*this) == it);
}
private:
// Column Copy
void ColumnCopy(Coefficient &M, Coefficient &A, size_t i)
{
size_t rowd = A.rowdim();
Sub MC(M,0,i,rowd,1);
Sub AC(A,0,i,rowd,1);
domain().copy(MC,AC);
}
// Column Swap
void ColumnSwap(Coefficient &M, size_t i, size_t j)
{
size_t rowd = M.rowdim();
Sub Ci(M,0,i,rowd,1);
Sub Cj(M,0,j,rowd,1);
domain().swap(Ci,Cj);
}
// Column Operation
void ColumnAdd(Coefficient &M, size_t i, size_t j, Element el)
{
size_t rowd = M.rowdim();
Coefficient temp(field(),rowd,1);
Sub Ci(M,0,i,rowd,1);
Sub Cj(M,0,j,rowd,1);
domain().mul(temp,Cj,el);
domain().addin(Ci,temp);
}
void Algorithm3dot2(Coefficient &tau, Coefficient &D, std::vector<size_t> &d, size_t &mu, size_t &sigma, size_t &beta)
{
Element pivel;
field().assign(pivel,field().zero);
// Retrieve the row and column dimensions of the sequence and the dimension of the discrepancy
size_t n = D.rowdim();
size_t nm = D.coldim();
size_t m = nm-n;
//Initialize tau to the identity matrix
for(size_t i = 0; i<nm; ++i)
tau.setEntry(i,i,field().one);
//Create the set of generator columns
std::set<size_t> gen;
typedef std::set<size_t>::key_type index_type;
for(index_type i=0; i<m; ++i)
gen.insert(i);
for(index_type i = 0; i<n; ++i){
//Compute pi, the columns of D with nonzero entries in row i
std::set<size_t> pi;
pi.insert(m+i);
for(typename std::set<size_t>::iterator genit = gen.begin(); genit != gen.end(); ++genit){
if(!field().isZero(D.getEntry(i,*genit)))
pi.insert(*genit);
}
//Choose the pivot row with the smallest nominal degree
index_type piv = m+i;
for(std::set<size_t>::iterator itpi = pi.begin(); itpi != pi.end(); ++itpi){
size_t j = *itpi;
if(d[j] <= d[piv]){
if(d[j]==d[piv]){
if(piv < m+i){
if(j<piv)
piv = j;
}
}
else
piv = j;
}
}
pi.erase(piv);
field().assign(pivel,D.getEntry(i,piv));
//Handle the case when piv=m+i, so no swap is done
if(piv==m+i){
for(std::set<size_t>::iterator itpi = pi.begin(); itpi != pi.end(); ++itpi){
Element temp;
field().assign(temp,D.getEntry(i, *itpi));
field().negin(temp);
field().divin(temp,pivel);
ColumnAdd(tau, *itpi, piv, temp);
ColumnAdd(D, *itpi, piv, temp);
}
}
else{
//Remove column index m+i and handle it separately
pi.erase(m+i);
//Eliminate nonzero discrepancies in generator columns
for(typename std::set<size_t>::iterator itpi = pi.begin(); itpi != pi.end(); ++itpi){
Element temp;
field().assign(temp,D.getEntry(i, *itpi));
field().negin(temp);
field().divin(temp,pivel);
ColumnAdd(tau, *itpi, piv, temp);
ColumnAdd(D, *itpi, piv, temp);
}
Element auxel;
field().assign(auxel,D.getEntry(i,m+i));
//Perform a major change and update an initialized auxiliary column
if(!field().isZero(auxel)){
Element temp;
field().assign(temp,D.getEntry(i, m+i));
field().negin(temp);
field().divin(temp,pivel);
ColumnAdd(tau, m+i, piv, temp);
ColumnAdd(D, m+i, piv, temp);
ColumnSwap(tau,piv, m+i);
ColumnSwap(D, piv, m+i);
}
else{
ColumnAdd(tau,m+i,piv,field().one);
ColumnAdd(D,m+i,piv,field().one);
gen.erase(piv);
}
size_t tempdeg = d[piv];
d[piv] = d[m+i];
d[m+i] = tempdeg;
if(tempdeg < beta)
beta = tempdeg;
if(d[piv] > mu)
mu = d[piv];
sigma = sigma - tempdeg + d[piv];
}
}
}
public:
BM_iterator& operator++()
{
//See if a matrix has been pushed on the sequence
//if it has, then recompute the seqel since it may
//have become corrupt.
//Also reset the size to the correct size of the sequence
if(_size < _seq.size()){
_seqel = _seq.begin();
for(int i = 0; i<_t; ++i)
++_seqel;
_size = _seq.size();
}
//if the iterator points past the seq elements, do nothing
if(_t == _size){
return *this;
}
//Initialize the discrepancy
Coefficient disc(field(),_row, _row+_col);
//Create two iterators, one for seq, and one for gen
typename BM_Seq::const_iterator cseqit;
typename std::list<Coefficient>::iterator genit;
//get a iterator to the seq element to be processed
cseqit = _seqel;
CTimer start1; start1.start();
//Compute the discrepancy
std::vector<Coefficient*> coeffVec;
std::vector<const Coefficient*> seqPtrVec;
for(genit = _gen.begin(); genit!=_gen.end(); ++genit){
coeffVec.push_back(&(*genit));
seqPtrVec.push_back(&(*cseqit));
--cseqit;
}
int numCoeffs=coeffVec.size();
std::vector <Coefficient> discComponents;
discComponents.reserve(numCoeffs);
for (int i=0;i<numCoeffs;++i) {
discComponents.push_back(Coefficient(field(),_row,_row+_col));
}
#ifdef __LINBOX_USE_OPENMP
#pragma omp parallel for
#endif
for (int i=0;i<numCoeffs;++i) {
domain().axpyin(discComponents[i],*(seqPtrVec[i]),*(coeffVec[i]));
}
for (int i=0;i<numCoeffs;++i) {
domain().addin(disc,discComponents[i]);
}
start1.stop();
g_time2 += start1.realtime();
CTimer start2; start2.start();
//Compute tau with Algorith3.2
Coefficient tau(field(), _row+_col, _row+_col);
Sub primaryDisc(disc,0,0,_row,_col);
if (_MD->isZero(primaryDisc)) {
--_etc;
} else {
_etc=_ett;
}
Algorithm3dot2(tau, disc, _deg, _mu, _sigma, _beta);
start2.stop();
g_time3 += start2.realtime();
CTimer start3; start3.start();
//Multiply tau into each matrix in the generator
#ifdef __LINBOX_USE_OPENMP
#pragma omp parallel for
#endif
for (int i=0;i<numCoeffs;++i) {
domain().mulin(*(coeffVec[i]),tau);
}
start3.stop();
g_time4 += start3.realtime();
//Increment the auxiliary degrees and beta
for(size_t j = _col; j <_row+_col; ++j)
_deg[j]++;
++_beta;
//Add a zero matrix to the end of the generator if needed.
int tmax = (int)_deg[0];
for(size_t j = 1; j<_row+_col; ++j)
if(tmax < (int)_deg[j])
tmax = (int)_deg[j];
if(tmax+1 > (int)_gensize){
_gen.push_back(Coefficient(field(),_col,_row+_col));
++_gensize;
}
//Mimic multiplication be z in the auxiliary columns
typename std::list<Coefficient>::reverse_iterator g1,g2;
g1 = _gen.rbegin();
g2 = _gen.rbegin();
++g1;
while(g1!=_gen.rend()){
Sub g1aux(*g1,0,_col,_col,_row);
Sub g2aux(*g2,0,_col,_col,_row);
domain().copy(g2aux,g1aux);
++g1;
++g2;
}
genit = _gen.begin();
Coefficient z1(field(),_col,_row);
Sub genitaux(*genit,0,_col,_col,_row);
domain().copy(genitaux,z1);
//Increment the t and seqel to the next element
++_t;
++_seqel;
//Update the state
if(/* _delta < 0 || */_beta < _delta - _sigma + _mu +1){
if(_t == _size)
_state._state = SequenceExceeded;
else{
if(_sigma > _delta /* && _delta >= 0*/)
_state._state = DeltaExceeded;
else
_state._state = GeneratorUnconfirmed;
}
}
else{
if(_sigma > _delta)
_state._state = DeltaExceeded;
else
_state._state = GeneratorFound;
}
if (_etc==0) {
_state._state=GeneratorFound;
}
return *this;
}
// Is this working? -AS
BM_iterator operator++(int)
{
//Create a copy of this
BM_iterator temp(*this);
//See if a matrix has been pushed on the sequence
//if it has, then recompute the seqel since it may
//have become corrupt.
//Also reset the size to the correct size of the sequence
if(_size < _seq.size()){
_seqel = _seq.begin();
for(int i = 0; i<_t; ++i)
++_seqel;
_size = _seq.size();
}
//if the iterator points past the seq elements, do nothing
if(_t == _size){
return *this;
}
//Initialize the discrepancy
Coefficient disc(field(),_row, _row+_col);
//Create two iterators, one for seq, and one for gen
typename BM_Seq::const_iterator cseqit;
typename std::list<Coefficient>::iterator genit;
//get an iterator to the seq element to be processed
cseqit = _seqel;
//Compute the discrepancy
for(genit = _gen.begin(); genit!=_gen.end(); ++genit, cseqit--){
domain().axpyin(disc,*cseqit,*genit);
} // cost: k*n^3 (nxn matrix muladds where k is current generator length)
// is a reductive addition over independent muls.
//Compute tau with Algorith3.2
Coefficient tau(field(), _row+_col, _row+_col);
Algorithm3dot2(tau, disc, _deg, _mu, _sigma, _beta);
// cost: n^3 for elim on n x about 2n
//Multiply tau into each matrix in the generator
for(genit = _gen.begin(); genit!=_gen.end(); ++genit){
domain().mulin(*genit,tau);
} // cost: k*n^3 (nxn matrix muls where k is current generator length)
// is k independent muls with a shared mat tau.
//Increment the auxiliary degrees and beta
for(size_t j = _col; j <_row+_col; ++j)
_deg[j]++;
++_beta;
//Add a zero matrix to the end of the generator if needed.
int tmax = (int)_deg[0];
for(size_t j = 1; j<_row+_col; ++j)
if(tmax < _deg[j])
tmax = (int)_deg[j];
if(tmax+1 > _gensize){
_gen.push_back(Coefficient(field(),_col,_row+_col));
++_gensize;
}
//Mimic multiplication by z in the auxiliary columns
typename std::list<Coefficient>::reverse_iterator g1,g2;
g1 = _gen.rbegin();
g2 = _gen.rbegin();
++g1;
while(g1!=_gen.rend()){
Sub g1aux(*g1,0,_col,_col,_row);
Sub g2aux(*g2,0,_col,_col,_row);
domain().copy(g2aux,g1aux);
++g1;
++g2;
}
genit = _gen.begin();
Coefficient z1(field(),_col,_row);
Sub genitaux(*genit,0,_col,_col,_row);
domain().copy(genitaux,z1);
//Increment the t and seqel to the next element
++_t;
++_seqel;
//Update the state
if(/* _delta < 0 || */ _beta < _delta - _sigma + _mu +1){
if(_t == _size)
_state._state = SequenceExceeded;
else{
if(_sigma > _delta /* && _delta >= 0 */)
_state._state = DeltaExceeded;
else
_state._state = GeneratorUnconfirmed;
}
}
else{
if(_sigma > _delta)
_state._state = DeltaExceeded;
else
_state._state = GeneratorFound;
}
return temp;
}
//return a reference to the current generator, in its algorithmic reversed form
value_type& operator*()
{
return _gen;
}
//overload the pointer operator
value_type* operator->()
{
return &_gen;
}
//Return a vector representing the reversal, by nominal degree, of the current generator
std::vector<Coefficient> GetGenerator()
{
std::vector<Coefficient> revgen(_mu+1, Coefficient(field(),_col,_col));
for(size_t i = 0; i<_col; ++i){
typename std::list<Coefficient>::iterator genit = _gen.begin();
for(int j = 0; j < (int)_deg[i]+1; ++j){
ColumnCopy(revgen[_deg[i]-j], *genit,i);
++genit;
}
}
return revgen;
}
typename BM_Seq::size_type get_t()
{
return _t;
}
int get_mu()
{
return _mu;
}
int get_sigma()
{
return _sigma;
}
int get_beta()
{
return _beta;
}
int get_delta()
{
return _delta;
}
std::vector<size_t> get_deg()
{
std::vector<size_t> gendegree(&_deg[0], &_deg[_col]);
return gendegree;
}
}; //End of BM_iterator
//return an initialized BM_iterator
typename BM_Seq::BM_iterator BM_begin(int earlyTermThreshold)
{
return typename BM_Seq::BM_iterator(*this,earlyTermThreshold);
}
//return an initialized BM_iterator that points to one past the end of the sequence
typename BM_Seq::BM_iterator BM_end()
{
return typename BM_Seq::BM_iterator(*this, -1, _size);
}
/**/
};//End of BM_Seq
}; //end of class BlockCoppersmithDomain
// construct P s.t. \sum_{i}P[i]A^{i}=0
template<class _Domain, class _Sequence>
std::vector<size_t> BlockCoppersmithDomain<_Domain,
_Sequence>::
right_minpoly (std::vector<Coefficient> &P)
{
//Get the row and column dimensions
const size_t r = _container->rowdim();
const size_t c = _container->coldim();
typename Sequence::const_iterator contiter(_container->begin());
//Create the BM_Seq, that will use the Coppersmith Block Berlekamp Massey Algorithm to compute the minimal generator.
BM_Seq seq(domain(),r,c);
//Push the first projection onto the BM_Seq
seq.push_back(*contiter);
//Create the BM_Seq iterator whose incrementation performs a step of the generator
typename BM_Seq::BM_iterator bmit(seq.BM_begin(EARLY_TERM_THRESHOLD));
bmit.setDelta((int)(2*_container->getBB()->rowdim()+1));
typename BM_Seq::BM_iterator::TerminationState check = bmit.state();
while(!check.IsGeneratorFound() ){
++bmit;
check = bmit.state();
if(check.IsSequenceExceeded()){
CTimer start; start.start();
++contiter;
start.stop();
g_time1+=start.realtime();
seq.push_back(*contiter);
}
}
P = bmit.GetGenerator();
std::vector<size_t> deg(bmit.get_deg());
commentator().report(Commentator::LEVEL_IMPORTANT,TIMING_MEASURE) <<
"Times: " << g_time1 << " " << g_time2 << " " << g_time3 << " " << g_time4<<std::endl;
return deg;
}
} // end of namespace LinBox
#endif // __LINBOX_coppersmith_block_domain_H
// 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:
|