GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-07-29 00:02:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

improve precision test

Browse Source
This commit is contained in:
Benoit Jacob 2009-11-23 11:24:06 -05:00
parent 44d0d667cd
commit e6ea9e401c
1 changed files with 25 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
test/prec_inverse_4x4.cpp
View File

@ -26,6 +26,28 @@
#include <Eigen/LU> #include <Eigen/LU>
#include <algorithm> #include <algorithm>
Matrix4f inverse(const Matrix4f& m)
{
Matrix4f r;
r(0,0) = m.minor(0,0).determinant();
r(1,0) = -m.minor(0,1).determinant();
r(2,0) = m.minor(0,2).determinant();
r(3,0) = -m.minor(0,3).determinant();
r(0,2) = m.minor(2,0).determinant();
r(1,2) = -m.minor(2,1).determinant();
r(2,2) = m.minor(2,2).determinant();
r(3,2) = -m.minor(2,3).determinant();
r(0,1) = -m.minor(1,0).determinant();
r(1,1) = m.minor(1,1).determinant();
r(2,1) = -m.minor(1,2).determinant();
r(3,1) = m.minor(1,3).determinant();
r(0,3) = -m.minor(3,0).determinant();
r(1,3) = m.minor(3,1).determinant();
r(2,3) = -m.minor(3,2).determinant();
r(3,3) = m.minor(3,3).determinant();
return r / (m(0,0)*r(0,0) + m(1,0)*r(0,1) + m(2,0)*r(0,2) + m(3,0)*r(0,3));
}
template<typename MatrixType> void inverse_permutation_4x4() template<typename MatrixType> void inverse_permutation_4x4()
{ {
typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::Scalar Scalar;
@ -42,7 +64,7 @@ template<typename MatrixType> void inverse_permutation_4x4()
} }
std::cerr << "inverse_permutation_4x4, Scalar = " << type_name<Scalar>() << std::endl; std::cerr << "inverse_permutation_4x4, Scalar = " << type_name<Scalar>() << std::endl;
EIGEN_DEBUG_VAR(error_max); EIGEN_DEBUG_VAR(error_max);
VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 150.0 : 60.) ); VERIFY(error_max < 1. );
} }
template<typename MatrixType> void inverse_general_4x4(int repeat) template<typename MatrixType> void inverse_general_4x4(int repeat)
@ -57,7 +79,7 @@ template<typename MatrixType> void inverse_general_4x4(int repeat)
do { do {
m = MatrixType::Random(); m = MatrixType::Random();
absdet = ei_abs(m.determinant()); absdet = ei_abs(m.determinant());
} while(absdet == RealScalar(0)); } while(absdet < 2*epsilon<Scalar>() );
MatrixType inv = m.inverse(); MatrixType inv = m.inverse();
double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() ); double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() );
error_sum += error; error_sum += error;
@ -68,7 +90,7 @@ template<typename MatrixType> void inverse_general_4x4(int repeat)
EIGEN_DEBUG_VAR(error_avg); EIGEN_DEBUG_VAR(error_avg);
EIGEN_DEBUG_VAR(error_max); EIGEN_DEBUG_VAR(error_max);
VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.4 : 1.4) ); VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.4 : 1.4) );
VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 150.0 : 60.) ); VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 150.0 : 75.) );
} }
void test_prec_inverse_4x4() void test_prec_inverse_4x4()