Home
last modified time | relevance | path

Searched refs:precond (Results 1 – 5 of 5) sorted by relevance

/external/eigen/Eigen/src/IterativeLinearSolvers/
DConjugateGradient.h29 const Preconditioner& precond, int& iters, in conjugate_gradient() argument
46 p = precond.solve(residual); //initial search direction in conjugate_gradient()
66 z = precond.solve(residual); // approximately solve for "A z = residual" in conjugate_gradient()
DBiCGSTAB.h30 const Preconditioner& precond, int& iters, in bicgstab() argument
68 y = precond.solve(p); in bicgstab()
75 z = precond.solve(s); in bicgstab()
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DGMRES.h56 bool gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond, in gmres() argument
75 VectorType r0 = precond.solve(p0); in gmres()
104 v=precond.solve(t); in gmres()
176 VectorType p1=precond.solve(p0); in gmres()
/external/llvm/test/Transforms/IndVarSimplify/
Dno-iv-rewrite.ll10 %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
Delim-extend.ll40 %precond = icmp sgt i32 %limit, %init
41 br i1 %precond, label %loop, label %return