/usr/share/doc/liblinbox-dev/examples/sparseelimdet.C 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 | /*
* examples/sparseelimdet.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/sparseelimdet.C
* @example examples/sparseelimdet.C
\brief Gaussian elimination determinant of sparse matrix over Z or Zp.
\ingroup examples
*/
#include <linbox/linbox-config.h>
#include <iostream>
#include <vector>
#include <utility>
#include <linbox/ring/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/solutions/det.h>
using namespace LinBox;
using namespace std;
int main (int argc, char **argv)
{
commentator().setMaxDetailLevel (-1);
commentator().setMaxDepth (-1);
commentator().setReportStream (std::cerr);
if (argc < 2 || argc > 3)
{ cerr << "Usage: sparseelimdet <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; }
Method::SparseElimination SE;
if (argc == 2) { // determinant over the integers.
Givaro::ZRing<Integer> ZZ;
SparseMatrix<Givaro::ZRing<Integer> > A ( ZZ );
A.read(input);
cout << "A is " << A.rowdim() << " by " << A.coldim() << endl;
SE.strategy(Specifier::PIVOT_LINEAR);
Givaro::ZRing<Integer>::Element d;
det (d, A, SE);
ZZ.write(cout << "Determinant is ", d) << endl;
}
if (argc == 3) { // determinant over a finite field
typedef Givaro::Modular<double> Field;
double q = atof(argv[2]);
Field F(q);
SparseMatrix<Field> B (F);
B.read(input);
cout << "B is " << B.rowdim() << " by " << B.coldim() << endl;
if (B.rowdim() <= 20 && B.coldim() <= 20) B.write(cout) << endl;
// using Sparse Elimination
SE.strategy(Specifier::PIVOT_NONE);
Field::Element d;
det (d, B, SE);
if (B.rowdim() <= 20 && B.coldim() <= 20)
B.write(cout) << endl;
F.write(cout << "Determinant is ", d) << endl;
// using Sparse Elimination with reordering
SE.strategy(Specifier::PIVOT_LINEAR);
detin (d, B, SE);
if (B.rowdim() <= 20 && B.coldim() <= 20)
B.write(cout) << endl;
F.write(cout << "Determinant is ", d) << endl;
}
return 0;
}
// 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
|