OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:colsPermutation
(Results
1 - 13
of
13
) 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
234
permutation = qrfac.
colsPermutation
();
299
wa3 = fjac.template triangularView<Upper>() * (qrfac.
colsPermutation
().inverse() *wa1);
475
permutation = qrfac.
colsPermutation
();
/external/eigen/Eigen/src/QR/
CompleteOrthogonalDecomposition.h
192
const PermutationType&
colsPermutation
() const {
193
return m_cpqr.
colsPermutation
();
524
dst =
colsPermutation
() * dst;
ColPivHouseholderQR.h
214
const PermutationType&
colsPermutation
() const
FullPivHouseholderQR.h
198
const PermutationType&
colsPermutation
() const
/external/eigen/test/
qr_colpivoting.cpp
48
MatrixType c = q * t * z * cod.
colsPermutation
().inverse();
118
MatrixType c = q * r * qr.
colsPermutation
().inverse();
176
Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.
colsPermutation
().inverse();
qr_fullpivoting.cpp
44
MatrixType c = qr.matrixQ() * r * qr.
colsPermutation
().inverse();
/external/eigen/Eigen/src/SVD/
JacobiSVD.h
93
if(svd.computeV()) svd.m_matrixV = m_qr.
colsPermutation
();
141
if(svd.computeU()) svd.m_matrixU = m_qr.
colsPermutation
();
182
if(svd.computeV()) svd.m_matrixV = m_qr.
colsPermutation
();
239
if(svd.computeU()) svd.m_matrixU = m_qr.
colsPermutation
();
[
all
...]
/external/eigen/Eigen/src/SparseLU/
SparseLU.h
163
* \sa
colsPermutation
()
173
inline const PermutationType&
colsPermutation
() const
238
X.col(j) =
colsPermutation
().inverse() * X.col(j);
/external/eigen/Eigen/src/SparseQR/
SparseQR.h
52
* rank-revealing permutations. Use
colsPermutation
() to get it.
179
const PermutationType&
colsPermutation
() const
210
if (m_perm_c.size()) dest =
colsPermutation
() * y.topRows(cols());
/external/eigen/Eigen/src/SPQRSupport/
SuiteSparseQRSupport.h
44
* P is the column permutation. Use
colsPermutation
() to get it.
166
//
colsPermutation
() performs a copy of the permutation,
172
// dest =
colsPermutation
() * y.topRows(cols());
194
PermutationType
colsPermutation
() const
Completed in 187 milliseconds