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

  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LMpar.h 67 x = qr.colsPermutation()*wa1;
86 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm;
94 wa1[j] = s.col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j)];
118 lmqrsolv(s, qr.colsPermutation(), wa1, qtb, x, sdiag);
132 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2/dxnorm);
LMonestep.h 50 m_permutation = (qrfac.colsPermutation());
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
lmpar.h 204 x = qr.colsPermutation()*wa1;
223 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm;
231 wa1[j] = qr.matrixQR().col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j)];
256 qrsolv<Scalar>(s, qr.colsPermutation().indices(), wa1, qtb, x, sdiag);
270 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2/dxnorm);
LevenbergMarquardt.h 227 permutation = qrfac.colsPermutation();
292 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
468 permutation = qrfac.colsPermutation();
  /external/eigen/test/
qr_colpivoting.cpp 36 MatrixType c = q * r * qr.colsPermutation().inverse();
61 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();
qr_fullpivoting.cpp 40 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse();
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 180 const PermutationType& colsPermutation() const
549 for(Index i = 0; i < nonzero_pivots; ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
550 for(Index i = nonzero_pivots; i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
FullPivHouseholderQR.h 170 const PermutationType& colsPermutation() const
534 for(Index i = 0; i < dec().rank(); ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
535 for(Index i = dec().rank(); i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 94 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
141 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
184 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
240 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
    [all...]
  /external/eigen/unsupported/Eigen/src/SVD/
JacobiSVD.h 94 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
141 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
184 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation();
240 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation();
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 48 * rank-revealing permutations. Use colsPermutation() to get it.
152 const PermutationType& colsPermutation() const
183 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
  /external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h 43 * P is the column permutation. Use colsPermutation() to get it.
170 // colsPermutation() performs a copy of the permutation,
176 // dest = colsPermutation() * y.topRows(cols());
198 PermutationType colsPermutation() const
  /external/eigen/Eigen/src/SparseLU/
SparseLU.h 151 * \sa colsPermutation()
161 inline const PermutationType& colsPermutation() const
243 X.col(j) = colsPermutation().inverse() * X.col(j);
  /external/ceres-solver/internal/ceres/
covariance_impl.cc 699 qr_solver.colsPermutation().inverse();

Completed in 257 milliseconds