/usr/include/linbox/algorithms/matrix-blas3/mul.h is in liblinbox-dev 1.3.2-1.1build2.
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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 | /* Copyright (C) 2012 the members of the LinBox group
* Written by B. Boyer < bboyer@imag.fr >
*
* This file is part of the LinBox library.
*
* ========LICENCE========
* 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.
*
* LinBox 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========
*
*/
/*! @file matrix-blas3/mul.h
* @ingroup algorithm
* @ingroup blas
* @brief BLAS3 multiplication algorithms.
*/
#ifndef __LINBOX_matrix_blas3_mul_H
#define __LINBOX_matrix_blas3_mul_H
#include <vector>
#include "linbox/integer.h"
#include <linbox/field/givaro.h>
#include <linbox/matrix/blas-matrix.h>
// Methods
namespace LinBox {
namespace BLAS3 {
//! BLAS3 Multiplication methods
namespace mulMethod {
template<class Field>
struct ToomCook {
const Field & _myF;
bool memory_unlimited ;
ToomCook(Field & myF, bool mem = false) :
_myF(myF),
memory_unlimited(mem)
{};
// this is the place for the helper/caching (TC,iTC).
} ; //! Toom-Cook method.
struct naive {};
}
}
}
// ToomCook
namespace LinBox {
namespace BLAS3 {
/** @brief Build the Toom-Cook matrix helper.
* We only provide this function for dense matrices (Blas for
* the moment) over Z/pZ.
* @param [out] TC matrix of Fp(i^j)
* @param [out] iTC inverse of TC
* @return \p TC
*/
template<class Zpz>
BlasMatrix<Zpz>& ToomCook(BlasMatrix<Zpz>& TC, BlasMatrix<Zpz>& iTC);
/** @brief Toom-Cook multiplication for GF(p^e)
* A matrix over GF(p^e) is represented by a polynomial of Z/pZ matrices.
* @tparam Zpz is some modular field, GFq is GivaroExtension (or the like)
* @param [out] C result
* @param A matrix
* @param B matrix
* @return C=AB
* @warning p should not be too small, and e>1 (you've been warned...)
*/
template<class Zpz, class GFq>
std::vector<BlasMatrix<Zpz> >& mul (std::vector<BlasMatrix<Zpz> >& C,
const std::vector<BlasMatrix<Zpz> >&A,
const std::vector<BlasMatrix<Zpz> >&B,
const mulMethod::ToomCook<GFq>& T);
/** @brief Toom-Cook multiplication for GF(p^e)
*
* @tparam Zpz is some modular field, GFq is GivaroExtension (or the like)
* @param [out] C result
* @param A matrix
* @param B matrix
* @return C=AB
* @warning p should not be too small, and e>1 (you've been warned...)
*/
template<class Zpz>
BlasMatrix<GivaroExtension<Zpz> >&
mul (BlasMatrix<GivaroExtension<Zpz> >& C,
const BlasMatrix<GivaroExtension<Zpz> >& A,
const BlasMatrix<GivaroExtension<Zpz> >& B,
const mulMethod::ToomCook<GivaroExtension<Zpz> > & T);
#if 0 /* Generic method */
template<class ZpzMatrix>
std::vector<ZpzMatrix >& mul (std::vector<ZpzMatrix >& C,
std::vector<ZpzMatrix >&A,
std::vector<ZpzMatrix >&B,
const mulMethod::ToomCook &);
#endif
} // BLAS3
}
#include "linbox/algorithms/matrix-blas3/mul-toomcook.inl"
// naive
namespace LinBox {
namespace BLAS3 {
/** @brief Triple loop !
* just a simple triple loop
* @pre works if _anyMatrix has setEntry and _otherMatrix has getEntry
* @param [out] C result
* @param [in] A matrix
* @param [in] B matrix
* @return C=AB
*/
template<class _anyMatrix, class _otherMatrix1, class _otherMatrix2>
_anyMatrix & mul (_anyMatrix& C,
const _otherMatrix1& A,
const _otherMatrix2& B,
const mulMethod::naive &);
}
}
#include "linbox/algorithms/matrix-blas3/mul-naive.inl"
// <+other algo+>
namespace LinBox {
namespace BLAS3 {
}
}
//#include "linbox/algorithms/matrix-blas3/mul-<+other algo+>.inl"
#endif // __LINBOX_matrix_blas3_mul_H
//Local Variables:
//mode: C++
//tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|