Searched refs:preconditioner (Results 1 – 11 of 11) sorted by relevance
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
D | NonLinearConjugateGradientOptimizer.java | 51 private Preconditioner preconditioner; field in NonLinearConjugateGradientOptimizer 70 preconditioner = null; in NonLinearConjugateGradientOptimizer() 80 public void setPreconditioner(final Preconditioner preconditioner) { in setPreconditioner() argument 81 this.preconditioner = preconditioner; in setPreconditioner() 119 if (preconditioner == null) { in doOptimize() 120 preconditioner = new IdentityPreconditioner(); in doOptimize() 134 double[] steepestDescent = preconditioner.precondition(point, r); in doOptimize() 179 final double[] newSteepestDescent = preconditioner.precondition(point, r); in doOptimize()
|
/external/tensorflow/tensorflow/contrib/solvers/python/ops/ |
D | linear_equations.py | 35 preconditioner=None, argument 94 if preconditioner is None: 99 q = preconditioner.apply(r) 115 if preconditioner is None: 118 p0 = preconditioner.apply(r0)
|
/external/tensorflow/tensorflow/contrib/solvers/python/kernel_tests/ |
D | linear_equations_test.py | 75 for preconditioner in preconditioners: 79 preconditioner=preconditioner,
|
/external/tensorflow/tensorflow/python/kernel_tests/ |
D | matrix_solve_ls_op_test.py | 68 preconditioner = l2_regularizer * np.identity(cols) 69 gramian = np.dot(np.conj(matrix.T), matrix) + preconditioner 73 preconditioner = l2_regularizer * np.identity(rows) 74 gramian = np.dot(matrix, np.conj(matrix.T)) + preconditioner
|
/external/eigen/doc/ |
D | SparseLinearSystems.dox | 56 <td>To speedup the convergence, try it with the \ref IncompleteLUT preconditioner.</td></tr> 158 …preconditioner. For instance, with the ILUT preconditioner, the incomplete factors L and U are com… 162 The member function preconditioner() returns a read-write reference to the preconditioner
|
D | TopicLinearAlgebraDecompositions.dox | 232 …on for square matrices. For non-square matrices, we have to use a QR preconditioner first. The def…
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
D | IterativeSolverBase.h | 272 Preconditioner& preconditioner() { return m_preconditioner; } in preconditioner() function 275 const Preconditioner& preconditioner() const { return m_preconditioner; } in preconditioner() function
|
/external/eigen/test/ |
D | incomplete_cholesky.cpp | 61 VERIFY(solver.preconditioner().info() == Eigen::Success); in test_incomplete_cholesky()
|
/external/eigen/bench/spbench/ |
D | spbench.dtd | 20 … <!ELEMENT COMPUTE (#PCDATA)> <!-- Time to analyze,to factorize, or to setup the preconditioner-->
|
/external/eigen/Eigen/ |
D | IterativeLinearSolvers | 27 …* - DiagonalPreconditioner - also called Jacobi preconditioner, work very well on diagonal domina…
|
D | SuperLUSupport | 44 …a supernodal sequential incomplete LU factorization (to be used as a preconditioner for iterative …
|