/usr/include/Rivet/Math/eigen/ludecomposition.h is in librivet-dev 1.8.3-1.1.
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 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra. Eigen itself is part of the KDE project.
//
// Copyright (C) 2006-2007 Benoit Jacob <jacob@math.jussieu.fr>
//
// Eigen is free software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the Free Software
// Foundation; either version 2 or (at your option) any later version.
//
// Eigen 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 General Public License for more
// details.
//
// You should have received a copy of the GNU General Public License along
// with Eigen; if not, write to the Free Software Foundation, Inc., 51
// Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
//
// As a special exception, if other files instantiate templates or use macros
// or inline functions from this file, or you compile this file and link it
// with other works to produce a work based on this file, this file does not
// by itself cause the resulting work to be covered by the GNU General Public
// License. This exception does not invalidate any other reasons why a work
// based on this file might be covered by the GNU General Public License.
/** \file ludecomposition.h
* \brief LU decompositions and related computations
*/
#ifndef EIGEN_LUDECOMPOSITION_H
#define EIGEN_LUDECOMPOSITION_H
#include "ludecompositionbase.h"
namespace Eigen
{
template<typename T, typename MatrixType,
typename VectorType, typename LUDecompositionType>
class LinearSolverBase;
template<typename T, int Size> class Matrix;
template<typename T, int Size> class Vector;
/** \ingroup fixedsize
*
* \ingroup ludecomp
*
* \brief LU decomposition of a fixed-size matrix
*
* The template parameter T is the type of the entries of the matrix to be
* decomposed.
* It can be any type representing either real or complex numbers.
* The template parameter Size is the size of the matrix (both height and
* width, as Eigen only allows square matrices).
* The following typedefs are provided to cover the usual cases:
* @code
typedef LUDecomposition<double, 2> LUDecomposition2d;
typedef LUDecomposition<double, 3> LUDecomposition3d;
typedef LUDecomposition<double, 4> LUDecomposition4d;
typedef LUDecomposition<float, 2> LUDecomposition2f;
typedef LUDecomposition<float, 3> LUDecomposition3f;
typedef LUDecomposition<float, 4> LUDecomposition4f;
typedef LUDecomposition<std::complex<double>, 2> LUDecomposition2cd;
typedef LUDecomposition<std::complex<double>, 3> LUDecomposition3cd;
typedef LUDecomposition<std::complex<double>, 4> LUDecomposition4cd;
typedef LUDecomposition<std::complex<float>, 2> LUDecomposition2cf;
typedef LUDecomposition<std::complex<float>, 3> LUDecomposition3cf;
typedef LUDecomposition<std::complex<float>, 4> LUDecomposition4cf;
* @endcode
*/
template<typename T, int Size>
class LUDecomposition
: public LUDecompositionBase< T,
Matrix<T, Size>,
Vector<T, Size>,
Vector<int, Size> >
{
friend class LinearSolverBase< T,
Matrix<T, Size>,
Vector<T, Size>,
LUDecomposition<T, Size> >;
public:
/** Performs the LU Decomposition of mat. Use this constructor. */
LUDecomposition( const Matrix<T, Size> & mat ) { this->perform( mat ); }
protected:
/** Default constructor. Does nothing. \internal
*/
LUDecomposition() {}
};
template<typename T> class MatrixX;
template<typename T> class VectorX;
/** \ingroup dynamicsize
*
* \ingroup ludecomp
*
* \brief LU decomposition of a dynamic-size matrix
*
* The template parameter T is the type of the entries of the matrix to be
* decomposed.
* It can be any type representing either real or complex numbers.
* The following typedefs are provided to cover the usual cases:
* @code
typedef LUDecompositionX<double> LUDecompositionXd;
typedef LUDecompositionX<float> LUDecompositionXf;
typedef LUDecompositionX< std::complex<double> > LUDecompositionXcd;
typedef LUDecompositionX< std::complex<float> > LUDecompositionXcf;
* @endcode
*/
template<typename T>
class LUDecompositionX
: public LUDecompositionBase< T,
MatrixX<T>,
VectorX<T>,
VectorX<int> >
{
friend class LinearSolverBase< T,
MatrixX<T>,
VectorX<T>,
LUDecompositionX<T> >;
public:
/** Performs the LU Decomposition of mat. Use this constructor. */
LUDecompositionX( const MatrixX<T> & mat ) { this->perform( mat ); }
protected:
/** Default constructor. Does nothing. \internal
*/
LUDecompositionX() {}
};
EIGEN_MAKE_FIXEDSIZE_TYPEDEFS(LUDecomposition)
EIGEN_MAKE_DYNAMICSIZE_TYPEDEFS(LUDecompositionX)
} // namespace Eigen
#endif // EIGEN_LUDECOMPOSITION_H
|