| /external/eigen/bench/spbench/ |
| D | spbenchsolver.h | 214 …A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX,std::ofstream& stat… in call_solver() argument
256 if(refX.size() != 0) in call_solver()
257 rel_error = (refX - x).norm()/refX.norm(); in call_solver()
279 …A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statF… in call_directsolver() argument
283 call_solver(solver, solver_id, A, b, refX,statbuf); in call_directsolver()
289 …A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statF… in call_itersolver() argument
296 call_solver(solver, solver_id, A, b, refX,statbuf); in call_itersolver()
305 …int sym, Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statF… in SelectSolvers() argument
316 call_directsolver(solver, EIGEN_UMFPACK, A, b, refX,statFile); in SelectSolvers()
324 call_directsolver(solver, EIGEN_SUPERLU, A, b, refX,statFile); in SelectSolvers()
[all …]
|
| /external/eigen/test/eigen2/ |
| D | eigen2_sparse_solvers.cpp | 79 DenseVector refX(cols), x(cols); in sparse_solvers() local
83 refMat2.llt().solve(b, &refX); in sparse_solvers()
89 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: default"); in sparse_solvers()
94 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: cholmod"); in sparse_solvers()
101 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (IncompleteFactorization)"); in sparse_solvers()
104 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalMultifrontal)"); in sparse_solvers()
107 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalLeftLooking)"); in sparse_solvers()
120 DenseVector refX(cols), x(cols); in sparse_solvers() local
127 refMat2.ldlt().solve(b, &refX); in sparse_solvers()
133 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LDLT: default"); in sparse_solvers()
[all …]
|
| D | eigen2_sparse_product.cpp | 75 DenseMatrix refX = DenseMatrix::Random(rows, rows); in sparse_product() local
98 VERIFY_IS_APPROX(x=mS*b, refX=refS*b); in sparse_product()
99 VERIFY_IS_APPROX(x=mUp.template marked<UpperTriangular|SelfAdjoint>()*b, refX=refS*b); in sparse_product()
100 VERIFY_IS_APPROX(x=mLo.template marked<LowerTriangular|SelfAdjoint>()*b, refX=refS*b); in sparse_product()
101 VERIFY_IS_APPROX(x=mS.template marked<SelfAdjoint>()*b, refX=refS*b); in sparse_product()
|
| /external/eigen/test/ |
| D | sparse_solver.h | 19 DenseRhs refX = dA.lu().solve(db); in check_sparse_solving() local
39 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
58 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
68 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in check_sparse_solving()
73 …ing_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const Rhs& refX) in check_sparse_solving_real_cases() argument
97 if(refX.size() != 0) in check_sparse_solving_real_cases()
98 res_error = (refX - x).norm()/refX.norm(); in check_sparse_solving_real_cases()
236 check_sparse_solving_real_cases(solver, it.matrix(), it.rhs(), it.refX()); in check_sparse_spd_solving()
237 check_sparse_solving_real_cases(solver, halfA, it.rhs(), it.refX()); in check_sparse_spd_solving()
322 check_sparse_solving_real_cases(solver, it.matrix(), it.rhs(), it.refX()); in check_sparse_square_solving()
|
| D | spqr_support.cpp | 34 DenseVector refX,x,b; in test_spqr_scalar() local
55 refX = dA.colPivHouseholderQr().solve(b); in test_spqr_scalar()
56 VERIFY(x.isApprox(refX,test_precision<Scalar>())); in test_spqr_scalar()
|
| D | sparseqr.cpp | 50 DenseVector refX,x,b; in test_sparseqr_scalar() local
76 refX = dqr.solve(b); in test_sparseqr_scalar()
80 VERIFY_IS_APPROX(x, refX); in test_sparseqr_scalar()
|
| D | sparse_product.cpp | 179 DenseMatrix refX = DenseMatrix::Random(rows, rows); in sparse_product() local
203 VERIFY_IS_APPROX(x=mS*b, refX=refS*b); in sparse_product()
205 VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b, refX=refS*b); in sparse_product()
206 VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b, refX=refS*b); in sparse_product()
207 VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b, refX=refS*b); in sparse_product()
212 refX = refLo.template selfadjointView<Lower>()*refS); in sparse_product()
215 refX = refS * refLo.template selfadjointView<Lower>()); in sparse_product()
|
| /external/skia/tests/ |
| D | DrawTextTest.cpp | 44 int refX = x + xOff; in compare() local
47 if (refX >= 0 && refX < ref.width() && in compare()
50 refColor = ref.getColor(refX, refY); in compare()
|
| D | FontHostStreamTest.cpp | 48 int refX = x + xOff; in compare() local
51 if (refX >= 0 && refX < ref.width() && in compare()
54 refColor = ref.getColor(refX, refY); in compare()
|
| D | BlurTest.cpp | 83 int refX = x + xOff; in compare() local
86 if (refX >= 0 && refX < ref.width() && in compare()
89 refColor = ref.getColor(refX, refY); in compare()
|
| /external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/data/tree_construction/ |
| D | tests11.dat | 2 …'' pointsAtZ='' preserveAlpha='' preserveAspectRatio='' primitiveUnits='' refX='' refY='' repeatCo…
49 | refX=""
121 | refX=""
193 | refX=""
218 …'' pointsAtZ='' preserveAlpha='' preserveAspectRatio='' primitiveUnits='' refX='' refY='' repeatCo…
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| D | MatrixMarketIterator.h | 133 inline VectorType& refX() in refX() function
|