From 6358c129987383d817b339642ef450c056f134a5 Mon Sep 17 00:00:00 2001
From: Hauke Heibel <hauke.heibel@gmail.com>
Date: Sun, 17 May 2009 16:07:12 +0200
Subject: * introduced method createRandomMatrixOfRank (R = U*D*V where U,V
 unitary, D r-by-c diag. with rank non-zero values) * switched lu/qr tests to
 be using createRandomMatrixOfRank * removed unused methods
 doSomeRankPreservingOperations * removed NOTE about
 doSomeRankPreservingOperations

---
 test/lu.cpp | 30 +-----------------------------
 1 file changed, 1 insertion(+), 29 deletions(-)

(limited to 'test/lu.cpp')

diff --git a/test/lu.cpp b/test/lu.cpp
index 6147419fd..625241330 100644
--- a/test/lu.cpp
+++ b/test/lu.cpp
@@ -25,44 +25,16 @@
 #include "main.h"
 #include <Eigen/LU>
 
-template<typename Derived>
-void doSomeRankPreservingOperations(Eigen::MatrixBase<Derived>& m)
-{
-  typedef typename Derived::RealScalar RealScalar;
-  for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
-  {
-    RealScalar d = Eigen::ei_random<RealScalar>(-1,1);
-    int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
-    int j;
-    do {
-      j = Eigen::ei_random<int>(0,m.rows()-1);
-    } while (i==j); // j is another one (must be different)
-    m.row(i) += d * m.row(j);
-
-    i = Eigen::ei_random<int>(0,m.cols()-1); // i is a random column number
-    do {
-      j = Eigen::ei_random<int>(0,m.cols()-1);
-    } while (i==j); // j is another one (must be different)
-    m.col(i) += d * m.col(j);
-  }
-}
-
 template<typename MatrixType> void lu_non_invertible()
 {
   /* this test covers the following files:
      LU.h
   */
-  // NOTE there seems to be a problem with too small sizes -- could easily lie in the doSomeRankPreservingOperations function
   int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200);
   int rank = ei_random<int>(1, std::min(rows, cols)-1);
 
   MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
-  m1 = MatrixType::Random(rows,cols);
-  if(rows <= cols)
-    for(int i = rank; i < rows; i++) m1.row(i).setZero();
-  else
-    for(int i = rank; i < cols; i++) m1.col(i).setZero();
-  doSomeRankPreservingOperations(m1);
+  createRandomMatrixOfRank(rank, rows, cols, m1);
 
   LU<MatrixType> lu(m1);
   typename LU<MatrixType>::KernelResultType m1kernel = lu.kernel();
-- 
cgit v1.2.3