HomeSort by relevance Sort by last modified time
    Searched refs:topLeftCorner (Results 26 - 34 of 34) sorted by null

12

  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 168 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
545 .topLeftCorner(nonzero_pivots, nonzero_pivots)
FullPivHouseholderQR.h 530 .topLeftCorner(dec().rank(), dec().rank())
  /external/eigen/test/
nomalloc.cpp 193 RefT r4(m.topLeftCorner(rows/2, cols/2).transpose());
jacobisvd.cpp 137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
  /external/eigen/Eigen/src/Geometry/
Transform.h     [all...]
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 55 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank.
179 y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve(b.topRows(rank));
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
LevenbergMarquardt.h 542 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
  /external/eigen/unsupported/test/
NonLinearOptimization.cpp 236 cov = covfac*lm.fjac.topLeftCorner<n,n>();
239 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
627 cov = covfac*lm.fjac.topLeftCorner<n,n>();
630 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
    [all...]
levenberg_marquardt.cpp 129 cov = covfac*lm.matrixR().topLeftCorner<n,n>();
132 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
232 cov = covfac*lm.matrixR().topLeftCorner<n,n>();
235 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
    [all...]

Completed in 719 milliseconds

12