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

another test in the non invertible case

Browse Source
This commit is contained in:
Manuel Yguel 2009-07-04 14:55:25 +02:00
parent d457ec5810
commit c398d0edcf
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
test/inverse.cpp
View File

@ -65,10 +65,21 @@ template<typename MatrixType> void inverse(const MatrixType& m)
// since for the general case we implement separately row-major and col-major, test that // since for the general case we implement separately row-major and col-major, test that
VERIFY_IS_APPROX(m1.transpose().inverse(), m1.inverse().transpose()); VERIFY_IS_APPROX(m1.transpose().inverse(), m1.inverse().transpose());
//computeInverseWithCheck tests
//First: an invertible matrix
bool invertible = m1.computeInverseWithCheck(&m2); bool invertible = m1.computeInverseWithCheck(&m2);
VERIFY(invertible); VERIFY(invertible);
VERIFY_IS_APPROX(identity, m1*m2); VERIFY_IS_APPROX(identity, m1*m2);
//Second: a rank one matrix (not invertible, except for 1x1 matrices)
VectorType v3 = VectorType::Random(rows);
MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
invertible = m3.computeInverseWithCheck( &m4 );
if( 1 == rows ){
VERIFY( invertible ); }
else{
VERIFY( !invertible ); }
} }
void test_inverse() void test_inverse()
@ -81,7 +92,7 @@ void test_inverse()
CALL_SUBTEST( inverse(MatrixXf(8,8)) ); CALL_SUBTEST( inverse(MatrixXf(8,8)) );
CALL_SUBTEST( inverse(MatrixXcd(7,7)) ); CALL_SUBTEST( inverse(MatrixXcd(7,7)) );
} }
// test some tricky cases for 4x4 matrices // test some tricky cases for 4x4 matrices
VERIFY_IS_APPROX((Matrix4f() << 0,0,1,0, 1,0,0,0, 0,1,0,0, 0,0,0,1).finished().inverse(), VERIFY_IS_APPROX((Matrix4f() << 0,0,1,0, 1,0,0,0, 0,1,0,0, 0,0,0,1).finished().inverse(),
(Matrix4f() << 0,1,0,0, 0,0,1,0, 1,0,0,0, 0,0,0,1).finished()); (Matrix4f() << 0,1,0,0, 0,0,1,0, 1,0,0,0, 0,0,0,1).finished());