HomeSort by relevance Sort by last modified time
    Searched full:matrixlu (Results 1 - 6 of 6) sorted by null

  /external/eigen/doc/snippets/
class_FullPivLU.cpp 7 << endl << lu.matrixLU() << endl;
10 l.block<5,3>(0,0).triangularView<StrictlyLower>() = lu.matrixLU();
13 Matrix5x3 u = lu.matrixLU().triangularView<Upper>();
  /external/eigen/test/
lu.cpp 69 u = lu.matrixLU().template triangularView<Upper>();
72 = lu.matrixLU().block(0,0,rows,(std::min)(rows,cols));
148 VERIFY_RAISES_ASSERT(lu.matrixLU())
163 VERIFY_RAISES_ASSERT(plu.matrixLU())
  /external/eigen/Eigen/src/LU/
FullPivLU.h 37 * The data of the LU decomposition can be directly accessed through the methods matrixLU(),
104 inline const MatrixType& matrixLU() const
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
586 if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold)
596 m(dec().matrixLU().block(0, 0, rank(), cols));
600 m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i);
655 if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold)
699 dec().matrixLU()
706 -= dec().matrixLU().bottomRows(rows-cols)
711 dec().matrixLU()
    [all...]
PartialPivLU.h 43 * The data of the LU decomposition can be directly accessed through the methods matrixLU(), permutationP().
100 inline const MatrixType& matrixLU() const
452 eigen_assert(rhs().rows() == dec().matrixLU().rows());
458 dec().matrixLU().template triangularView<UnitLower>().solveInPlace(dst);
461 dec().matrixLU().template triangularView<Upper>().solveInPlace(dst);
  /external/eigen/bench/btl/libs/eigen3/
eigen3_interface.hh 215 C = X.fullPivLu().matrixLU();
223 // C = X.partialPivLu().matrixLU();
  /external/eigen/bench/btl/libs/eigen2/
eigen2_interface.hh 152 C = X.lu().matrixLU();

Completed in 106 milliseconds