/usr/include/linbox/algorithms/rational-solver-adaptive.h 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 | /* Copyright (C) 2007 LinBox
*
* Written by Zhendong Wan <wan@mail.eecis.udel.edu>
*
*
* ========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========
*/
#ifndef __LINBOX_rational_solver_adaptive_H
#define __LINBOX_rational_solver_adaptive_H
#include "linbox/linbox-config.h"
#include "linbox/util/debug.h"
#include "linbox/ring/modular.h"
#include "linbox/algorithms/rational-solver.h"
#include "linbox/randiter/random-prime.h"
namespace LinBox
{
// Generic non-numerical solver requires conversion of the vector
template<class IRing, class OutVector, class InVector>
struct RationalSolverAdaptiveClass {
static SolverReturnStatus solveNonsingular(OutVector& num, typename IRing::Element& den, const BlasMatrix<IRing>& M, const InVector& b)
{
linbox_check ((M. rowdim() == M. coldim()) && (b.size() == M.rowdim()) && (num. size() ==M.coldim()));
typedef Givaro::Modular<int32_t> Field;
// typedef Givaro::Modular<double> Field;
RationalSolver<IRing, Field, RandomPrimeIterator, NumSymNormTraits> numerical_solver;
//RationalSolver<IRing, Field, RandomPrimeIterator, NumSymOverlapTraits> numerical_solver;
SolverReturnStatus ret;
ret = numerical_solver. solve(num, den, M, b);
if (ret != SS_OK) {
RationalSolver<IRing, Field, RandomPrimeIterator> solver;
BlasVector<IRing> Ib(M.field()); Ib.reserve(b.size());
typename IRing::Element tmp;
for(typename InVector::const_iterator biter = b.begin();
biter != b.end();
++biter) {
Ib.push_back( M.field().init(tmp, *biter) );
}
ret = solver. solve(num, den, M, Ib);
}
return ret;
}
};
// Specialization when the vector is already over the ring
template<class IRing, class OutVector, template<typename T> class Container>
struct RationalSolverAdaptiveClass<IRing, OutVector, Container<typename IRing::Element> > {
static SolverReturnStatus solveNonsingular(OutVector& num, typename IRing::Element& den, const BlasMatrix<IRing>& M, const Container<typename IRing::Element> & b) {
linbox_check ((M. rowdim() == M. coldim()) && (b.size() == M.rowdim()) && (num. size() ==M.coldim()));
typedef Givaro::Modular<int32_t> Field;
// typedef Givaro::Modular<double> Field;
RationalSolver<IRing, Field, RandomPrimeIterator, NumSymOverlapTraits> numerical_solver;
SolverReturnStatus ret;
ret = numerical_solver. solve(num, den, M, b);
if (ret != SS_OK) {
RationalSolver<IRing, Field, RandomPrimeIterator> solver;
ret = solver. solve(num, den, M, b);
}
return ret;
}
};
class RationalSolverAdaptive {
public:
template<class IRing, class OutVector, class InVector>
static SolverReturnStatus solveNonsingular(OutVector& num, typename IRing::Element& den, const BlasMatrix<IRing>& M, const InVector& b) {
return RationalSolverAdaptiveClass<IRing,OutVector,InVector>::solveNonsingular(num, den, M, b);
}
};
}
#endif //__LINBOX_rational_solver_adaptive_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|