| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | DGMRES.h | 202 void dgmres(const MatrixType& mat,const Rhs& rhs, Dest& x, const Preconditioner& precond) const;
205 …int dgmresCycle(const MatrixType& mat, const Preconditioner& precond, Dest& x, DenseVector& r0, Re…
207 …int dgmresComputeDeflationData(const MatrixType& mat, const Preconditioner& precond, const Index& …
244 const Preconditioner& precond) const
254 x = precond.solve(x);
267 dgmresCycle(mat, precond, x, r0, beta, normRhs, nbIts);
287 …reconditioner>::dgmresCycle(const MatrixType& mat, const Preconditioner& precond, Dest& x, DenseVe…
305 tv2 = precond.solve(tv1);
309 tv2 = precond.solve(m_V.col(it)); // User's selected preconditioner
365 x = x + precond.solve(tv2);
[all …]
|
| D | GMRES.h | 56 bool gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond, in gmres() argument
75 VectorType r0 = precond.solve(p0); in gmres()
117 v = precond.solve(t); in gmres()
190 r0 = precond.solve(p0); in gmres()
|
| D | MINRES.h | 32 const Preconditioner& precond, Index& iters, in minres() argument
61 VectorType w_new(precond.solve(v_new)); // initialize w_new in minres()
101 w_new = precond.solve(v_new); // overwrite w_new in minres()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | LeastSquareConjugateGradient.h | 29 const Preconditioner& precond, Index& iters, in least_square_conjugate_gradient() argument
64 p = precond.solve(normal_residual); // initial search direction in least_square_conjugate_gradient()
82 …z = precond.solve(normal_residual); // approximately solve for "A'A z = normal_residua… in least_square_conjugate_gradient()
|
| D | BiCGSTAB.h | 30 const Preconditioner& precond, Index& iters, in bicgstab() argument
85 y = precond.solve(p); in bicgstab()
92 z = precond.solve(s); in bicgstab()
|
| D | ConjugateGradient.h | 29 const Preconditioner& precond, Index& iters, in conjugate_gradient() argument
63 p = precond.solve(residual); // initial search direction in conjugate_gradient()
80 z = precond.solve(residual); // approximately solve for "A z = residual" in conjugate_gradient()
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | no-iv-rewrite.ll | 10 %precond = icmp slt i32 0, %n
11 br i1 %precond, label %ph, label %return
49 %precond = icmp slt i32 0, %n
50 br i1 %precond, label %ph, label %return
90 %precond = icmp ne i32* %first, %last
91 br i1 %precond, label %ph, label %return
|
| D | elim-extend.ll | 40 %precond = icmp sgt i32 %limit, %init
41 br i1 %precond, label %loop, label %return
|
| /external/swiftshader/third_party/LLVM/test/Transforms/IndVarSimplify/ |
| D | no-iv-rewrite.ll | 10 %precond = icmp slt i32 0, %n
11 br i1 %precond, label %ph, label %return
49 %precond = icmp slt i32 0, %n
50 br i1 %precond, label %ph, label %return
90 %precond = icmp ne i32* %first, %last
91 br i1 %precond, label %ph, label %return
|
| D | elim-extend.ll | 40 %precond = icmp sgt i32 %limit, %init
41 br i1 %precond, label %loop, label %return
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/IndVarSimplify/ |
| D | no-iv-rewrite.ll | 10 %precond = icmp slt i32 0, %n
11 br i1 %precond, label %ph, label %return
49 %precond = icmp slt i32 0, %n
50 br i1 %precond, label %ph, label %return
90 %precond = icmp ne i32* %first, %last
91 br i1 %precond, label %ph, label %return
|
| D | elim-extend.ll | 40 %precond = icmp sgt i32 %limit, %init
41 br i1 %precond, label %loop, label %return
|