Outputs a big and very sparse matrix.let C be the cyclic shift matrix with 1 on the 1,n position and along the first subdiagonal.
This matrix is . It has 2 nonzero entries per row and per column. It is an matrix whose determinant is considerably less than the Hadamard bound (but is large – 3^n +- 2^n).
/*
* examples/bigmat.C
*
* Copyright (C) 2007, 2010 B Youse, D. Saunders
* ========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