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
|
/*
* examples/sparseelimrank.C
*
* Copyright (C) 2006, 2010 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/sparseelimrank.C
* @example examples/sparseelimrank.C
\brief Gaussian elimination Rank of sparse matrix over Z or Zp.
\ingroup examples
*/
#include <linbox/linbox-config.h>
#include <iostream>
#include <vector>
#include <utility>
#include <givaro/zring.h>
#include <givaro/givrational.h>
#include <givaro/modular.h>
#include <linbox/field/gf2.h>
#include <linbox/matrix/sparse-matrix.h>
#include <linbox/blackbox/zero-one.h>
#include <linbox/solutions/rank.h>
#include <linbox/util/matrix-stream.h>
using namespace LinBox;
using namespace std;
int main (int argc, char **argv)
{
commentator().setMaxDetailLevel (-1);
commentator().setMaxDepth (-1);
commentator().setReportStream (std::cerr);
commentator().setBriefReportStream (std::cout);
if (argc < 2 || argc > 3)
{ cerr << "Usage: rank <matrix-file-in-supported-format> [<p>]" << endl; return -1; }
ifstream input (argv[1]);
if (!input) { cerr << "Error opening matrix file: " << argv[1] << endl; return -1; }
size_t r;
if (argc == 2) { // rank over the integers.
/* We could pick a random prime and work mod that prime, But the point here
is that the rank function in solutions/ handles that issue. Our matrix here
is an integer matrix and our concept is that we are getting the rank of that
matrix by some blackbox magic inside linbox.
*/
Givaro::QField<Givaro::Rational> QQ;
MatrixStream<Givaro::QField<Givaro::Rational>> ms( QQ, input );
SparseMatrix<Givaro::QField<Givaro::Rational>, SparseMatrixFormat::SparseSeq > A ( ms );
if (A.rowdim() <= 20 && A.coldim() <= 20) A.write(std::cerr << "A:=",Tag::FileFormat::Maple) << ';' << std::endl;
cout << "A is " << A.rowdim() << " by " << A.coldim() << endl;
LinBox::rank (r, A, Method::SparseElimination() );
cout << "Z Rank is " << r << endl;
}
if (argc == 3) {
double q = atof(argv[2]);
typedef Givaro::Modular<double> Field;
Field F(q);
MatrixStream<Field> ms( F, input );
SparseMatrix<Field, SparseMatrixFormat::SparseSeq > B (ms);
cout << "B is " << B.rowdim() << " by " << B.coldim() << endl;
if (B.rowdim() <= 20 && B.coldim() <= 20) B.write(cout) << endl;
Method::SparseElimination SE;
// SE.pivotStrategy = PivotStrategy::None;
// // using Sparse Elimination
// LinBox::rank (r, B, SE);
// if (B.rowdim() <= 20 && B.coldim() <= 20) B.write(cout) << endl;
// cout << "Rank is " << r << endl;
SE.pivotStrategy = PivotStrategy::Linear;
// using Sparse Elimination
Givaro::Timer chrono; chrono.start();
LinBox::rankInPlace (r, B, SE);
chrono.stop();
if (B.rowdim() <= 20 && B.coldim() <= 20) B.write(cout) << endl;
F.write(cout << "Rank is " << r << " over ") << endl;
std::cerr << chrono << 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
|
