diff options
author | Benoit Jacob <jacob.benoit.1@gmail.com> | 2009-10-28 18:19:29 -0400 |
---|---|---|
committer | Benoit Jacob <jacob.benoit.1@gmail.com> | 2009-10-28 18:19:29 -0400 |
commit | 2840ac7e948ecb3c7b19ba8f581f829a4a4e1fea (patch) | |
tree | 14adcd3aa33c4207b14455707bc247cea29029e6 /doc/snippets | |
parent | 1f1c04cac1d8a87cbb34741d141df646b2da2827 (diff) |
big huge changes, so i dont remember everything.
* renaming, e.g. LU ---> FullPivLU
* split tests framework: more robust, e.g. dont generate empty tests if a number is skipped
* make all remaining tests use that splitting, as needed.
* Fix 4x4 inversion (see stable branch)
* Transform::inverse() and geo_transform test : adapt to new inverse() API, it was also trying to instantiate inverse() for 3x4 matrices.
* CMakeLists: more robust regexp to parse the version number
* misc fixes in unit tests
Diffstat (limited to 'doc/snippets')
-rw-r--r-- | doc/snippets/FullPivLU_image.cpp (renamed from doc/snippets/LU_image.cpp) | 0 | ||||
-rw-r--r-- | doc/snippets/FullPivLU_kernel.cpp (renamed from doc/snippets/LU_kernel.cpp) | 0 | ||||
-rw-r--r-- | doc/snippets/FullPivLU_solve.cpp (renamed from doc/snippets/LU_solve.cpp) | 0 | ||||
-rw-r--r-- | doc/snippets/PartialLU_solve.cpp | 2 | ||||
-rw-r--r-- | doc/snippets/Tutorial_solve_multiple_rhs.cpp | 2 | ||||
-rw-r--r-- | doc/snippets/Tutorial_solve_reuse_decomposition.cpp | 2 | ||||
-rw-r--r-- | doc/snippets/Tutorial_solve_singular.cpp | 2 | ||||
-rw-r--r-- | doc/snippets/class_FullPivLU.cpp (renamed from doc/snippets/class_LU.cpp) | 2 |
8 files changed, 5 insertions, 5 deletions
diff --git a/doc/snippets/LU_image.cpp b/doc/snippets/FullPivLU_image.cpp index d3092e8b6..d3092e8b6 100644 --- a/doc/snippets/LU_image.cpp +++ b/doc/snippets/FullPivLU_image.cpp diff --git a/doc/snippets/LU_kernel.cpp b/doc/snippets/FullPivLU_kernel.cpp index e01186d38..e01186d38 100644 --- a/doc/snippets/LU_kernel.cpp +++ b/doc/snippets/FullPivLU_kernel.cpp diff --git a/doc/snippets/LU_solve.cpp b/doc/snippets/FullPivLU_solve.cpp index ade269789..ade269789 100644 --- a/doc/snippets/LU_solve.cpp +++ b/doc/snippets/FullPivLU_solve.cpp diff --git a/doc/snippets/PartialLU_solve.cpp b/doc/snippets/PartialLU_solve.cpp index 69e788dc4..fa3570ab8 100644 --- a/doc/snippets/PartialLU_solve.cpp +++ b/doc/snippets/PartialLU_solve.cpp @@ -2,6 +2,6 @@ MatrixXd A = MatrixXd::Random(3,3); MatrixXd B = MatrixXd::Random(3,2); cout << "Here is the invertible matrix A:" << endl << A << endl; cout << "Here is the matrix B:" << endl << B << endl; -MatrixXd X = A.partialLu().solve(B); +MatrixXd X = A.lu().solve(B); cout << "Here is the (unique) solution X to the equation AX=B:" << endl << X << endl; cout << "Relative error: " << (A*X-B).norm() / B.norm() << endl; diff --git a/doc/snippets/Tutorial_solve_multiple_rhs.cpp b/doc/snippets/Tutorial_solve_multiple_rhs.cpp index 1ffcc61f0..72dab9075 100644 --- a/doc/snippets/Tutorial_solve_multiple_rhs.cpp +++ b/doc/snippets/Tutorial_solve_multiple_rhs.cpp @@ -3,7 +3,7 @@ A << 1,2,3, 4,5,6, 7,8,10; Matrix<float,3,2> B; B << 3,1, 3,1, 4,1; Matrix<float,3,2> X; -X = A.partialLu().solve(B); +X = A.lu().solve(B); cout << "The solution with right-hand side (3,3,4) is:" << endl; cout << X.col(0) << endl; cout << "The solution with right-hand side (1,1,1) is:" << endl; diff --git a/doc/snippets/Tutorial_solve_reuse_decomposition.cpp b/doc/snippets/Tutorial_solve_reuse_decomposition.cpp index 1b8b0ae9e..3ca06453a 100644 --- a/doc/snippets/Tutorial_solve_reuse_decomposition.cpp +++ b/doc/snippets/Tutorial_solve_reuse_decomposition.cpp @@ -1,6 +1,6 @@ Matrix3f A(3,3); A << 1,2,3, 4,5,6, 7,8,10; -PartialLU<Matrix3f> luOfA(A); // compute LU decomposition of A +PartialPivLU<Matrix3f> luOfA(A); // compute LU decomposition of A Vector3f b; b << 3,3,4; Vector3f x; diff --git a/doc/snippets/Tutorial_solve_singular.cpp b/doc/snippets/Tutorial_solve_singular.cpp index f5f2d2f6a..abff1ef73 100644 --- a/doc/snippets/Tutorial_solve_singular.cpp +++ b/doc/snippets/Tutorial_solve_singular.cpp @@ -5,5 +5,5 @@ b << 3, 3, 4; cout << "Here is the matrix A:" << endl << A << endl; cout << "Here is the vector b:" << endl << b << endl; Vector3f x; -x = A.partialLu().solve(b); +x = A.lu().solve(b); cout << "The solution is:" << endl << x << endl; diff --git a/doc/snippets/class_LU.cpp b/doc/snippets/class_FullPivLU.cpp index 9958368f1..40d76e8e6 100644 --- a/doc/snippets/class_LU.cpp +++ b/doc/snippets/class_FullPivLU.cpp @@ -2,7 +2,7 @@ typedef Matrix<double, 5, 3> Matrix5x3; typedef Matrix<double, 5, 5> Matrix5x5; Matrix5x3 m = Matrix5x3::Random(); cout << "Here is the matrix m:" << endl << m << endl; -Eigen::LU<Matrix5x3> lu(m); +Eigen::FullPivLU<Matrix5x3> lu(m); cout << "Here is, up to permutations, its LU decomposition matrix:" << endl << lu.matrixLU() << endl; cout << "Here is the L part:" << endl; |