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
|
/* lb-minpoly.C
* Copyright (C) 2005 Pascal Giorgi
*
* Written by Pascal Giorgi <pgiorgi@uwaterloo.ca>
*
* ========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_lb_minpoly_C
#define __LINBOX_lb_minpoly_C
#include "linbox/solutions/minpoly.h"
#include <lb-minpoly.h>
#include <lb-blackbox-function.h>
#include <lb-vector.h>
extern BlackboxTable blackbox_hashtable;
extern VectorTable vector_hashtable;
/******************************
* Mininal Polynomial Functor *
******************************/
template<typename Method = LinBox::Method::Auto>
class MinpolyFunctor{
protected:
Method meth;
public:
MinpolyFunctor(Method m= Method()) : meth(m) {}
template<class Blackbox, class Result>
void operator() (Result &res, Blackbox *B) const {
typedef typename Blackbox::Field::Element Element;
std::vector<Element> * phi = static_cast<std::vector<Element>*>(res);
LinBox::minpoly(*phi, *B, meth);
res = phi;
}
};
/*************************************************************
* API for minimal polynomial computation *
* minimal polynomial is returned through a given vector key *
*************************************************************/
void lb_minpoly(const VectorKey &res, const BlackboxKey& key) {
MinpolyFunctor<> fct;
VectorTable::iterator it = vector_hashtable.find(res);
if ( it == vector_hashtable.end())
throw lb_runtime_error("LinBox ERROR: result polynomial does not exist (minpoly computation impossible)\n");
void *ret = it->second->getPtr();
BlackboxFunction::call(ret, key, fct);
}
/*******************************************************
* API for minimal polynomial computation *
* minimal polynomial is returned through a vector key *
*******************************************************/
const VectorKey& lb_minpoly(const BlackboxKey& key) {
BlackboxTable::iterator it = blackbox_hashtable.find(key);
if ( it == blackbox_hashtable.end())
throw lb_runtime_error("LinBox ERROR: blackbox is not defined (minpoly computation impossible)");
const VectorKey *res = & createVector(it->second->getDomainKey(), 0, "linbox_dense");
lb_minpoly(*res, key);
return *res;
}
#endif
// 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
|
