/usr/include/linbox/solutions/is-positive-definite.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 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 162 163 164 | /* Copyright (C) 2010 LinBox
*
*
* ========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_is_positive_definite_H
#define __LINBOX_is_positive_definite_H
#include "linbox/util/error.h"
#include "linbox/algorithms/matrix-hom.h"
#include "linbox/algorithms/signature.h"
namespace LinBox
{
// for specialization with respect to the DomainCategory
template< class Blackbox, class isPositiveDefiniteMethod, class DomainCategory>
bool isPositiveDefinite (
const Blackbox &A,
const DomainCategory &tag,
const isPositiveDefiniteMethod &M);
/** Compute the isPositiveDefinite of A.
*
* The isPositiveDefinite of a linear operator A, represented as a
* black box, is computed over the ring or field of A.
*
* @param A Black box of which to compute the isPositiveDefinite
* @param M may be a Method::Hybrid (default), Method::Blackbox, Method::Elimination, or of other method type.
\ingroup isPositiveDefinites
*/
template <class Blackbox, class MyMethod>
bool isPositiveDefinite (
const Blackbox &A,
const MyMethod &M)
{
return isPositiveDefinite( A, typename FieldTraits<typename Blackbox::Field>::categoryTag(), M);
}
// The isPositiveDefinite with default Method
template<class Blackbox>
bool isPositiveDefinite ( const Blackbox &A)
{
return isPositiveDefinite(A,
Method::Hybrid());
}
// The isPositiveDefinite for ModularTag (is nonsense)
template<class Blackbox, class MyMethod>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::ModularTag &tag,
const MyMethod& M)
{
//commentator << "nonsense!!"
throw (LinboxError("isPositiveDefinite: Integer matrix required"));
return false;
}
// The isPositiveDefinite with Hybrid Method
template<class Blackbox>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::Hybrid& M)
{
//! @bug should try a modular minpoly and decide on the degree of that...
if (A.rowdim() != A.coldim())
return false;
//! @bug this crude size check can be refined
if (A.coldim() > 7000)
return isPositiveDefinite(A, tag, Method::Blackbox(M));
else
return isPositiveDefinite(A, tag, Method::Elimination(M));
}
// The isPositiveDefinite with Elimination Method
template<class Blackbox>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::Elimination& M)
{
// this can be a hybrid of EliminationMinpoly and BlasElimination (which means use LU here)
// It will be faster to do EliminationMinpoly when deg(m_A) is low.
// right now it is just BlasElimination
return isPositiveDefinite(A, tag, Method::BlasElimination(M));
}
// The isPositiveDefinite with BlackBox Method
template<class Blackbox>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::Blackbox &M)
{
return isPositiveDefinite(A, tag, Method::Wiedemann(M));
}
// The isPositiveDefinite with Wiedemann, finite field.
template <class Blackbox>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::Wiedemann &M)
{
// call Wiedemann code
return Signature::isPosDef(A, Signature::Minpoly_Method() );
}
// the isPositiveDefinite with Blas.
template <class Blackbox>
bool isPositiveDefinite (
const Blackbox &A,
const RingCategories::IntegerTag &tag,
const Method::BlasElimination &M)
{
// call BlasElimination code
BlasMatrix<typename Blackbox::Field> DA(A.field(), A.rowdim(), A.coldim());
MatrixHom::map(DA, A); //! @bug why map (same field)? This is a copy.
return Signature::isPosDef(DA, Signature::BLAS_LPM_Method() );
}
template <class Ring>
bool isPositiveDefinite (
const BlasMatrix<Ring> &A,
const RingCategories::IntegerTag &tag,
const Method::BlasElimination &M)
{
// call BlasElimination code
return Signature::isPosDef(A, Signature::BLAS_LPM_Method() );
}
} // end of LinBox namespace
#endif // __LINBOX_is_positive_definite_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:
|