Searched refs:colsPermutation (Results 1 - 14 of 14) sorted by relevance
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| H A D | 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);
|
| H A D | LMonestep.h | 50 m_permutation = (qrfac.colsPermutation());
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| H A D | 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);
|
| H A D | LevenbergMarquardt.h | 227 permutation = qrfac.colsPermutation();
292 wa3 = fjac.template triangularView<Upper>() * (qrfac.colsPermutation().inverse() *wa1);
468 permutation = qrfac.colsPermutation();
|
| /external/eigen/test/ |
| H A D | qr_colpivoting.cpp | 36 MatrixType c = q * r * qr.colsPermutation().inverse();
61 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();
|
| H A D | qr_fullpivoting.cpp | 40 MatrixType c = qr.matrixQ() * r * qr.colsPermutation().inverse();
|
| /external/eigen/Eigen/src/QR/ |
| H A D | ColPivHouseholderQR.h | 180 const PermutationType& colsPermutation() const function in class:Eigen::ColPivHouseholderQR
551 for(Index i = 0; i < nonzero_pivots; ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
552 for(Index i = nonzero_pivots; i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
|
| H A D | FullPivHouseholderQR.h | 170 const PermutationType& colsPermutation() const function in class:Eigen::FullPivHouseholderQR
526 for(Index i = 0; i < dec().rank(); ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.row(i);
527 for(Index i = dec().rank(); i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).setZero();
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| H A D | SuiteSparseQRSupport.h | 43 * P is the column permutation. Use colsPermutation() to get it.
157 dest.topRows(cols()) = colsPermutation() * y.topRows(cols());
179 PermutationType colsPermutation() const function in class:Eigen::SPQR
|
| /external/eigen/Eigen/src/SVD/ |
| H A D | 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/unsupported/Eigen/src/SVD/ |
| H A D | 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/ |
| H A D | SparseQR.h | 48 * rank-revealing permutations. Use colsPermutation() to get it.
152 const PermutationType& colsPermutation() const function in class:Eigen::SparseQR
183 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
|
| /external/eigen/Eigen/src/SparseLU/ |
| H A D | SparseLU.h | 151 * \sa colsPermutation()
161 inline const PermutationType& colsPermutation() const function in class:Eigen::SparseLU
243 X.col(j) = colsPermutation().inverse() * X.col(j);
|
| /external/ceres-solver/internal/ceres/ |
| H A D | covariance_impl.cc | 699 qr_solver.colsPermutation().inverse();
|
Completed in 1776 milliseconds