Lines Matching refs:Cols
20 Index cols = internal::random<Index>(2, EIGEN_TEST_MAX_SIZE);
22 Index rank = internal::random<Index>(1, (std::min)(rows, cols) - 1);
29 createRandomPIMatrixOfRank(rank, rows, cols, matrix);
32 VERIFY(cols - cod.rank() == cod.dimensionOfKernel());
44 t.setZero(rows, cols);
51 MatrixType exact_solution = MatrixType::Random(cols, cols2);
69 Cols = MatrixType::ColsAtCompileTime
72 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols)) - 1);
73 Matrix<Scalar, Rows, Cols> matrix;
74 createRandomPIMatrixOfRank(rank, Rows, Cols, matrix);
75 CompleteOrthogonalDecomposition<Matrix<Scalar, Rows, Cols> > cod(matrix);
77 VERIFY(Cols - cod.rank() == cod.dimensionOfKernel());
79 VERIFY(cod.isSurjective() == (rank == Cols));
82 Matrix<Scalar, Cols, Cols2> exact_solution;
83 exact_solution.setRandom(Cols, Cols2);
85 Matrix<Scalar, Cols, Cols2> cod_solution = cod.solve(rhs);
90 Matrix<Scalar, Cols, Cols2> svd_solution = svd.solve(rhs);
99 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
100 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
106 createRandomPIMatrixOfRank(rank,rows,cols,m1);
109 VERIFY_IS_EQUAL(cols - qr.rank(), qr.dimensionOfKernel());
125 for (Index i = 0; i < (std::min)(rows, cols) - 1; ++i) {
130 for (Index j = 0; j < (std::min)(rows, cols); ++j) {
139 MatrixType m2 = MatrixType::Random(cols,cols2);
141 m2 = MatrixType::Random(cols,cols2);
162 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
165 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
166 Matrix<Scalar,Rows,Cols> m1;
167 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
168 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
170 VERIFY_IS_EQUAL(Cols - qr.rank(), qr.dimensionOfKernel());
172 VERIFY_IS_EQUAL(qr.isSurjective(), (rank == Cols));
175 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
176 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();
179 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
181 m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
188 for (Index i = 0; i < (std::min)(int(Rows), int(Cols)) - 1; ++i) {
193 for (Index j = 0; j < (std::min)(int(Rows), int(Cols)); ++j) {
218 Index rows = 300, cols = rows;
221 m1.setZero(rows,cols);
236 for (Index i = 0; i < (std::min)(rows, cols) - 1; ++i) {
241 for (Index j = 0; j < (std::min)(rows, cols); ++j) {
