EventPrimitivesCovarianceHelpers.h File Reference

#include "EventPrimitives/EventPrimitives.h"
#include <Eigen/Cholesky>
#include <limits>

Include dependency graph for EventPrimitivesCovarianceHelpers.h:

Go to the source code of this file.

Namespaces
namespace	Amg
	Definition of ATLAS Math & Geometry primitives (Amg)

Functions
bool	Amg::saneCovarianceElement (double ele)
	A covariance matrix formally needs to be positive semi definite.
template<int N>
bool	Amg::hasPositiveOrZeroDiagElems (const AmgSymMatrix(N) &mat)
	Returns true if all diagonal elements of the covariance matrix are finite aka sane in the above definition.
bool	Amg::hasPositiveOrZeroDiagElems (const Amg::MatrixX &mat)
template<int N>
bool	Amg::hasPositiveDiagElems (const AmgSymMatrix(N) &mat)
	Returns true if all diagonal elements of the covariance matrix are finite aka sane in the above definition.
bool	Amg::hasPositiveDiagElems (const Amg::MatrixX &mat)
template<int N>
bool	Amg::isPositiveSemiDefinite (const AmgSymMatrix(N) &mat)
	Check if is positive semidefinit using that fact that is needed for Cholesky decomposition.
bool	Amg::isPositiveSemiDefinite (const Amg::MatrixX &mat)
template<int N>
bool	Amg::isPositiveDefinite (const AmgSymMatrix(N) &mat)
	Check if is positive semidefinit using that fact that is needed for Cholesky decomposition.
bool	Amg::isPositiveDefinite (const Amg::MatrixX &mat)
template<int N>
bool	Amg::isPositiveSemiDefiniteSlow (const AmgSymMatrix(N) &mat)
	These are the slow test following the definition.
bool	Amg::isPositiveSemiDefiniteSlow (const Amg::MatrixX &mat)
template<int N>
bool	Amg::isPositiveDefiniteSlow (const AmgSymMatrix(N) &mat)
bool	Amg::isPositiveDefiniteSlow (const Amg::MatrixX &mat)
template<typename T, typename U>
double	Amg::chi2 (const T &precision, const U &residual, const int sign=1)