HomeSort by relevance Sort by last modified time
    Searched refs:refX (Results 1 - 12 of 12) sorted by null

  /external/eigen/test/eigen2/
eigen2_sparse_solvers.cpp 79 DenseVector refX(cols), x(cols);
83 refMat2.llt().solve(b, &refX);
89 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: default");
94 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: cholmod");
101 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (IncompleteFactorization)");
104 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalMultifrontal)");
107 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalLeftLooking)");
120 DenseVector refX(cols), x(cols);
127 refMat2.ldlt().solve(b, &refX);
133 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LDLT: default")
    [all...]
eigen2_sparse_product.cpp 75 DenseMatrix refX = DenseMatrix::Random(rows, rows);
98 VERIFY_IS_APPROX(x=mS*b, refX=refS*b);
99 VERIFY_IS_APPROX(x=mUp.template marked<UpperTriangular|SelfAdjoint>()*b, refX=refS*b);
100 VERIFY_IS_APPROX(x=mLo.template marked<LowerTriangular|SelfAdjoint>()*b, refX=refS*b);
101 VERIFY_IS_APPROX(x=mS.template marked<SelfAdjoint>()*b, refX=refS*b);
  /external/eigen/bench/spbench/
spbenchsolver.h 126 Stats call_solver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX)
158 if(refX.size() != 0)
159 stat.rel_error = (refX - x).norm()/refX.norm();
180 Stats call_directsolver(Solver& solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX)
183 stat = call_solver(solver, A, b, refX);
188 Stats call_itersolver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX)
194 stat = call_solver(solver, A, b, refX);
287 int SelectSolvers(const SparseMatrix<Scalar>&A, unsigned int sym, Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, Stats *stat)
298 stat[EIGEN_UMFPACK] = call_directsolver(solver, A, b, refX);
    [all...]
  /external/skia/tests/
DrawTextTest.cpp 46 int refX = x + xOff;
49 if (refX >= 0 && refX < ref.width() &&
52 refColor = ref.getColor(refX, refY);
FontHostStreamTest.cpp 50 int refX = x + xOff;
53 if (refX >= 0 && refX < ref.width() &&
56 refColor = ref.getColor(refX, refY);
BlurTest.cpp 80 int refX = x + xOff;
83 if (refX >= 0 && refX < ref.width() &&
86 refColor = ref.getColor(refX, refY);
  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGMarkerElement.idl 37 readonly attribute SVGAnimatedLength refX;
SVGMarkerElement.h 154 DECLARE_ANIMATED_LENGTH(RefX, refX)
SVGMarkerElement.cpp 48 DEFINE_ANIMATED_LENGTH(SVGMarkerElement, SVGNames::refXAttr, RefX, refX)
59 REGISTER_LOCAL_ANIMATED_PROPERTY(refX)
  /external/eigen/test/
sparse_solver.h 19 DenseRhs refX = dA.lu().solve(db);
39 VERIFY(x.isApprox(refX,test_precision<Scalar>()));
59 VERIFY(x.isApprox(refX,test_precision<Scalar>()));
68 VERIFY(x.isApprox(refX,test_precision<Scalar>()));
73 void check_sparse_solving_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const Rhs& refX)
97 if(refX.size() != 0)
98 res_error = (refX - x).norm()/refX.norm();
215 check_sparse_solving_real_cases(solver, it.matrix(), it.rhs(), it.refX());
216 check_sparse_solving_real_cases(solver, halfA, it.rhs(), it.refX());
    [all...]
sparse_product.cpp 141 DenseMatrix refX = DenseMatrix::Random(rows, rows);
165 VERIFY_IS_APPROX(x=mS*b, refX=refS*b);
167 VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b, refX=refS*b);
168 VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b, refX=refS*b);
169 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b);
  /external/eigen/unsupported/Eigen/src/SparseExtra/
MatrixMarketIterator.h 129 * then refX is randomly generated such that A*refX = b
131 * Note that when a rhs is provided, refX is not available
133 inline VectorType& refX()

Completed in 254 milliseconds