| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| DecompositionSolver.java | 23 * Interface handling decomposition algorithms that can solve A × X = B.
25 * matrices from which they can solve A × X = B in least squares sense: they find X
38 /** Solve the linear equation A × X = B for matrices A.
46 double[] solve(final double[] b) method in interface:DecompositionSolver
49 /** Solve the linear equation A × X = B for matrices A.
57 RealVector solve(final RealVector b) method in interface:DecompositionSolver
60 /** Solve the linear equation A × X = B for matrices A.
68 RealMatrix solve(final RealMatrix b) method in interface:DecompositionSolver
|
| FieldDecompositionSolver.java | 24 * Interface handling decomposition algorithms that can solve A × X = B.
26 * matrices from which they can solve A × X = B in least squares sense: they find X
40 /** Solve the linear equation A × X = B for matrices A.
48 T[] solve(final T[] b) method in interface:FieldDecompositionSolver
51 /** Solve the linear equation A × X = B for matrices A.
59 FieldVector<T> solve(final FieldVector<T> b) method in interface:FieldDecompositionSolver
62 /** Solve the linear equation A × X = B for matrices A.
70 FieldMatrix<T> solve(final FieldMatrix<T> b) method in interface:FieldDecompositionSolver
|
| /prebuilts/go/darwin-x86/doc/play/ |
| solitaire.go | 72 // solve tries to find a sequence of moves such that
75 // If a solution is found, solve prints the board after
79 func solve() bool { func
90 if solve() {
113 if !solve() {
|
| /prebuilts/go/darwin-x86/test/ |
| solitaire.go | 75 // solve tries to find a sequence of moves such that there is only one peg left
77 // If a solution is found, solve prints the board after each move in a backward
80 func solve() bool { func
91 if solve() {
114 if !solve() {
|
| /prebuilts/go/linux-x86/doc/play/ |
| solitaire.go | 72 // solve tries to find a sequence of moves such that
75 // If a solution is found, solve prints the board after
79 func solve() bool { func
90 if solve() {
113 if !solve() {
|
| /prebuilts/go/linux-x86/test/ |
| solitaire.go | 75 // solve tries to find a sequence of moves such that there is only one peg left
77 // If a solution is found, solve prints the board after each move in a backward
80 func solve() bool { func
91 if solve() {
114 if !solve() {
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/scripts/ |
| queens.py | 28 def solve(self, x=0): # Recursive solver
member in class:Queens
35 self.solve(x+1)
81 q.solve()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| BisectionSolver.java | 37 * @param f function to solve.
38 * @deprecated as of 2.0 the function to solve is passed as an argument
39 * to the {@link #solve(UnivariateRealFunction, double, double)} or
40 * {@link UnivariateRealSolverImpl#solve(UnivariateRealFunction, double, double, double)}
58 public double solve(double min, double max, double initial) method in class:BisectionSolver
60 return solve(f, min, max);
65 public double solve(double min, double max) method in class:BisectionSolver
67 return solve(f, min, max);
75 public double solve(final UnivariateRealFunction f, double min, double max, double initial) method in class:BisectionSolver
77 return solve(f, min, max)
82 public double solve(int maxEval, final UnivariateRealFunction f, double min, double max, double initial) method in class:BisectionSolver
89 public double solve(int maxEval, final UnivariateRealFunction f, double min, double max) method in class:BisectionSolver
100 public double solve(final UnivariateRealFunction f, double min, double max) method in class:BisectionSolver
[all...] |
| UnivariateRealSolver.java | 62 * Solve for a zero root in the given interval.
75 * @deprecated replaced by {@link #solve(UnivariateRealFunction, double, double)}
79 double solve(double min, double max) throws ConvergenceException, FunctionEvaluationException; method in interface:UnivariateRealSolver
82 * Solve for a zero root in the given interval.
87 * @param f the function to solve.
100 double solve(UnivariateRealFunction f, double min, double max) method in interface:UnivariateRealSolver
104 * Solve for a zero in the given interval, start at startValue.
118 * @deprecated replaced by {@link #solve(UnivariateRealFunction, double, double, double)}
122 double solve(double min, double max, double startValue) method in interface:UnivariateRealSolver
126 * Solve for a zero in the given interval, start at startValue
145 double solve(UnivariateRealFunction f, double min, double max, double startValue) method in interface:UnivariateRealSolver
[all...] |
| NewtonSolver.java | 40 * @param f function to solve.
41 * @deprecated as of 2.0 the function to solve is passed as an argument
42 * to the {@link #solve(UnivariateRealFunction, double, double)} or
43 * {@link UnivariateRealSolverImpl#solve(UnivariateRealFunction, double, double, double)}
62 public double solve(final double min, final double max) method in class:NewtonSolver
64 return solve(f, min, max);
69 public double solve(final double min, final double max, final double startValue) method in class:NewtonSolver
71 return solve(f, min, max, startValue);
77 * @param f the function to solve
87 public double solve(int maxEval, final UnivariateRealFunction f method in class:NewtonSolver
107 public double solve(final UnivariateRealFunction f, method in class:NewtonSolver
128 public double solve(int maxEval, final UnivariateRealFunction f, method in class:NewtonSolver
150 public double solve(final UnivariateRealFunction f, method in class:NewtonSolver
[all...] |
| RiddersSolver.java | 43 * @param f function to solve
44 * @deprecated as of 2.0 the function to solve is passed as an argument
45 * to the {@link #solve(UnivariateRealFunction, double, double)} or
46 * {@link UnivariateRealSolverImpl#solve(UnivariateRealFunction, double, double, double)}
65 public double solve(final double min, final double max) method in class:RiddersSolver
67 return solve(f, min, max);
72 public double solve(final double min, final double max, final double initial) method in class:RiddersSolver
74 return solve(f, min, max, initial);
82 * @param f the function to solve
93 public double solve(int maxEval, final UnivariateRealFunction f method in class:RiddersSolver
116 public double solve(final UnivariateRealFunction f, method in class:RiddersSolver
149 public double solve(int maxEval, final UnivariateRealFunction f, method in class:RiddersSolver
171 public double solve(final UnivariateRealFunction f, method in class:RiddersSolver
[all...] |
| SecantSolver.java | 48 * @param f function to solve.
49 * @deprecated as of 2.0 the function to solve is passed as an argument
50 * to the {@link #solve(UnivariateRealFunction, double, double)} or
51 * {@link UnivariateRealSolverImpl#solve(UnivariateRealFunction, double, double, double)}
70 public double solve(final double min, final double max) method in class:SecantSolver
72 return solve(f, min, max);
77 public double solve(final double min, final double max, final double initial) method in class:SecantSolver
79 return solve(f, min, max, initial);
85 * @param f the function to solve
97 public double solve(int maxEval, final UnivariateRealFunction f method in class:SecantSolver
119 public double solve(final UnivariateRealFunction f, method in class:SecantSolver
138 public double solve(int maxEval, final UnivariateRealFunction f, method in class:SecantSolver
158 public double solve(final UnivariateRealFunction f, method in class:SecantSolver
[all...] |
| UnivariateRealSolverUtils.java | 54 public static double solve(UnivariateRealFunction f, double x0, double x1) method in class:UnivariateRealSolverUtils
57 return LazyHolder.FACTORY.newDefaultSolver().solve(f, x0, x1);
75 public static double solve(UnivariateRealFunction f, double x0, double x1, method in class:UnivariateRealSolverUtils
82 return solver.solve(f, x0, x1);
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/java/com/github/javaparser/symbolsolver/ |
| Issue251.java | 29 Assert.assertNotNull(javaParserFacade.solve(expression));
|
| /external/python/cpython2/Demo/scripts/ |
| queens.py | 28 def solve(self, x=0): # Recursive solver member in class:Queens
35 self.solve(x+1)
81 q.solve()
|
| /external/python/cpython3/Tools/demo/ |
| queens.py | 28 def solve(self, x=0): # Recursive solver member in class:Queens
35 self.solve(x+1)
81 q.solve()
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSolverBase.h | 18 * Helper functions to solve with a sparse right-hand-side and result.
39 tmpX.leftCols(actualCols) = dec.solve(tmp.leftCols(actualCols));
53 dest_dense = dec.solve(rhs_dense);
87 inline const Solve<Derived, Rhs>
88 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SparseSolverBase
91 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
92 return Solve<Derived, Rhs>(derived(), b.derived());
100 inline const Solve<Derived, Rhs>
101 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::SparseSolverBase
104 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b")
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_generators.py | 1115 def solve(self):
member in class:Queens
1140 # solve() will set up succs[i] to be a list of square #i's
1302 def solve(self): member in class:Knights
[all...] |
| /external/eigen/Eigen/src/Core/ |
| SolverBase.h | 31 * x = dec.solve(b); // solve A * x = b
32 * x = dec.transpose().solve(b); // solve A^T * x = b
33 * x = dec.adjoint().solve(b); // solve A' * x = b
74 inline const Solve<Derived, Rhs>
75 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SolverBase
77 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
78 return Solve<Derived, Rhs>(derived(), b.derived())
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 18 * This class allows to approximately solve for A.x = b problems assuming A is a diagonal matrix.
94 template<typename Rhs> inline const Solve<DiagonalPreconditioner, Rhs>
95 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::DiagonalPreconditioner
99 && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b");
100 return Solve<DiagonalPreconditioner, Rhs>(*this, b.derived());
113 * This class allows to approximately solve for A' A x = A' b problems assuming A' A is a diagonal matrix.
219 inline const Rhs& solve(const Rhs& b) const { return b; } function in class:Eigen::IdentityPreconditioner
|
| /external/python/cpython2/Lib/test/ |
| test_generators.py | 1116 def solve(self): member in class:Queens
1141 # solve() will set up succs[i] to be a list of square #i's
1303 def solve(self): member in class:Knights
[all...] |
| /external/tensorflow/tensorflow/python/ops/linalg/ |
| linalg_impl.py | 50 solve = linalg_ops.matrix_solve variable
|
| /packages/apps/Camera2/src/com/android/camera/ui/motion/ |
| UnitBezier.java | 54 * @param t the x position between 0 and 1 to solve for y.
59 return mYFn.value(solve(t, mXFn));
66 * @param value the y position between 0 and 1 to solve for x
72 return mXFn.value(solve(value, mYFn));
75 private float solve(float target, DerivableFloatFn fn) { method in class:UnitBezier
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_generators.py | 1116 def solve(self): member in class:Queens
1141 # solve() will set up succs[i] to be a list of square #i's
1303 def solve(self): member in class:Knights
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_generators.py | 1116 def solve(self): member in class:Queens
1141 # solve() will set up succs[i] to be a list of square #i's
1303 def solve(self): member in class:Knights
[all...] |
