Home
last modified time | relevance | path

Searched refs:bk (Results 1 – 3 of 3) sorted by relevance

/petsc/src/sys/utils/
H A Dsorti.c1040 PetscInt *L_ = *L, ak, bk, k; in PetscMergeIntArray() local
1047 k = ak = bk = 0; in PetscMergeIntArray()
1048 while (ak < an && bk < bn) { in PetscMergeIntArray()
1049 if (aI[ak] == bI[bk]) { in PetscMergeIntArray()
1052 ++bk; in PetscMergeIntArray()
1054 } else if (aI[ak] < bI[bk]) { in PetscMergeIntArray()
1059 L_[k] = bI[bk]; in PetscMergeIntArray()
1060 ++bk; in PetscMergeIntArray()
1068 if (bk < bn) { in PetscMergeIntArray()
1069 PetscCall(PetscArraycpy(L_ + k, bI + bk, bn - bk)); in PetscMergeIntArray()
[all …]
/petsc/src/tao/unconstrained/impls/bmrm/
H A Dbmrm.c12 PetscReal gd, max, ak, bk, akold, bkold, lamnew, alpha, kktlam = 0.0, lam_ext; in solve() local
131 bk = 0.0; in solve()
132 for (i = 0; i < dim; i++) bk += d[i] * Qd[i]; in solve()
134 if (bk > EPS * ak && gd < 0.0) lamnew = -gd / bk; in solve()
178 ak = bk = 0.0; in solve()
181 bk += sk[i] * yk[i]; in solve()
184 if (bk <= EPS * ak) alpha = ALPHA_MAX; in solve()
186 if (bkold < EPS * akold) alpha = ak / bk; in solve()
187 else alpha = (akold + ak) / (bkold + bk); in solve()
194 bkold = bk; in solve()
[all …]
/petsc/src/dm/dt/interface/
H A Ddt.c787 PetscReal ak, bk; in PetscDTJacobiEval_Internal() local
794 bk = b + k; in PetscDTJacobiEval_Internal()
808 PetscDTJacobiRecurrence_Internal(1, ak, bk, cnm1, cnm1x, cnm2); in PetscDTJacobiEval_Internal()
825 PetscDTJacobiRecurrence_Internal(j, ak, bk, cnm1, cnm1x, cnm2); in PetscDTJacobiEval_Internal()