Searched refs:precond (Results 1 – 10 of 10) sorted by relevance
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
D | DGMRES.h | 187 void dgmres(const MatrixType& mat,const Rhs& rhs, Dest& x, const Preconditioner& precond) const; 190 …Index dgmresCycle(const MatrixType& mat, const Preconditioner& precond, Dest& x, DenseVector& r0, … 192 …Index dgmresComputeDeflationData(const MatrixType& mat, const Preconditioner& precond, const Index… 229 const Preconditioner& precond) const 251 x = precond.solve(rhs); 264 dgmresCycle(mat, precond, x, r0, beta, normRhs, nbIts); 286 …reconditioner>::dgmresCycle(const MatrixType& mat, const Preconditioner& precond, Dest& x, DenseVe… 304 tv2 = precond.solve(tv1); 308 tv2 = precond.solve(m_V.col(it)); // User's selected preconditioner 364 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 84 VectorType r0 = precond.solve(p0); in gmres() 126 v = precond.solve(t); in gmres() 199 r0 = precond.solve(p0); in gmres()
|
D | MINRES.h | 33 const Preconditioner& precond, Index& iters, in minres() argument 62 VectorType w_new(precond.solve(v_new)); // initialize w_new in minres() 100 w_new = precond.solve(v_new); // overwrite w_new in minres()
|
D | IDRS.h | 59 bool idrs(const MatrixType& A, const Rhs& b, Dest& x, const Preconditioner& precond, in idrs() argument 153 v = precond.solve(v); in idrs() 220 v = precond.solve(v); in idrs()
|
/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 64 p = precond.solve(residual); // initial search direction in conjugate_gradient() 81 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/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/ |
D | build.log | 339 precond: 0.2.3
|