Searched refs:topLeftCorner (Results 1 - 22 of 22) sorted by relevance

/external/eigen/doc/examples/
H A Dclass_Block.cpp8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) function
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) function
23 cout << topLeftCorner(4*m, 2, 3) << endl; // calls the const version
24 topLeftCorner(m, 2, 3) *= 5; // calls the non-const version
H A DTutorial_BlockOperations_corner.cpp15 m.topLeftCorner(1,3) = m.bottomRightCorner(3,1).transpose();
H A DTemplateKeyword_flexible.cpp19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
/external/eigen/doc/snippets/
H A DTopicAliasing_block.cpp6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2);
H A DTopicAliasing_block_correct.cpp6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2).eval();
H A DMatrixBase_template_int_int_topLeftCorner.cpp3 cout << "Here is m.topLeftCorner<2,2>():" << endl;
4 cout << m.topLeftCorner<2,2>() << endl;
5 m.topLeftCorner<2,2>().setZero();
H A DMatrixBase_topLeftCorner_int_int.cpp3 cout << "Here is m.topLeftCorner(2, 2):" << endl;
4 cout << m.topLeftCorner(2, 2) << endl;
5 m.topLeftCorner(2, 2).setZero();
H A DTutorial_AdvancedInitialization_ThreeWays.cpp3 mat1.topLeftCorner(size/2, size/2) = MatrixXd::Zero(size/2, size/2);
10 mat2.topLeftCorner(size/2, size/2).setZero();
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
H A Dqrsolv.h35 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
H A Dcovar.h63 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
H A Dlmpar.h198 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
220 qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
268 // qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
H A DLevenbergMarquardt.h536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1);
/external/eigen/test/
H A Dcorners.cpp28 COMPARE_CORNER(topLeftCorner(r,c), block(0,0,r,c));
60 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template block<r,c>(0,0)));
72 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template block<r,c>(0,0)));
/external/eigen/Eigen/src/plugins/
H A DBlockMethods.h124 inline Block<Derived> topLeftCorner(Index cRows, Index cCols) function
129 /** This is the const version of topLeftCorner(Index, Index).*/
130 inline const Block<const Derived> topLeftCorner(Index cRows, Index cCols) const function
145 inline Block<Derived, CRows, CCols> topLeftCorner() function
150 /** This is the const version of topLeftCorner<int, int>().*/
152 inline const Block<const Derived, CRows, CCols> topLeftCorner() const function
/external/eigen/Eigen/src/Geometry/
H A DUmeyama.h163 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
H A DTransform.h1135 res.matrix().template topLeftCorner<Dim,Dim>() = linear().transpose();
1139 res.matrix().template topLeftCorner<Dim,Dim>() = linear().inverse();
1147 = - res.matrix().template topLeftCorner<Dim,Dim>() * translation();
/external/eigen/Eigen/src/LU/
H A DFullPivLU.h604 m.topLeftCorner(rank(), rank())
693 .topLeftCorner(smalldim,smalldim)
705 .topLeftCorner(nonzero_pivots, nonzero_pivots)
/external/eigen/Eigen/src/QR/
H A DColPivHouseholderQR.h479 .topLeftCorner(nonzero_pivots, nonzero_pivots)
487 .topLeftCorner(nonzero_pivots, nonzero_pivots)
H A DHouseholderQR.h301 .topLeftCorner(rank, rank)
H A DFullPivHouseholderQR.h503 .topLeftCorner(dec().rank(), dec().rank())
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DGMRES.h153 H.topLeftCorner(k, k).template triangularView < Eigen::Upper > ().solveInPlace(y);
/external/eigen/unsupported/test/
H A DNonLinearOptimization.cpp234 cov = covfac*lm.fjac.topLeftCorner<n,n>();
237 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);
625 cov = covfac*lm.fjac.topLeftCorner<n,n>();
628 // VERIFY_IS_APPROX( covfac*fjac.topLeftCorner<n,n>() , cov_ref);

Completed in 194 milliseconds