/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 | 96 vecX = chollo.solve(vecB); in cholesky() 98 matX = chollo.solve(matB); in cholesky() 104 vecX = cholup.solve(vecB); in cholesky() 106 matX = cholup.solve(matB); in cholesky() 121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() 122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky() 124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() 125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky() 127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky() 128 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky() [all …]
|
D | nomalloc.cpp | 131 X = LLT.solve(B); in ctms_decompositions() 132 x = LLT.solve(b); in ctms_decompositions() 134 X = LDLT.solve(B); in ctms_decompositions() 135 x = LDLT.solve(b); in ctms_decompositions() 147 X = ppLU.solve(B); in ctms_decompositions() 148 x = ppLU.solve(b); in ctms_decompositions() 150 X = fpLU.solve(B); in ctms_decompositions() 151 x = fpLU.solve(b); in ctms_decompositions() 155 X = hQR.solve(B); in ctms_decompositions() 156 x = hQR.solve(b); in ctms_decompositions() [all …]
|
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()
|
D | lu.cpp | 93 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); in lu_non_invertible() 124 m2 = lu.solve(m3); in lu_invertible() 130 VERIFY_IS_APPROX(lu.solve(m3*m4), lu.solve(m3)*m4); in lu_invertible() 159 VERIFY_RAISES_ASSERT(lu.solve(tmp)) in lu_verify_assert() 171 VERIFY_RAISES_ASSERT(plu.solve(tmp)) in lu_verify_assert()
|
/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()
|
D | LUDecompositionImpl.java | 261 public double[] solve(double[] b) in solve() method in LUDecompositionImpl.Solver 302 public RealVector solve(RealVector b) in solve() method in LUDecompositionImpl.Solver 305 return solve((ArrayRealVector) b); in solve() 353 public ArrayRealVector solve(ArrayRealVector b) in solve() method in LUDecompositionImpl.Solver 355 return new ArrayRealVector(solve(b.getDataRef()), false); in solve() 359 public RealMatrix solve(RealMatrix b) in solve() method in LUDecompositionImpl.Solver 418 return solve(MatrixUtils.createRealIdentityMatrix(pivot.length)); in getInverse()
|
D | FieldLUDecompositionImpl.java | 261 public T[] solve(T[] b) in solve() method in FieldLUDecompositionImpl.Solver 304 public FieldVector<T> solve(FieldVector<T> b) in solve() method in FieldLUDecompositionImpl.Solver 307 return solve((ArrayFieldVector<T>) b); in solve() 357 public ArrayFieldVector<T> solve(ArrayFieldVector<T> b) in solve() method in FieldLUDecompositionImpl.Solver 359 return new ArrayFieldVector<T>(solve(b.getDataRef()), false); in solve() 363 public FieldMatrix<T> solve(FieldMatrix<T> b) in solve() method in FieldLUDecompositionImpl.Solver 429 return solve(identity); in getInverse()
|
/external/eigen/test/eigen2/ |
D | eigen2_cholesky.cpp | 54 symm.llt().solve(vecB, &vecX); in cholesky() 73 ldlt.solve(vecB, &vecX); in cholesky() 75 ldlt.solve(matB, &matX); in cholesky() 83 chol.solve(vecB, &vecX); in cholesky() 85 chol.solve(matB, &matX); in cholesky()
|
/external/opencv3/modules/videostab/include/opencv2/videostab/ |
D | fast_marching_inl.hpp | 131 … dist_(yn,xn) = std::min(std::min(solve(xn-1, yn, xn, yn-1), solve(xn+1, yn, xn, yn-1)), in run() 132 … std::min(solve(xn-1, yn, xn, yn+1), solve(xn+1, yn, xn, yn+1))); in run()
|
/external/eigen/doc/snippets/ |
D | Tutorial_solve_reuse_decomposition.cpp | 7 x = luOfA.solve(b); 11 x = luOfA.solve(b);
|
/external/opencv3/modules/calib3d/src/ |
D | p3p.h | 13 bool solve(cv::Mat& R, cv::Mat& tvec, const cv::Mat& opoints, const cv::Mat& ipoints); 14 int solve(double R[4][3][3], double t[4][3], 18 bool solve(double R[3][3], double t[3],
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
D | MatrixLogarithm.h | 245 .template triangularView<Upper>().solve(TminusI); in computePade3() 261 .template triangularView<Upper>().solve(TminusI); in computePade4() 279 .template triangularView<Upper>().solve(TminusI); in computePade5() 297 .template triangularView<Upper>().solve(TminusI); in computePade6() 317 .template triangularView<Upper>().solve(TminusI); in computePade7() 337 .template triangularView<Upper>().solve(TminusI); in computePade8() 359 .template triangularView<Upper>().solve(TminusI); in computePade9() 381 .template triangularView<Upper>().solve(TminusI); in computePade10() 405 .template triangularView<Upper>().solve(TminusI); in computePade11()
|