| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
23 cout << topLeftCorner(4*m, 2, 3) << endl; // calls the const version
24 topLeftCorner(m, 2, 3) *= 5; // calls the non-const version
|
| Tutorial_BlockOperations_corner.cpp | 15 m.topLeftCorner(1,3) = m.bottomRightCorner(3,1).transpose();
|
| TemplateKeyword_flexible.cpp | 19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
| function_taking_ref.cpp | 17 cout << "inv_cond(m(1:3,1:3)): " << inv_cond(m.topLeftCorner(3,3)) << endl;
|
| /external/eigen/doc/snippets/ |
| TopicAliasing_block.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2);
|
| TopicAliasing_block_correct.cpp | 6 mat.bottomRightCorner(2,2) = mat.topLeftCorner(2,2).eval();
|
| MatrixBase_template_int_int_topLeftCorner.cpp | 3 cout << "Here is m.topLeftCorner<2,2>():" << endl;
4 cout << m.topLeftCorner<2,2>() << endl;
5 m.topLeftCorner<2,2>().setZero();
|
| MatrixBase_template_int_int_topLeftCorner_int_int.cpp | 3 cout << "Here is m.topLeftCorner<2,Dynamic>(2,2):" << endl;
4 cout << m.topLeftCorner<2,Dynamic>(2,2) << endl;
5 m.topLeftCorner<2,Dynamic>(2,2).setZero();
|
| MatrixBase_topLeftCorner_int_int.cpp | 3 cout << "Here is m.topLeftCorner(2, 2):" << endl;
4 cout << m.topLeftCorner(2, 2) << endl;
5 m.topLeftCorner(2, 2).setZero();
|
| Tutorial_AdvancedInitialization_ThreeWays.cpp | 3 mat1.topLeftCorner(size/2, size/2) = MatrixXd::Zero(size/2, size/2);
10 mat2.topLeftCorner(size/2, size/2).setZero();
|
| /external/eigen/test/ |
| corners.cpp | 28 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)));
65 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<r,Dynamic>(r,c)));
70 VERIFY_IS_EQUAL((matrix.template topLeftCorner<r,c>()), (matrix.template topLeftCorner<Dynamic,c>(r,c)));
82 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template block<r,c>(0,0)));
87 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template topLeftCorner<r,Dynamic>(r,c)));
92 VERIFY_IS_EQUAL((const_matrix.template topLeftCorner<r,c>()), (const_matrix.template topLeftCorner<Dynamic,c>(r,c)))
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 35 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));
|
| covar.h | 64 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
|
| lmpar.h | 202 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
224 qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
272 // qr.matrixQR().topLeftCorner(n, n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 77 r.topLeftCorner(n,n).template triangularView<StrictlyUpper>() = r.topLeftCorner(n,n).transpose();
|
| LMqrsolv.h | 49 s.topLeftCorner(n,n).template triangularView<StrictlyLower>() = s.topLeftCorner(n,n).transpose();
92 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
179 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
|
| LMpar.h | 65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
87 s.topLeftCorner(n,n).transpose().template triangularView<Lower>().solveInPlace(wa1);
|
| /external/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 163 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
169 Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean;
|
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 156 inline Block<Derived> topLeftCorner(Index cRows, Index cCols)
161 /** This is the const version of topLeftCorner(Index, Index).*/
162 inline const Block<const Derived> topLeftCorner(Index cRows, Index cCols) const
177 inline Block<Derived, CRows, CCols> topLeftCorner()
182 /** This is the const version of topLeftCorner<int, int>().*/
184 inline const Block<const Derived, CRows, CCols> topLeftCorner() const
207 inline Block<Derived, CRows, CCols> topLeftCorner(Index cRows, Index cCols)
212 /** This is the const version of topLeftCorner<int, int>(Index, Index).*/
214 inline const Block<const Derived, CRows, CCols> topLeftCorner(Index cRows, Index cCols) const
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 618 m.topLeftCorner(rank(), rank())
708 .topLeftCorner(smalldim,smalldim)
720 .topLeftCorner(nonzero_pivots, nonzero_pivots)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| DGMRES.h | 371 nrs = m_H.topLeftCorner(it,it).template triangularView<Upper>().solve(g.head(it));
441 schurofH.computeFromHessenberg(m_Hes.topLeftCorner(it,it), matrixQ, computeU);
510 m_luT.compute(m_T.topLeftCorner(m_r, m_r));
|
| GMRES.h | 156 H.topLeftCorner(k, k).template triangularView < Eigen::Upper > ().solveInPlace(y);
|
| /external/eigen/unsupported/test/ |
| kronecker_product.cpp | 111 Matrix<double, 6, 6> DM_fix_ab = kroneckerProduct(DM_a.topLeftCorner<2,3>(),DM_b);
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 338 .topLeftCorner(rank, rank)
|
| /external/eigen/Eigen/src/SPQRSupport/ |
| SuiteSparseQRSupport.h | 167 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y2.topRows(rk));
|
