Searched refs:colsPermutation (Results 1 – 13 of 13) sorted by relevance
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| D | LMpar.h | 67 x = qr.colsPermutation()*wa1; in lmpar2()
86 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm; in lmpar2()
94 wa1[j] = s.col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j)]; in lmpar2()
118 lmqrsolv(s, qr.colsPermutation(), wa1, qtb, x, sdiag); in lmpar2()
132 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2/dxnorm); in lmpar2()
|
| D | LMonestep.h | 50 m_permutation = (qrfac.colsPermutation()); in minimizeOneStep()
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | lmpar.h | 204 x = qr.colsPermutation()*wa1; in lmpar2()
223 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2)/dxnorm; in lmpar2()
231 …wa1[j] = qr.matrixQR().col(j).head(j+1).dot(qtb.head(j+1)) / diag[qr.colsPermutation().indices()(j… in lmpar2()
256 qrsolv<Scalar>(s, qr.colsPermutation().indices(), wa1, qtb, x, sdiag); in lmpar2()
270 wa1 = qr.colsPermutation().inverse() * diag.cwiseProduct(wa2/dxnorm); in lmpar2()
|
| D | LevenbergMarquardt.h | 234 permutation = qrfac.colsPermutation(); in minimizeOneStep()
299 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1); in minimizeOneStep()
475 permutation = qrfac.colsPermutation(); in minimizeOptimumStorageOneStep()
|
| /external/eigen/Eigen/src/QR/ |
| D | CompleteOrthogonalDecomposition.h | 192 const PermutationType& colsPermutation() const {
193 return m_cpqr.colsPermutation();
524 dst = colsPermutation() * dst;
|
| D | ColPivHouseholderQR.h | 214 const PermutationType& colsPermutation() const
|
| D | FullPivHouseholderQR.h | 198 const PermutationType& colsPermutation() const
|
| /external/eigen/test/ |
| D | qr_colpivoting.cpp | 48 MatrixType c = q * t * z * cod.colsPermutation().inverse(); in cod()
118 MatrixType c = q * r * qr.colsPermutation().inverse(); in qr()
176 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse(); in qr_fixedsize()
|
| D | qr_fullpivoting.cpp | 44 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse(); in qr()
|
| /external/eigen/Eigen/src/SVD/ |
| D | JacobiSVD.h | 93 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); in run()
141 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); in run()
182 if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); in run()
239 if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); in run()
|
| /external/eigen/Eigen/src/SparseLU/ |
| D | SparseLU.h | 173 inline const PermutationType& colsPermutation() const in colsPermutation() function
238 X.col(j) = colsPermutation().inverse() * X.col(j); in _solve_impl()
|
| /external/eigen/Eigen/src/SparseQR/ |
| D | SparseQR.h | 179 const PermutationType& colsPermutation() const
210 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| D | SuiteSparseQRSupport.h | 194 PermutationType colsPermutation() const
|