Searched refs:transpose (Results 1 - 25 of 407) sorted by relevance

1234567891011>>

/external/eigen/doc/snippets/
H A DDenseBase_LinSpaced.cpp1 cout << VectorXi::LinSpaced(4,7,10).transpose() << endl;
2 cout << VectorXd::LinSpaced(5,0.0,1.0).transpose() << endl;
H A DDenseBase_LinSpaced_seq.cpp1 cout << VectorXi::LinSpaced(Sequential,4,7,10).transpose() << endl;
2 cout << VectorXd::LinSpaced(Sequential,5,0.0,1.0).transpose() << endl;
H A DMatrixBase_diagonal_int.cpp4 << m.diagonal(1).transpose() << endl
5 << m.diagonal(-2).transpose() << endl;
H A DMatrixBase_diagonal_template_int.cpp4 << m.diagonal<1>().transpose() << endl
5 << m.diagonal<-2>().transpose() << endl;
H A DGeneralizedEigenSolver.cpp5 cout << "The (complex) numerators of the generalzied eigenvalues are: " << ges.alphas().transpose() << endl;
6 cout << "The (real) denominatore of the generalzied eigenvalues are: " << ges.betas().transpose() << endl;
7 cout << "The (complex) generalzied eigenvalues are (alphas./beta): " << ges.eigenvalues().transpose() << endl;
H A DMatrixBase_transpose.cpp3 cout << "Here is the transpose of m:" << endl << m.transpose() << endl;
4 cout << "Here is the coefficient (1,0) in the transpose of m:" << endl
5 << m.transpose()(1,0) << endl;
7 m.transpose()(1,0) = 0;
H A DSelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp3 Matrix4f A = X + X.transpose();
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
H A DSelfAdjointEigenSolver_compute_MatrixType.cpp3 MatrixXf A = X + X.transpose();
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
H A Dtut_arithmetic_transpose_aliasing.cpp4 a = a.transpose(); // !!! do NOT do this !!!
H A DEigenSolver_compute.cpp4 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
6 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
H A Dtut_arithmetic_transpose_conjugate.cpp4 cout << "Here is the matrix a^T\n" << a.transpose() << endl;
H A DSelfAdjointEigenSolver_compute_MatrixType2.cpp2 MatrixXd A = X * X.transpose();
4 MatrixXd B = X * X.transpose();
/external/guava/guava-tests/test/com/google/common/collect/
H A DTransposedTableTest.java22 * Test cases for {@link Tables#transpose}.
32 Table<String, Integer, Character> table = Tables.transpose(original);
40 assertSame(original, Tables.transpose(Tables.transpose(original)));
45 Table<String, Integer, Character> transpose = Tables.transpose(original);
47 assertEquals((Character) 'a', transpose.get("foo", 1));
52 Table<String, Integer, Character> transpose = Tables.transpose(original);
53 transpose
[all...]
/external/eigen/test/eigen2/
H A Deigen2_bug_132.cpp17 VectorXd y = A.transpose() * (b-c); // bug 132: infinite recursion in coeffRef
18 VectorXd z = (b-c).transpose() * A; // bug 132: infinite recursion in coeffRef
24 VectorXd z = (b-c).transpose() * A.transpose();
H A Deigen2_sparse_product.cpp36 VERIFY_IS_APPROX(m4=m2.transpose()*m3, refMat4=refMat2.transpose()*refMat3);
37 VERIFY_IS_APPROX(m4=m2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.transpose());
38 VERIFY_IS_APPROX(m4=m2*m3.transpose(), refMat4=refMat2*refMat3.transpose());
42 VERIFY_IS_APPROX(dm4=m2*refMat3.transpose(), refMat4=refMat2*refMat3.transpose());
[all...]
H A Dproduct.h66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
68 m3 *= m1.transpose() * m2;
69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2));
85 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity);
96 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1));
101 res += (m1 * m2.transpose())
[all...]
/external/eigen/test/
H A Dnesting_ops.cpp21 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().sum(), (m.transpose() * m).diagonal().sum() );
22 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal().array().abs().sum() );
24 VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum() );
H A Dproduct.h61 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
63 m3 *= m1.transpose() * m2;
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
77 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity);
88 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1));
93 res.noalias() += m1 * m2.transpose();
[all...]
H A Dproduct_small.cpp21 matAstatic.cwiseProduct(matBstatic.transpose()).sum() );
28 matAdynamic.cwiseProduct(matBdynamic.transpose()).sum() );
47 VERIFY_IS_APPROX( (v * v.transpose()) * v, (v * v.transpose()).eval() * v);
H A Dsparse_product.cpp19 VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).transpose());
20 VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).transpose());
29 VERIFY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpose()*refMat2.col(c1).transpose());
35 // VERIFY_IS_APPROX(m4=m2.innerVector(c)*dv1.transpose(), refMat4=refMat2.colVector(c)*dv1.transpose());
[all...]
/external/ceres-solver/internal/ceres/
H A Dblas.cc52 bool transpose,
60 char trans = transpose ? 'T' : 'N';
61 int n = transpose ? num_cols : num_rows;
62 int k = transpose ? num_rows : num_cols;
49 SymmetricRankKUpdate(int num_rows, int num_cols, const double* a, bool transpose, double alpha, double beta, double* c) argument
H A Dblas.h41 // transpose = true : c = alpha * a'a + beta * c;
42 // transpose = false : c = alpha * aa' + beta * c;
48 bool transpose,
/external/eigen/failtest/
H A Dconst_qualified_transpose_method_retval.cpp12 Transpose<Matrix3d> b(m.transpose());
/external/eigen/doc/examples/
H A Dtut_arithmetic_matrix_mul.cpp13 std::cout << "Here is u^T*mat:\n" << u.transpose()*mat << std::endl;
14 std::cout << "Here is u^T*v:\n" << u.transpose()*v << std::endl;
15 std::cout << "Here is u*v^T:\n" << u*v.transpose() << std::endl;
/external/eigen/unsupported/doc/examples/
H A DPolynomialSolver1.cpp13 cout << "Roots: " << roots.transpose() << endl;
18 cout << "Complex roots: " << psolve.roots().transpose() << endl;
23 cout << "Real roots: " << mapRR.transpose() << endl;
31 cout << "Hard case polynomial defined by floats: " << hardCase_polynomial.transpose() << endl;
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl;
36 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl;
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl;
47 cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl << endl;

Completed in 181 milliseconds

1234567891011>>