<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>linbox: examples/rank.C</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<script type="text/javascript">
function hasClass(ele,cls) {
return ele.className.match(new RegExp('(\\s|^)'+cls+'(\\s|$)'));
}
function addClass(ele,cls) {
if (!this.hasClass(ele,cls)) ele.className += " "+cls;
}
function removeClass(ele,cls) {
if (hasClass(ele,cls)) {
var reg = new RegExp('(\\s|^)'+cls+'(\\s|$)');
ele.className=ele.className.replace(reg,' ');
}
}
function toggleVisibility(linkObj) {
var base = linkObj.getAttribute('id');
var summary = document.getElementById(base + '-summary');
var content = document.getElementById(base + '-content');
var trigger = document.getElementById(base + '-trigger');
if ( hasClass(linkObj,'closed') ) {
summary.style.display = 'none';
content.style.display = 'block';
trigger.src = 'open.png';
removeClass(linkObj,'closed');
addClass(linkObj,'opened');
} else if ( hasClass(linkObj,'opened') ) {
summary.style.display = 'block';
content.style.display = 'none';
trigger.src = 'closed.png';
removeClass(linkObj,'opened');
addClass(linkObj,'closed');
}
return false;
}
</script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">linbox</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
<li><a href="examples.html"><span>Examples</span></a></li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">examples/rank.C</div> </div>
</div>
<div class="contents">
<p>Rank of sparse matrix over Z or Zp.</p>
<div class="fragment"><pre class="fragment"><span class="comment">/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */</span>
<span class="comment">// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s</span>
<span class="comment">/*</span>
<span class="comment"> * examples/rank.C</span>
<span class="comment"> *</span>
<span class="comment"> * Copyright (C) 2005, 2010 D. Saunders, J-G Dumas</span>
<span class="comment"> *</span>
<span class="comment"> * This file is part of LinBox.</span>
<span class="comment"> *</span>
<span class="comment"> * LinBox is free software: you can redistribute it and/or modify</span>
<span class="comment"> * it under the terms of the GNU Lesser General Public License as</span>
<span class="comment"> * published by the Free Software Foundation, either version 2 of</span>
<span class="comment"> * the License, or (at your option) any later version.</span>
<span class="comment"> *</span>
<span class="comment"> * LinBox is distributed in the hope that it will be useful,</span>
<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<span class="comment"> * GNU Lesser General Public License for more details.</span>
<span class="comment"> *</span>
<span class="comment"> * You should have received a copy of the GNU Lesser General Public</span>
<span class="comment"> * License along with LinBox. If not, see</span>
<span class="comment"> * <http://www.gnu.org/licenses/>.</span>
<span class="comment"> */</span>
<span class="preprocessor">#include <iostream></span>
<span class="preprocessor">#include <sstream></span>
<span class="comment">//#include "linbox/field/modular.h"</span>
<span class="preprocessor">#include "<a class="code" href="modular-double_8h.html" title="Standard representation of Z/mZ over double .">linbox/field/modular-double.h</a>"</span>
<span class="preprocessor">#include "linbox/field/gf2.h"</span>
<span class="preprocessor">#include "linbox/blackbox/sparse.h"</span>
<span class="preprocessor">#include "linbox/blackbox/zero-one.h"</span>
<span class="preprocessor">#include "linbox/solutions/rank.h"</span>
<span class="preprocessor">#include "linbox/util/matrix-stream.h"</span>
<span class="preprocessor">#include "linbox/field/givaro-rational.h"</span>
<span class="keyword">using namespace </span>LinBox;
<span class="keyword">using namespace </span>std;
<span class="keywordtype">int</span> main (<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv)
{
commentator.<a name="a0"></a>setMaxDetailLevel (-1);
commentator.<a name="a1"></a>setMaxDepth (-1);
commentator.<a name="a2"></a>setReportStream (std::cerr);
<span class="keywordflow">if</span> (argc < 2 || argc > 3)
{ cerr << <span class="stringliteral">"Usage: rank <matrix-file-in-supported-format> [<p>]"</span> << endl; <span class="keywordflow">return</span> -1; }
ifstream input (argv[1]);
<span class="keywordflow">if</span> (!input) { cerr << <span class="stringliteral">"Error opening matrix file: "</span> << argv[1] << endl; <span class="keywordflow">return</span> -1; }
<span class="keywordtype">long</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> r;
<span class="keywordflow">if</span> (argc == 2) { <span class="comment">// rank over the rational numbers.</span>
<span class="comment">/* We could pick a random prime and work mod that prime, But the point here</span>
<span class="comment"> is that the rank function in solutions/ handles that issue. Our matrix here</span>
<span class="comment"> is an integer or rational matrix and our concept is that we are getting the rank of that</span>
<span class="comment"> matrix by some blackbox magic inside linbox.</span>
<span class="comment"> */</span>
LinBox::GivaroRational ZZ;
<a name="_a3"></a><a class="code" href="class_lin_box_1_1_matrix_stream.html" title="MatrixStream.">MatrixStream<GivaroRational></a> ms( ZZ, input );
<a name="_a4"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html" title="vector of sparse rows.">SparseMatrix<GivaroRational></a> A ( ms );
cout << <span class="stringliteral">"A is "</span> << A.<a name="a5"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html#a0fee90e6b8ef7fcd8d76a7f3e1f268e6" title="Retreive row dimensions of Sparsemat matrix.">rowdim</a>() << <span class="stringliteral">" by "</span> << A.<a name="a6"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html#a32edb490d3597f5553152d14b102e227" title="Retreive column dimensions of Sparsemat matrix.">coldim</a>() << endl;
<a name="a7"></a><a class="code" href="group__solutions.html#gaae3c1f7fd3319410ac4fc3e4e3afdd01" title="Compute the rank of a linear transform A over a field by selected method.">rank</a> (r, A);
}
<span class="keywordflow">if</span> (argc == 3) { <span class="comment">// rank mod a prime</span>
<span class="comment">/*</span>
<span class="comment"> //for prime greater than wordsize:</span>
<span class="comment"> stringstream qstr(argv[2]);</span>
<span class="comment"> integer q;</span>
<span class="comment"> qstr >> q;</span>
<span class="comment"> typedef Modular<integer> Field;</span>
<span class="comment"> */</span>
<span class="comment">/*</span>
<span class="comment"> //to use doubles, prime < 2^{23}</span>
<span class="comment"> double q = atof(argv[2]);</span>
<span class="comment"> typedef Modular<double> Field;</span>
<span class="comment"> */</span>
<span class="comment">//to use ints, prime < 2^{31}</span>
int32_t q = atoi(argv[2]);
<span class="keyword">typedef</span> <a name="_a8"></a><a class="code" href="class_lin_box_1_1_modular_3_01int32__t_01_4.html" title="Specialization of Modular to int32_t element type with efficient dot product.">Modular<int32_t></a> <a name="_a9"></a><a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
Field F(q);
<a class="code" href="class_lin_box_1_1_matrix_stream.html" title="MatrixStream.">MatrixStream<Field></a> ms( F, input );
<a class="code" href="class_lin_box_1_1_sparse_matrix.html" title="vector of sparse rows.">SparseMatrix<Field, Vector<Field>::SparseSeq</a> > B (ms);
cout << <span class="stringliteral">"B is "</span> << B.<a name="a10"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html#a0fee90e6b8ef7fcd8d76a7f3e1f268e6" title="Retreive row dimensions of Sparsemat matrix.">rowdim</a>() << <span class="stringliteral">" by "</span> << B.<a name="a11"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html#a32edb490d3597f5553152d14b102e227" title="Retreive column dimensions of Sparsemat matrix.">coldim</a>() << endl;
<span class="keywordflow">if</span> (B.<a class="code" href="class_lin_box_1_1_sparse_matrix.html#a0fee90e6b8ef7fcd8d76a7f3e1f268e6" title="Retreive row dimensions of Sparsemat matrix.">rowdim</a>() <= 20 && B.<a class="code" href="class_lin_box_1_1_sparse_matrix.html#a32edb490d3597f5553152d14b102e227" title="Retreive column dimensions of Sparsemat matrix.">coldim</a>() <= 20) B.<a name="a12"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html#a88c3c3a75cf316163873d477c6412674" title="Write the matrix to a stream in the given format.">write</a>(cout) << endl;
<span class="comment">// Using the adaptive LinBox Solution</span>
<a class="code" href="group__solutions.html#gaae3c1f7fd3319410ac4fc3e4e3afdd01" title="Compute the rank of a linear transform A over a field by selected method.">rank</a>(r,B);
<span class="comment">// using BlackBoxes</span>
<span class="comment">/*</span>
<span class="comment"> Method::Blackbox MBB;</span>
<span class="comment"> MBB.certificate(true);</span>
<span class="comment"> rank(r, B, MBB);</span>
<span class="comment"> */</span>
<span class="comment">// using in place Sparse Elimination with linear pivoting</span>
<span class="comment">/*</span>
<span class="comment"> Method::SparseElimination SE;</span>
<span class="comment"> SE.strategy(Specifier::PIVOT_LINEAR);</span>
<span class="comment"> rankin (r, B, SE);</span>
<span class="comment"> if (B.rowdim() <= 20 && B.coldim() <= 20) B.write(cout) << endl;</span>
<span class="comment"> */</span>
}
cout << <span class="stringliteral">"Rank is "</span> << r << endl;
<span class="keywordflow">return</span> 0;
}
</pre></div> </div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Tue Aug 30 2011 for linbox by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
