/usr/include/hmat/admissibility.hpp is in libhmat-oss-dev 1.2.0-2ubuntu1.
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 | /*
HMat-OSS (HMatrix library, open source software)
Copyright (C) 2014-2015 Airbus Group SAS
This program 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
of the License, or (at your option) any later version.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
http://github.com/jeromerobert/hmat-oss
*/
/*! \file
\ingroup HMatrix
\brief Spatial cluster tree for the Dofs.
*/
#ifndef _ADMISSIBLITY_HPP
#define _ADMISSIBLITY_HPP
#include <cstddef>
#include <string>
namespace hmat {
// Forward declarations
class ClusterTree;
class AdmissibilityCondition
{
public:
virtual ~AdmissibilityCondition() {}
/*! \brief Returns true if 2 nodes are admissible together.
This is used for the tree construction on which we develop the HMatrix.
Two leaves are admissible if they satisfy the criterion allowing the
compression of the resulting matrix block.
\return true if 2 nodes are admissible.
*/
virtual bool isAdmissible(const ClusterTree& rows, const ClusterTree& cols) = 0;
/*! \brief Clean up data which may be allocated by isAdmissible */
virtual void clean(const ClusterTree&) const {}
virtual std::string str() const = 0;
};
/**
* @brief Hackbusch formula based admissibility
* is Hackbusch formula :
* min (diameter (), other-> diameter ()) <= eta * distanceTo (other);
* @param eta a parameter used in the evaluation of the admissibility.
* @param maxElementsPerBlock limit memory size of a bloc with AcaFull and Svd compression
*/
class StandardAdmissibilityCondition : public AdmissibilityCondition
{
public:
StandardAdmissibilityCondition(double eta, size_t maxElementsPerBlock = 5000000,
size_t maxElementsPerBlockAca = 0);
bool isAdmissible(const ClusterTree& rows, const ClusterTree& cols);
void clean(const ClusterTree& current) const;
std::string str() const;
void setEta(double eta);
/**
* Force to ignore the eta parameter and concider all small
* enough blocks as admissible
*/
void setAlways(bool);
static StandardAdmissibilityCondition DEFAULT_ADMISSIBLITY;
private:
double eta_;
size_t maxElementsPerBlock;
size_t maxElementsPerBlockAca_;
bool always_;
};
} // end namespace hmat
#endif
|