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
|
/*
* examples/minpoly.C
*
* Copyright (C) 2005, 2010 D Saunders, J-G 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 examples/minpoly.C
* @example examples/minpoly.C
\brief Minimal polynomial of a sparse matrix.
\ingroup examples
*/
#ifndef DISABLE_COMMENTATOR
#define DISABLE_COMMENTATOR
#endif
#define __LB_VALENCE_REPORTING__ 1
#define __LB_CRA_REPORTING__ 1
#define __LB_CRA_TIMING__ 1
#define __LINBOX_HEURISTIC_CRA 1
#include <linbox/linbox-config.h>
#include <iostream>
//! @bug this should be elsewhere
template <class Field, class Polynomial>
std::ostream& printPolynomial (std::ostream& out, const Field &F, const Polynomial &v)
{
for (int i = (int)v.size () ; i-- ; ) {
F.write (out, v[(size_t)i]);
if (i > 0)
out << " x^" << i << " + ";
}
return out;
}
#include <linbox/ring/modular.h>
#include <linbox/matrix/sparse-matrix.h>
#include <linbox/blackbox/compose.h>
#include <linbox/polynomial/dense-polynomial.h>
#include <linbox/solutions/minpoly.h>
using namespace LinBox;
using namespace std;
int main (int argc, char **argv)
{
commentator().setMaxDetailLevel (-1);
commentator().setMaxDepth (-1);
commentator().setReportStream (std::clog);
int a = argc;
while(a--){
cerr << "argv[" << a << "] = " << argv[a] << endl;
}
if (argc < 2) {
cerr << "Usage: minpoly <matrix-file-in-SMS-format> [<p>]" << endl;
return -1;
}
ifstream input (argv[1]);
if (!input) { cerr << "Error opening matrix file " << argv[1] << endl; return -1; }
if (argc != 3) {
LinBox::Timer chrono;
Method::Auto M;
Givaro::ZRing<Integer> ZZ;
DensePolynomial<Givaro::ZRing<Integer> > m_A(ZZ);
typedef SparseMatrix<Givaro::ZRing<Integer>> SpMat;
SpMat B (ZZ);
B.read (input);
if (B.rowdim() == B.coldim()) {
std::clog << "B is " << B.rowdim() << " by " << B.coldim() << endl;
chrono.start();
PAR_BLOCK {
minpoly (m_A, B, M);
}
chrono.stop();
} else {
// Minpoly of B . Transpose(B) or Transpose(B) . B
typedef Transpose<SpMat> BB2;
BB2 BT(B);
if (B.rowdim() > B.coldim()) {
Compose<BB2, SpMat> A(BT,B);
std::clog << "(B^T . B) is " << A.rowdim() << " by " << A.coldim() << endl;
chrono.start();
PAR_BLOCK {
minpoly (m_A, A, M);
}
chrono.stop();
} else {
Compose<SpMat, BB2 > A(B,BT);
std::clog << "(B . B^T) is " << A.rowdim() << " by " << A.coldim() << endl;
chrono.start();
PAR_BLOCK {
minpoly (m_A, A, M);
}
chrono.stop();
}
}
std::clog << "Minimal Polynomial, " << chrono << ", is: ";
printPolynomial (std::cout, ZZ, m_A) << std::endl;
}
else{
typedef Givaro::Modular<double> Field;
double q = atof(argv[2]);
Field F(q);
SparseMatrix<Field> B (F);
Method::Auto M;
B.read (input);
cout << "B is " << B.rowdim() << " by " << B.coldim() << endl;
DensePolynomial<Field> m_B(F);
minpoly (m_B, B, M);
cout << "Minimal Polynomial is ";
printPolynomial (std::cout, F, m_B) << std::endl;
}
return 0;
}
// Local Variables:
// mode: C++
// tab-width: 4
// indent-tabs-mode: nil
// c-basic-offset: 4
// End:
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|
