/external/eigen/test/ |
H A D | array_replicate.cpp | 41 VERIFY_IS_APPROX(x1, m1.replicate(f1,f2)); 46 VERIFY_IS_APPROX(x2, (m2.template replicate<2,3>())); 51 VERIFY_IS_APPROX(x2, v1.rowwise().replicate(f1)); 56 VERIFY_IS_APPROX(vx1, v1.colwise().replicate(f2));
|
H A D | product_large.cpp | 29 VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2)); 35 VERIFY_IS_APPROX((a = a * b), (c * b).eval()); 58 VERIFY_IS_APPROX(r1, (mat1.row(2)*mat2.transpose()).eval()); 61 VERIFY_IS_APPROX(r2, (mat1.row(2)*mat2).eval());
|
H A D | real_qz.cpp | 43 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixS()*qz.matrixZ(), A); 44 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixT()*qz.matrixZ(), B); 45 VERIFY_IS_APPROX(qz.matrixQ()*qz.matrixQ().adjoint(), MatrixType::Identity(dim,dim)); 46 VERIFY_IS_APPROX(qz.matrixZ()*qz.matrixZ().adjoint(), MatrixType::Identity(dim,dim));
|
H A D | eigen2support.cpp | 29 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise()); 30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1); 31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) ); 34 VERIFY_IS_APPROX(m3, m1.cwise() + s2); 37 VERIFY_IS_APPROX(m3, m1.cwise() - s1);
|
H A D | product_trmm.cpp | 40 VERIFY_IS_APPROX( ge_xs = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 41 VERIFY_IS_APPROX( ge_sx = ge_left * mat.template triangularView<Mode>(), ge_left * tri); 43 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right); 44 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri); 46 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose())); 47 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate()); 49 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr.conjugate() * (s2*ge_left.adjoint())); 50 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate()); 53 VERIFY_IS_APPROX( (ge_xs_save + s1*triTr.conjugate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()) ); 56 VERIFY_IS_APPROX( ge_sx_sav [all...] |
H A D | product_symm.cpp | 39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), 45 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), 49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), 53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), 57 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), 62 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3), 66 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(), 71 VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate()), 75 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); 76 VERIFY_IS_APPROX(rhs2 [all...] |
H A D | nullary.cpp | 57 VERIFY_IS_APPROX(m,n); 61 VERIFY_IS_APPROX(m,n); 72 VERIFY_IS_APPROX(m,n); 92 VERIFY_IS_APPROX( scalar, ScalarMatrix::Constant(high) ); 93 VERIFY_IS_APPROX( ScalarMatrix::LinSpaced(1,low,high), ScalarMatrix::Constant(high) ); 98 VERIFY_IS_APPROX(m(size-1), high);
|
H A D | jacobi.cpp | 43 VERIFY_IS_APPROX(b.row(p), c * a.row(p) + numext::conj(s) * a.row(q)); 44 VERIFY_IS_APPROX(b.row(q), -s * a.row(p) + numext::conj(c) * a.row(q)); 56 VERIFY_IS_APPROX(b.col(p), c * a.col(p) - s * a.col(q)); 57 VERIFY_IS_APPROX(b.col(q), numext::conj(s) * a.col(p) + numext::conj(c) * a.col(q));
|
H A D | geo_hyperplane.cpp | 42 VERIFY_IS_APPROX( n1.dot(n1), Scalar(1) ); 45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 ); 74 VERIFY_IS_APPROX(hp1f.template cast<Scalar>(),pl1); 76 VERIFY_IS_APPROX(hp1d.template cast<Scalar>(),pl1); 101 VERIFY_IS_APPROX(line_u.normal().norm(), Scalar(1)); 102 VERIFY_IS_APPROX(line_v.normal().norm(), Scalar(1)); 107 VERIFY_IS_APPROX(result, center); 135 VERIFY_IS_APPROX(p1->coeffs(), p2->coeffs()); 136 VERIFY_IS_APPROX(p1->coeffs(), p3->coeffs());
|
H A D | sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), 58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), 60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), 66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), 72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), 77 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Lower>().solve(vec2), 88 VERIFY_IS_APPROX(matB.toDense(), refMatB); 95 VERIFY_IS_APPROX(matB, refMatB); 99 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2),
|
H A D | jacobisvd.cpp | 38 VERIFY_IS_APPROX(m, u * sigma * v.adjoint()); 55 VERIFY_IS_APPROX(svd.singularValues(), referenceSvd.singularValues()); 57 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); 59 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); 61 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV()); 63 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV().leftCols(diagSize)); 114 VERIFY_IS_APPROX(m.adjoint()*m*x,m.adjoint()*rhs); 144 VERIFY_IS_APPROX(m2*x21, rhs2); 145 VERIFY_IS_APPROX(m2*x22, rhs2); 146 VERIFY_IS_APPROX(x2 [all...] |
H A D | lu.cpp | 74 VERIFY_IS_APPROX(lu.permutationP() * m1 * lu.permutationQ(), l*u); 79 VERIFY_IS_APPROX(m1, lu.reconstructedMatrix()); 87 VERIFY_IS_APPROX(m1 * m1.adjoint() * m1image, m1image); 94 VERIFY_IS_APPROX(m3, m1*m2); 113 VERIFY_IS_APPROX(m1, lu.reconstructedMatrix()); 123 VERIFY_IS_APPROX(m3, m1*m2); 124 VERIFY_IS_APPROX(m2, lu.inverse()*m3); 140 VERIFY_IS_APPROX(m1, plu.reconstructedMatrix());
|
H A D | upperbidiagonalization.cpp | 27 VERIFY_IS_APPROX(a,c); 29 VERIFY_IS_APPROX(a.adjoint(),d);
|
H A D | eigensolver_complex.cpp | 28 VERIFY_IS_APPROX(vec1.array().pow(RealScalar(k)).sum(), vec2.array().pow(RealScalar(k)).sum()); 50 VERIFY_IS_APPROX(symmA * ei0.eigenvectors(), ei0.eigenvectors() * ei0.eigenvalues().asDiagonal()); 54 VERIFY_IS_APPROX(a * ei1.eigenvectors(), ei1.eigenvectors() * ei1.eigenvalues().asDiagonal()); 72 VERIFY_IS_APPROX(ei1.eigenvalues(), eiNoEivecs.eigenvalues()); 80 VERIFY_IS_APPROX(id.operatorNorm(), RealScalar(1));
|
H A D | triangular.cpp | 43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2); 50 VERIFY_IS_APPROX(r1,r2); 56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); 61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); 63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), 94 VERIFY_IS_APPROX(m4 * m1.template triangularView<Eigen::Lower>(), m3); 100 VERIFY_IS_APPROX(m4 * m1.template triangularView<Eigen::Upper>(), m3); 115 VERIFY_IS_APPROX(m2,m3); 152 VERIFY_IS_APPROX(r1,r2); 158 VERIFY_IS_APPROX(m [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_nomalloc.cpp | 50 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 51 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); 52 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1); 53 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
|
H A D | eigen2_parametrizedline.cpp | 41 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) ); 43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 ); 49 VERIFY_IS_APPROX(hp1f.template cast<Scalar>(),l0); 51 VERIFY_IS_APPROX(hp1d.template cast<Scalar>(),l0);
|
H A D | eigen2_product_large.cpp | 29 VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2)); 35 VERIFY_IS_APPROX((a = a * b), (c * b).eval()); 42 VERIFY_IS_APPROX(result, (mat1.row(2)*mat2.transpose()).eval());
|
H A D | eigen2_sum.cpp | 22 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy 25 VERIFY_IS_APPROX(m1.sum(), x); 38 VERIFY_IS_APPROX(s, v.start(i).sum()); 45 VERIFY_IS_APPROX(s, v.end(size-i).sum()); 52 VERIFY_IS_APPROX(s, v.segment(i, size-2*i).sum());
|
H A D | eigen2_cholesky.cpp | 58 VERIFY_IS_APPROX(vecB, _vecB); 59 VERIFY_IS_APPROX(vecX, _vecX); 72 //VERIFY_IS_APPROX(symm, ldlt.matrixL() * ldlt.vectorD().asDiagonal() * ldlt.matrixL().adjoint()); 74 VERIFY_IS_APPROX(symm * vecX, vecB); 76 VERIFY_IS_APPROX(symm * matX, matB); 82 VERIFY_IS_APPROX(symm, chol.matrixL() * chol.matrixL().adjoint()); 84 VERIFY_IS_APPROX(symm * vecX, vecB); 86 VERIFY_IS_APPROX(symm * matX, matB);
|
H A D | eigen2_eigensolver.cpp | 66 VERIFY_IS_APPROX(_eval, eiSymm.eigenvalues()); 67 VERIFY_IS_APPROX(_evec.cwise().abs(), eiSymm.eigenvectors().cwise().abs()); 78 VERIFY_IS_APPROX(_eval, eiSymmGen.eigenvalues()); 79 VERIFY_IS_APPROX(_evec.cwiseAbs(), normalized_eivec.cwiseAbs()); 96 VERIFY_IS_APPROX(symmA, sqrtSymmA*sqrtSymmA); 97 VERIFY_IS_APPROX(sqrtSymmA, symmA*eiSymm.operatorInverseSqrt()); 121 VERIFY_IS_APPROX(symmA * ei0.pseudoEigenvectors(), ei0.pseudoEigenvectors() * ei0.pseudoEigenvalueMatrix()); 122 VERIFY_IS_APPROX((symmA.template cast<Complex>()) * (ei0.pseudoEigenvectors().template cast<Complex>()), 126 VERIFY_IS_APPROX(a * ei1.pseudoEigenvectors(), ei1.pseudoEigenvectors() * ei1.pseudoEigenvalueMatrix()); 127 VERIFY_IS_APPROX( [all...] |
H A D | eigen2_alignedbox.cpp | 42 VERIFY_IS_APPROX(b2.clamp(b0), b0); 48 VERIFY_IS_APPROX(hp1f.template cast<Scalar>(),b0); 50 VERIFY_IS_APPROX(hp1d.template cast<Scalar>(),b0);
|
H A D | eigen2_hyperplane.cpp | 42 VERIFY_IS_APPROX( n1.eigen2_dot(n1), Scalar(1) ); 45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 ); 74 VERIFY_IS_APPROX(hp1f.template cast<Scalar>(),pl1); 76 VERIFY_IS_APPROX(hp1d.template cast<Scalar>(),pl1); 100 VERIFY_IS_APPROX(line_u.normal().norm(), Scalar(1)); 101 VERIFY_IS_APPROX(line_v.normal().norm(), Scalar(1)); 106 VERIFY_IS_APPROX(result, center);
|
/external/eigen/unsupported/test/ |
H A D | svd_common.h | 46 VERIFY_IS_APPROX(m, u * sigma * v.adjoint()); 66 VERIFY_IS_APPROX(svd.singularValues(), referenceSvd.singularValues()); 68 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU()); 70 VERIFY_IS_APPROX(svd.matrixU(), referenceSvd.matrixU().leftCols(diagSize)); 72 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV()); 74 VERIFY_IS_APPROX(svd.matrixV(), referenceSvd.matrixV().leftCols(diagSize)); 99 VERIFY_IS_APPROX(m.adjoint()*m*x,m.adjoint()*rhs); 135 VERIFY_IS_APPROX(m, svd.matrixU().leftCols(diagSize) * svd.singularValues().asDiagonal() * svd.matrixV().leftCols(diagSize).adjoint()); 230 VERIFY_IS_APPROX(svd.singularValues(), v); 236 VERIFY_IS_APPROX(svd [all...] |
H A D | matrix_square_root.cpp | 18 VERIFY_IS_APPROX(sqrtA * sqrtA, A);
|