/usr/include/linbox/algorithms/blackbox-container-symmetrize.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 | /* linbox/algorithms/blackbox-container-symmetrize.h
* Copyright (C) 1999, 2001 Jean-Guillaume Dumas
*
* Written by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>,
*
* ------------------------------------
* Bradford Hovinen <hovinen@cis.udel.edu>
*
* Ported to linbox-new framework; replaced use of DOTPROD, etc. with
* VectorDomain
* ------------------------------------
*
*
* ========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========
*.
*/
/*! @internal
* @file algorithms/blackbox-containter-symetrize.h
* @ingroup algorithms
* @brief Symmetrizing iterator for rank computations
*/
#ifndef __LINBOX_blackbox_container_symmetrize_H
#define __LINBOX_blackbox_container_symmetrize_H
#include "linbox/algorithms/blackbox-container-base.h"
namespace LinBox
{
/** \brief Symmetrizing iterator (for rank computations).
* @ingroup algorithms
*
* Symmetrizing iterator (for rank computations)
* Same left and right vector
* A is supposed to have tranpose-vector product
* the sequence is
*
\code
this->u^t this->u
(A this->u)^t (A this->u) = this->u^t (A^t A) this->u
(A^t (A this->u))^t (A^t (A this->u)) = this->u^t (A^t A)^2 this->u
etc.
\endcode
*/
template<class Field, class _Blackbox, class RandIter = typename Field::RandIter>
class BlackboxContainerSymmetrize : public BlackboxContainerBase<Field, _Blackbox> {
public:
typedef _Blackbox Blackbox;
BlackboxContainerSymmetrize () {}
template<class Vector>
BlackboxContainerSymmetrize (const Blackbox *D, const Field &F, const Vector &u0) :
BlackboxContainerBase<Field, Blackbox> (D, F)
{
init (u0);
}
//BlackboxContainerSymmetrize (const Blackbox *D, const Field &F, RandIter &g = typename Field::RandIter(_field) )
BlackboxContainerSymmetrize (const Blackbox *D, const Field &F, RandIter &g = typename Field::RandIter() ) :
BlackboxContainerBase<Field, Blackbox> (D, F)
{
init (g);
}
private:
void _launch ()
{
if (this->casenumber) {
this->casenumber = 0;
this->_BB->apply (this->v, this->u);
this->_VD.dot (this->_value, this->v, this->v);
}
else {
this->casenumber = 1;
this->_BB->applyTranspose (this->u, this->v);
this->_VD.dot (this->_value, this->u, this->u);
}
}
void _wait () {}
};
}
#endif // __LINBOX_blackbox_container_symmetrize_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:
|