Lines Matching defs:lu
11 #include <Eigen/LU>
20 LU.h
61 FullPivLU<MatrixType> lu;
66 lu.setThreshold(RealScalar(0.01));
67 lu.compute(m1);
70 u = lu.matrixLU().template triangularView<Upper>();
73 = lu.matrixLU().block(0,0,rows,(std::min)(rows,cols));
75 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u);
77 KernelMatrixType m1kernel = lu.kernel();
78 ImageMatrixType m1image = lu.image(m1);
80 VERIFY_IS_APPROX(m1, lu.reconstructedMatrix());
81 VERIFY(rank == lu.rank());
82 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
83 VERIFY(!lu.isInjective());
84 VERIFY(!lu.isInvertible());
85 VERIFY(!lu.isSurjective());
94 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3);
101 LU.h
108 FullPivLU<MatrixType> lu;
109 lu.setThreshold(RealScalar(0.01));
112 lu.compute(m1);
113 } while(!lu.isInvertible());
115 VERIFY_IS_APPROX(m1, lu.reconstructedMatrix());
116 VERIFY(0 == lu.dimensionOfKernel());
117 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vector
118 VERIFY(size == lu.rank());
119 VERIFY(lu.isInjective());
120 VERIFY(lu.isSurjective());
121 VERIFY(lu.isInvertible());
122 VERIFY(lu.image(m1).fullPivLu().isInvertible());
124 m2 = lu.solve(m3);
126 VERIFY_IS_APPROX(m2, lu.inverse()*m3);
151 FullPivLU<MatrixType> lu;
152 VERIFY_RAISES_ASSERT(lu.matrixLU())
153 VERIFY_RAISES_ASSERT(lu.permutationP())
154 VERIFY_RAISES_ASSERT(lu.permutationQ())
155 VERIFY_RAISES_ASSERT(lu.kernel())
156 VERIFY_RAISES_ASSERT(lu.image(tmp))
157 VERIFY_RAISES_ASSERT(lu.solve(tmp))
158 VERIFY_RAISES_ASSERT(lu.determinant())
159 VERIFY_RAISES_ASSERT(lu.rank())
160 VERIFY_RAISES_ASSERT(lu.dimensionOfKernel())
161 VERIFY_RAISES_ASSERT(lu.isInjective())
162 VERIFY_RAISES_ASSERT(lu.isSurjective())
163 VERIFY_RAISES_ASSERT(lu.isInvertible())
164 VERIFY_RAISES_ASSERT(lu.inverse())
