| /external/trappy/tests/ |
| D | test_stats_grammar.py | 38 self.assertEquals(parser.solve(eqn), 9)
41 self.assertEquals(parser.solve(eqn), 13)
55 parser.solve(eqn)[thermal_zone_id],
67 parser.solve(eqn)[thermal_zone_id],
74 parser.solve(eqn)[thermal_zone_id],
87 parser.solve(eqn)[thermal_zone_id],
99 mask = parser.solve(eqn)
109 self.assertTrue(parser.solve(eqn)[thermal_zone_id])
111 self.assertTrue(parser.solve(eqn)[thermal_zone_id])
119 sol1 = parser.solve("trappy.thermal.Thermal:temp")
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| D | BisectionSolver.java | 58 public double solve(double min, double max, double initial) in solve() method in BisectionSolver
60 return solve(f, min, max); in solve()
65 public double solve(double min, double max) in solve() method in BisectionSolver
67 return solve(f, min, max); in solve()
75 public double solve(final UnivariateRealFunction f, double min, double max, double initial) in solve() method in BisectionSolver
77 return solve(f, min, max); in solve()
82 …public double solve(int maxEval, final UnivariateRealFunction f, double min, double max, double in… in solve() method in BisectionSolver
84 return solve(maxEval, f, min, max); in solve()
89 public double solve(int maxEval, final UnivariateRealFunction f, double min, double max) in solve() method in BisectionSolver
92 return solve(f, min, max); in solve()
[all …]
|
| D | NewtonSolver.java | 62 public double solve(final double min, final double max) in solve() method in NewtonSolver
64 return solve(f, min, max); in solve()
69 public double solve(final double min, final double max, final double startValue) in solve() method in NewtonSolver
71 return solve(f, min, max, startValue); in solve()
87 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in NewtonSolver
91 return solve(f, min, max); in solve()
107 public double solve(final UnivariateRealFunction f, in solve() method in NewtonSolver
110 return solve(f, min, max, UnivariateRealSolverUtils.midpoint(min, max)); in solve()
128 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in NewtonSolver
132 return solve(f, min, max, startValue); in solve()
[all …]
|
| D | SecantSolver.java | 70 public double solve(final double min, final double max) in solve() method in SecantSolver
72 return solve(f, min, max); in solve()
77 public double solve(final double min, final double max, final double initial) in solve() method in SecantSolver
79 return solve(f, min, max, initial); in solve()
97 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in SecantSolver
101 return solve(f, min, max, initial); in solve()
119 public double solve(final UnivariateRealFunction f, in solve() method in SecantSolver
122 return solve(f, min, max); in solve()
138 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in SecantSolver
142 return solve(f, min, max); in solve()
[all …]
|
| D | RiddersSolver.java | 65 public double solve(final double min, final double max) in solve() method in RiddersSolver
67 return solve(f, min, max); in solve()
72 public double solve(final double min, final double max, final double initial) in solve() method in RiddersSolver
74 return solve(f, min, max, initial); in solve()
93 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in RiddersSolver
97 return solve(f, min, max, initial); in solve()
116 public double solve(final UnivariateRealFunction f, in solve() method in RiddersSolver
128 return solve(f, min, initial); in solve()
130 return solve(f, initial, max); in solve()
149 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in RiddersSolver
[all …]
|
| D | BrentSolver.java | 97 public double solve(double min, double max) in solve() method in BrentSolver
99 return solve(f, min, max); in solve()
104 public double solve(double min, double max, double initial) in solve() method in BrentSolver
106 return solve(f, min, max, initial); in solve()
129 public double solve(final UnivariateRealFunction f, in solve() method in BrentSolver
156 return solve(f, min, yMin, initial, yInitial, min, yMin); in solve()
168 return solve(f, initial, yInitial, max, yMax, initial, yInitial); in solve()
196 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in BrentSolver
200 return solve(f, min, max, initial); in solve()
221 public double solve(final UnivariateRealFunction f, in solve() method in BrentSolver
[all …]
|
| D | LaguerreSolver.java | 92 public double solve(final double min, final double max) in solve() method in LaguerreSolver
94 return solve(p, min, max); in solve()
99 public double solve(final double min, final double max, final double initial) in solve() method in LaguerreSolver
101 return solve(p, min, max, initial); in solve()
121 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in LaguerreSolver
125 return solve(f, min, max, initial); in solve()
145 public double solve(final UnivariateRealFunction f, in solve() method in LaguerreSolver
163 return solve(f, min, initial); in solve()
165 return solve(f, initial, max); in solve()
190 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in LaguerreSolver
[all …]
|
| D | MullerSolver.java | 66 public double solve(final double min, final double max) in solve() method in MullerSolver
68 return solve(f, min, max); in solve()
73 public double solve(final double min, final double max, final double initial) in solve() method in MullerSolver
75 return solve(f, min, max, initial); in solve()
95 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in MullerSolver
99 return solve(f, min, max, initial); in solve()
119 public double solve(final UnivariateRealFunction f, in solve() method in MullerSolver
131 return solve(f, min, initial); in solve()
133 return solve(f, initial, max); in solve()
163 public double solve(int maxEval, final UnivariateRealFunction f, in solve() method in MullerSolver
[all …]
|
| D | UnivariateRealSolver.java | 79 double solve(double min, double max) throws ConvergenceException, FunctionEvaluationException; in solve() method
100 double solve(UnivariateRealFunction f, double min, double max) in solve() method
122 double solve(double min, double max, double startValue) in solve() method
145 double solve(UnivariateRealFunction f, double min, double max, double startValue) in solve() method
|
| D | UnivariateRealSolverUtils.java | 54 public static double solve(UnivariateRealFunction f, double x0, double x1) in solve() method in UnivariateRealSolverUtils
57 return LazyHolder.FACTORY.newDefaultSolver().solve(f, x0, x1); in solve()
75 public static double solve(UnivariateRealFunction f, double x0, double x1, in solve() method in UnivariateRealSolverUtils
82 return solver.solve(f, x0, x1); in solve()
|
| /external/eigen/test/ |
| D | sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), in sparse_solvers()
54 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers()
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), in sparse_solvers()
59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers()
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), in sparse_solvers()
73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
[all …]
|
| D | cholesky.cpp | 89 vecX = chollo.solve(vecB); in cholesky()
91 matX = chollo.solve(matB); in cholesky()
94 const MatrixType symmLo_inverse = chollo.solve(MatrixType::Identity(rows,cols)); in cholesky()
105 vecX = cholup.solve(vecB); in cholesky()
107 matX = cholup.solve(matB); in cholesky()
112 const MatrixType symmUp_inverse = cholup.solve(MatrixType::Identity(rows,cols)); in cholesky()
131 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
132 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
134 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
135 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
[all …]
|
| D | nesting_ops.cpp | 61 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); in run_nesting_ops_2()
62 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 … in run_nesting_ops_2()
64 …VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
65 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
66 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.co… in run_nesting_ops_2()
88 VERIFY( verify_eval_type<1>(m1.template triangularView<Lower>().solve(m1), m1) ); in run_nesting_ops_2()
89 VERIFY( verify_eval_type<1>(m1+m1.template triangularView<Lower>().solve(m1), m1) ); in run_nesting_ops_2()
|
| D | lu.cpp | 98 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); in lu_non_invertible()
108 m3 = lu.transpose().solve(m2); in lu_non_invertible()
118 m3 = lu.adjoint().solve(m2); in lu_non_invertible()
149 m2 = lu.solve(m3); in lu_invertible()
164 m3 = lu.transpose().solve(m2); in lu_invertible()
171 m3 = lu.adjoint().solve(m2); in lu_invertible()
176 VERIFY_IS_APPROX(lu.solve(m3*m4), lu.solve(m3)*m4); in lu_invertible()
195 m2 = plu.solve(m3); in lu_partial_piv()
209 m3 = plu.transpose().solve(m2); in lu_partial_piv()
216 m3 = plu.adjoint().solve(m2); in lu_partial_piv()
[all …]
|
| D | nomalloc.cpp | 122 X = LLT.solve(B); in ctms_decompositions()
123 x = LLT.solve(b); in ctms_decompositions()
125 X = LDLT.solve(B); in ctms_decompositions()
126 x = LDLT.solve(b); in ctms_decompositions()
138 X = ppLU.solve(B); in ctms_decompositions()
139 x = ppLU.solve(b); in ctms_decompositions()
141 X = fpLU.solve(B); in ctms_decompositions()
142 x = fpLU.solve(b); in ctms_decompositions()
146 X = hQR.solve(B); in ctms_decompositions()
147 x = hQR.solve(b); in ctms_decompositions()
[all …]
|
| D | inplace_decomposition.cpp | 48 VERIFY_IS_APPROX( A0 * (x = dec.solve(b)), b ); in inplace()
52 VERIFY_IS_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
59 VERIFY_IS_NOT_APPROX( A0 * (x = dec.solve(b)), b ); in inplace()
63 VERIFY_IS_NOT_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
73 VERIFY_IS_APPROX( A0 * (x = dec.solve(b)), b ); in inplace()
77 VERIFY_IS_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
|
| D | triangular.cpp | 73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps)); in triangular_square()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | SolveWithGuess.h | 81 evaluator(const SolveType& solve)
82 : m_result(solve.rows(), solve.cols())
85 m_result = solve.guess();
86 solve.dec()._solve_with_guess_impl(solve.rhs(), m_result);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | DecompositionSolver.java | 46 double[] solve(final double[] b) in solve() method
57 RealVector solve(final RealVector b) in solve() method
68 RealMatrix solve(final RealMatrix b) in solve() method
|
| D | FieldDecompositionSolver.java | 48 T[] solve(final T[] b) in solve() method
59 FieldVector<T> solve(final FieldVector<T> b) in solve() method
70 FieldMatrix<T> solve(final FieldMatrix<T> b) in solve() method
|
| D | CholeskyDecompositionImpl.java | 211 public double[] solve(double[] b) in solve() method in CholeskyDecompositionImpl.Solver
247 public RealVector solve(RealVector b) in solve() method in CholeskyDecompositionImpl.Solver
250 return solve((ArrayRealVector) b); in solve()
293 public ArrayRealVector solve(ArrayRealVector b) in solve() method in CholeskyDecompositionImpl.Solver
295 return new ArrayRealVector(solve(b.getDataRef()), false); in solve()
299 public RealMatrix solve(RealMatrix b) in solve() method in CholeskyDecompositionImpl.Solver
351 return solve(MatrixUtils.createRealIdentityMatrix(lTData.length)); in getInverse()
|
| D | QRDecompositionImpl.java | 288 public double[] solve(double[] b) in solve() method in QRDecompositionImpl.Solver
337 public RealVector solve(RealVector b) in solve() method in QRDecompositionImpl.Solver
340 return solve((ArrayRealVector) b); in solve()
342 return new ArrayRealVector(solve(b.getData()), false); in solve()
353 public ArrayRealVector solve(ArrayRealVector b) in solve() method in QRDecompositionImpl.Solver
355 return new ArrayRealVector(solve(b.getDataRef()), false); in solve()
359 public RealMatrix solve(RealMatrix b) in solve() method in QRDecompositionImpl.Solver
448 return solve(MatrixUtils.createRealIdentityMatrix(rDiag.length)); in getInverse()
|
| /external/eigen/doc/examples/ |
| D | TutorialInplaceLU.cpp | 32 VectorXd x = lu.solve(b); in main()
38 x = lu.solve(b); in main()
45 x = lu.solve(b); in main()
57 x = lu.solve(b); in main()
|
| D | matrixfree_cg.cpp | 97 x = cg.solve(b); in main()
104 x = bicg.solve(b); in main()
111 x = gmres.solve(b); in main()
118 x = gmres.solve(b); in main()
125 x = minres.solve(b); in main()
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | SparseSolverBase.h | 39 tmpX.leftCols(actualCols) = dec.solve(tmp.leftCols(actualCols)); in solve_sparse_through_dense_panels()
53 dest_dense = dec.solve(rhs_dense); in solve_sparse_through_dense_panels()
88 solve(const MatrixBase<Rhs>& b) const in solve() function
101 solve(const SparseMatrixBase<Rhs>& b) const in solve() function
|