/usr/include/linbox/algorithms/numeric-solver-lapack.h is in liblinbox-dev 1.4.2-3.
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 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 | /* Copyright (C) 2011 LinBox
* Written Bryan Youse <>
*
*
*
* ========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========
*/
/* numeric-solver-lapack.h
* numeric solver using lapack routines
* to support development of iterative numeric/symbolic solver
*/
#ifndef __LINBOX_numeric_solver_lapack_H
#define __LINBOX_numeric_solver_lapack_H
namespace LinBox {
template <class Matrix>
struct LPS {
LPS() : _Ap(NULL), _IM(NULL), _m(0), _n(0) {}
~LPS() {
if(_IM) {
// std::cout << "delete" << std::endl;
delete[] _IM;
}
}
LPS(Matrix& A) { init(A); }
int init(Matrix & A); // set up for solving - expect multiple subsequent calls to solve() and apply().
template<class Vector> int solve(Vector& x, const Vector& b); // x such that Ax = b (approx)
template<class Vector> Vector& apply(Vector& y, const Vector& x); // y = Ax (approx)
protected:
Matrix* _Ap; // for right now, assume this points to the input, double matrix A.
double *_IM;
size_t _m, _n;
};
template <class Matrix>
int LPS<Matrix>::init(Matrix& A)
{
_Ap = &A; // would need memcpy if *_Ap to get mods.
_m = A.rowdim();
_n = A.coldim();
// kludgey pointer to beginning of double vals
void *thedata = &*(_Ap->Begin());
linbox_check(_n);
_IM = new double[_n * _n];
memcpy((void *)_IM, thedata, sizeof(double)*_m*_n);
// time to set up inverse of matrix
int lda = (int)_n;
int * P = new int[_n];
// std::cerr << "Bef getrf: M_0,0 " << *_IM << ", M_n-1,n-1 " << *(_IM+_n*_n-1) << std::endl;
int ierr = clapack_dgetrf (CblasRowMajor, (int)_n, (int)_n, _IM, lda, P);
// std::cerr << "Aft getrf: M_0,0 " << *_IM << ", M_n-1,n-1 " << *(_IM+_n*_n-1) << std::endl;
if (ierr != 0) {
// std::cerr << "In LPS::init Matrix is not full rank" << std::endl;
delete[] P ;
return -1;
}
clapack_dgetri (CblasRowMajor, (int)_n, _IM, lda, P);
delete[] P ;
return 0;
}
template <class Matrix>
template<class Vector>
int LPS<Matrix>::solve(Vector& x, const Vector& b)
{
linbox_check(typeid(typename Vector::value_type)==typeid(double));
// std::cout << "input :" << b << std::endl;
const double * bdata = &*(b.begin());
double * xdata = &*(x.begin());
cblas_dgemv(CblasRowMajor, CblasNoTrans, (int)_m, (int)_n, 1, _IM, (int)_n, bdata, 1, 0, xdata, 1);
// std::cout << "result to solve :" << x << std::endl;
return 0;
}
template <class Matrix>
template<class Vector>
Vector& LPS<Matrix>::apply(Vector& y, const Vector& x)
{
// std::cout << "input :" << x << std::endl;
const double * xdata = &*(x.begin());
double * ydata = &*(y.begin());
double *thedata = &*(_Ap->Begin());
cblas_dgemv(CblasRowMajor, CblasNoTrans, (int)_m, (int)_n, 1, thedata, (int)_n, xdata, 1, 0, ydata, 1);
// std::cout << "result to apply :" << y << std::endl;
return y;
}
} // namespace LinBox
#endif // __LINBOX_numeric_solver_lapack_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:
|