/external/eigen/Eigen/src/plugins/ |
BlockMethods.h | 178 inline BlockXpr topLeftCorner(Index cRows, Index cCols) 183 /// This is the const version of topLeftCorner(Index, Index). 185 inline const ConstBlockXpr topLeftCorner(Index cRows, Index cCols) const 203 inline typename FixedBlockXpr<CRows,CCols>::Type topLeftCorner() 208 /// This is the const version of topLeftCorner<int, int>(). 211 inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topLeftCorner() const 236 inline typename FixedBlockXpr<CRows,CCols>::Type topLeftCorner(Index cRows, Index cCols) 241 /// This is the const version of topLeftCorner<int, int>(Index, Index). 243 inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topLeftCorner(Index cRows, Index cCols) const [all...] |
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
DGMRES.h | 358 nrs = m_H.topLeftCorner(it,it).template triangularView<Upper>().solve(g.head(it)); 428 schurofH.computeFromHessenberg(m_Hes.topLeftCorner(it,it), matrixQ, computeU); 497 m_luT.compute(m_T.topLeftCorner(m_r, m_r));
|
GMRES.h | 167 H.topLeftCorner(k, k).template triangularView <Upper>().solveInPlace(y);
|
/external/eigen/test/ |
geo_homogeneous.cpp | 103 (t2.template topLeftCorner<Size,Size>() * v0 + t2.template topRightCorner<Size,1>())
|
qr_colpivoting.cpp | 45 t.topLeftCorner(rank, rank) = 46 cod.matrixT().topLeftCorner(rank, rank).template triangularView<Upper>();
|
nomalloc.cpp | 186 RefT r4(m.topLeftCorner(rows/2, cols/2).transpose());
|
svd_common.h | 199 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
|
array.cpp | 91 VERIFY_IS_APPROX((m3.topLeftCorner(rows,cols) = 1), ArrayType::Constant(rows,cols,1));
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
MatrixPower.h | 559 MatrixPowerAtomic<ComplexMatrix>(m_T.topLeftCorner(m_rank, m_rank), p).compute(blockTp); 561 m_fT.topRightCorner(m_rank, m_nulls) = m_T.topLeftCorner(m_rank, m_rank).template triangularView<Upper>()
|
/external/eigen/Eigen/src/QR/ |
CompleteOrthogonalDecomposition.h | 178 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>() 511 .topLeftCorner(rank, rank)
|
HouseholderQR.h | 363 m_qr.topLeftCorner(rank, rank)
|
ColPivHouseholderQR.h | 201 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>() 605 m_qr.topLeftCorner(nonzero_pivots, nonzero_pivots)
|
FullPivHouseholderQR.h | 567 m_qr.topLeftCorner(l_rank, l_rank)
|
/external/eigen/Eigen/src/SPQRSupport/ |
SuiteSparseQRSupport.h | 163 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
|
/external/eigen/Eigen/src/SVD/ |
BDCSVD.h | 318 m_matrixU.topLeftCorner(m_diagSize, m_diagSize) = naiveV.template cast<Scalar>().topLeftCorner(m_diagSize, m_diagSize); 325 m_matrixV.topLeftCorner(m_diagSize, m_diagSize) = naiveU.template cast<Scalar>().topLeftCorner(m_diagSize, m_diagSize); [all...] |
/external/eigen/Eigen/src/Geometry/ |
Transform.h | [all...] |
/external/eigen/Eigen/src/SparseQR/ |
SparseQR.h | 59 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank. 206 y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView<Upper>().solve(b.topRows(rank));
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
LevenbergMarquardt.h | 549 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
|
/external/eigen/unsupported/test/ |
NonLinearOptimization.cpp | 237 cov = covfac*lm.fjac.topLeftCorner<n,n>(); 240 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref); 628 cov = covfac*lm.fjac.topLeftCorner<n,n>(); 631 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref); [all...] |
levenberg_marquardt.cpp | 135 cov = covfac*lm.matrixR().topLeftCorner<n,n>(); 138 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref); 238 cov = covfac*lm.matrixR().topLeftCorner<n,n>(); 241 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref); [all...] |