Home
last modified time | relevance | path

Searched refs:MatrixXf (Results 1 – 25 of 121) sorted by relevance

12345

/external/eigen/test/eigen2/
Deigen2_product_large.cpp15 CALL_SUBTEST_1( product(MatrixXf(ei_random<int>(1,320), ei_random<int>(1,320))) ); in test_eigen2_product_large()
27 MatrixXf m = MatrixXf::Ones(N,3); in test_eigen2_product_large()
29 VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2)); in test_eigen2_product_large()
34 MatrixXf a = MatrixXf::Random(10,4), b = MatrixXf::Random(4,10), c = a; in test_eigen2_product_large()
39 MatrixXf mat1(10,10); mat1.setRandom(); in test_eigen2_product_large()
40 MatrixXf mat2(32,10); mat2.setRandom(); in test_eigen2_product_large()
41 MatrixXf result = mat1.row(2)*mat2.transpose(); in test_eigen2_product_large()
Deigen2_svd.cpp78 CALL_SUBTEST_3( svd(MatrixXf(7,7)) ); in test_eigen2_svd()
83 SVD<MatrixXf> s; in test_eigen2_svd()
84 MatrixXf m = MatrixXf::Random(10,1); in test_eigen2_svd()
/external/eigen/test/
Dproduct_large.cpp15 …CALL_SUBTEST_1( product(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<in… in test_product_large()
27 MatrixXf m = MatrixXf::Ones(N,3); in test_product_large()
29 VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2)); in test_product_large()
34 MatrixXf a = MatrixXf::Random(10,4), b = MatrixXf::Random(4,10), c = a; in test_product_large()
55 MatrixXf mat1(10,32); mat1.setRandom(); in test_product_large()
56 MatrixXf mat2(32,32); mat2.setRandom(); in test_product_large()
57 MatrixXf r1 = mat1.row(2)*mat2.transpose(); in test_product_large()
60 MatrixXf r2 = mat1.row(2)*mat2; in test_product_large()
/external/eigen/doc/snippets/
DRealQZ_compute.cpp1 MatrixXf A = MatrixXf::Random(4,4);
2 MatrixXf B = MatrixXf::Random(4,4);
3 RealQZ<MatrixXf> qz(4); // preallocate space for 4x4 matrices
15 << "\n|QQ* - I|: " << (qz.matrixQ()*qz.matrixQ().adjoint() - MatrixXf::Identity(4,4)).norm()
16 << ", |ZZ* - I|: " << (qz.matrixZ()*qz.matrixZ().adjoint() - MatrixXf::Identity(4,4)).norm()
DSelfAdjointEigenSolver_compute_MatrixType.cpp1 SelfAdjointEigenSolver<MatrixXf> es(4);
2 MatrixXf X = MatrixXf::Random(4,4);
3 MatrixXf A = X + X.transpose();
6 es.compute(A + MatrixXf::Identity(4,4)); // re-use es to compute eigenvalues of A+I
DGeneralizedEigenSolver.cpp1 GeneralizedEigenSolver<MatrixXf> ges;
2 MatrixXf A = MatrixXf::Random(4,4);
3 MatrixXf B = MatrixXf::Random(4,4);
DTutorial_commainit_02.cpp2 MatrixXf m(rows,cols);
4 MatrixXf::Zero(3,cols-3),
5 MatrixXf::Zero(rows-3,3),
6 MatrixXf::Identity(rows-3,cols-3);
DEigenSolver_compute.cpp1 EigenSolver<MatrixXf> es;
2 MatrixXf A = MatrixXf::Random(4,4);
5 es.compute(A + MatrixXf::Identity(4,4), false); // re-use es to compute eigenvalues of A+I
DHouseholderQR_householderQ.cpp1 MatrixXf A(MatrixXf::Random(5,3)), thinQ(MatrixXf::Identity(5,3)), Q;
3 HouseholderQR<MatrixXf> qr(A);
DTridiagonalization_compute.cpp1 Tridiagonalization<MatrixXf> tri;
2 MatrixXf X = MatrixXf::Random(4,4);
3 MatrixXf A = X + X.transpose();
DHessenbergDecomposition_matrixH.cpp1 Matrix4f A = MatrixXf::Random(4,4);
3 HessenbergDecomposition<MatrixXf> hessOfA(A);
4 MatrixXf H = hessOfA.matrixH();
6 MatrixXf Q = hessOfA.matrixQ();
DTutorial_AdvancedInitialization_CommaTemporary.cpp1 MatrixXf mat = MatrixXf::Random(2, 3);
3 mat = (MatrixXf(2,2) << 0, 1, 1, 0).finished() * mat;
DFullPivLU_kernel.cpp1 MatrixXf m = MatrixXf::Random(3,5);
3 MatrixXf ker = m.fullPivLu().kernel();
DRealSchur_compute.cpp1 MatrixXf A = MatrixXf::Random(4,4);
2 RealSchur<MatrixXf> schur(4);
DJacobiSVD_basic.cpp1 MatrixXf m = MatrixXf::Random(3,2);
3 JacobiSVD<MatrixXf> svd(m, ComputeThinU | ComputeThinV);
DTopicAliasing_cwise.cpp1 MatrixXf mat(2,2);
9 mat = mat - MatrixXf::Identity(2,2);
19 mat = (2 * mat - MatrixXf::Identity(2,2)).array().square();
/external/eigen/doc/examples/
DTemplateKeyword_simple.cpp6 void copyUpperTriangularPart(MatrixXf& dst, const MatrixXf& src) in copyUpperTriangularPart()
13 MatrixXf m1 = MatrixXf::Ones(4,4); in main()
14 MatrixXf m2 = MatrixXf::Random(4,4); in main()
DTutorial_ArrayClass_interop.cpp9 MatrixXf m(2,2); in main()
10 MatrixXf n(2,2); in main()
11 MatrixXf result(2,2); in main()
DTutorial_ReductionsVisitorsBroadcasting_visitors.cpp9 Eigen::MatrixXf m(2,2); in main()
15 MatrixXf::Index maxRow, maxCol; in main()
19 MatrixXf::Index minRow, minCol; in main()
DTutorial_ArrayClass_interop_matrix.cpp9 MatrixXf m(2,2); in main()
10 MatrixXf n(2,2); in main()
11 MatrixXf result(2,2); in main()
/external/eigen/bench/
DbenchVecAdd.cpp18 __attribute__ ((noinline)) void benchVec(MatrixXf& a, MatrixXf& b, MatrixXf& c);
50 MatrixXf ma = Map<MatrixXf>(a, innersize, outersize ); in main()
51 MatrixXf mb = Map<MatrixXf>(b, innersize, outersize ); in main()
52 MatrixXf mc = Map<MatrixXf>(c, innersize, outersize ); in main()
79 void benchVec(MatrixXf& a, MatrixXf& b, MatrixXf& c) in benchVec()
/external/eigen/unsupported/doc/examples/
DMatrixSinh.cpp8 MatrixXf A = MatrixXf::Random(3,3); in main()
11 MatrixXf sinhA = A.sinh(); in main()
14 MatrixXf coshA = A.cosh(); in main()
/external/eigen/unsupported/test/
Djacobisvd.cpp135 svd_preallocate< JacobiSVD <MatrixXf> >(); in jacobisvd_preallocate()
145 CALL_SUBTEST_7(( jacobisvd_verify_assert(MatrixXf(10,12)) )); in test_jacobisvd()
172 CALL_SUBTEST_7(( jacobisvd<MatrixXf>(MatrixXf(r,c)) )); in test_jacobisvd()
178 CALL_SUBTEST_7( jacobisvd_inf_nan<MatrixXf>() ); in test_jacobisvd()
181 …CALL_SUBTEST_7(( jacobisvd<MatrixXf>(MatrixXf(internal::random<int>(EIGEN_TEST_MAX_SIZE/4, EIGEN_T… in test_jacobisvd()
191 CALL_SUBTEST_7( JacobiSVD<MatrixXf>(10,10) ); in test_jacobisvd()
Dbdcsvd.cpp79 svd_preallocate< BDCSVD< MatrixXf > >(); in bdcsvd_preallocate()
167 CALL_SUBTEST_7(( bdcsvd_verify_assert(MatrixXf(10,12)) )); in test_bdcsvd()
198 CALL_SUBTEST_7(( bdcsvd<MatrixXf>(MatrixXf(r,c)) )); in test_bdcsvd()
204 CALL_SUBTEST_7( bdcsvd_inf_nan<MatrixXf>() ); in test_bdcsvd()
207 …CALL_SUBTEST_7(( bdcsvd<MatrixXf>(MatrixXf(internal::random<int>(EIGEN_TEST_MAX_SIZE/4, EIGEN_TEST… in test_bdcsvd()
211 CALL_SUBTEST_7( BDCSVD<MatrixXf>(10,10) ); in test_bdcsvd()
/external/eigen/doc/
DFunctionsTakingEigenTypes.dox82 … The typical example is to write functions accepting both a MatrixXf or a block of a MatrixXf. Thi…
92 …pted by Ref<MatrixXf>. However, in the last call, we have a generic expression that will be automa…
96 void cov(const Ref<const MatrixXf> x, const Ref<const MatrixXf> y, Ref<MatrixXf> C)
106 MatrixXf m1, m2, m3
116 MatrixXf cov(const MatrixXf& x, const MatrixXf& y)
126 MatrixXf x,y,z;
127 MatrixXf C = cov(x,y+z);
139 void cov(const MatrixXf& x, const MatrixXf& y, MatrixXf& C)
149 MatrixXf C = MatrixXf::Zero(3,6);
152 …ot possible to convert the expression returned by \c MatrixXf::block() into a non-const \c MatrixX…
[all …]

12345