HomeSort by relevance Sort by last modified time
    Searched refs:matrixR (Results 1 - 7 of 7) sorted by null

  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMpar.h 47 s = qr.matrixR();
51 const Index n = qr.matrixR().cols();
LMonestep.h 49 m_rfactor = qrfac.matrixR();
LevenbergMarquardt.h 228 JacobianType& matrixR() {return m_rfactor; }
  /external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h 163 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
179 const MatrixType matrixR() const
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 59 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank.
138 * SparseMatrix<double> R = qr.matrixR(); // column-major, not sorted!
139 * SparseMatrix<double,RowMajor> Rr = qr.matrixR(); // row-major, sorted
143 const QRMatrixType& matrixR() const { return m_R; }
206 y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve(b.topRows(rank));
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 198 * \code matrixR().template triangularView<Upper>() \endcode
201 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
204 const MatrixType& matrixR() const
  /external/eigen/unsupported/test/
levenberg_marquardt.cpp 124 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm
135 cov = covfac*lm.matrixR().topLeftCorner<n,n>();
227 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm
238 cov = covfac*lm.matrixR().topLeftCorner<n,n>();
    [all...]

Completed in 463 milliseconds