Home
last modified time | relevance | path

Searched refs:_k (Results 1 – 7 of 7) sorted by relevance

/petsc/src/mat/impls/aij/mpi/
H A Dmpiaij.h190 PetscInt _anz, _pnz, _j, _k, *_ai, *_aj, _row, *_pi, *_pj, _nextp, *_apJ; \
207 for (_k = 0; _nextp < _pnz; _k++) { \
208 if (_apJ[_k] == _pj[_nextp]) { /* column of AP == column of P */ \
209 apa[_k] += _valtmp * _pa[_nextp++]; \
229 for (_k = 0; _nextp < _pnz; _k++) { \
230 if (_apJ[_k] == _pj[_nextp]) { /* column of AP == column of P */ \
231 apa[_k] += _valtmp * _pa[_nextp++]; \
241 PetscInt _anz, _pnz, _j, _k, *_ai, *_aj, _row, *_pi, *_pj; \
256 for (_k = 0; _k < _pnz; _k++) apa[_pj[_k]] += _valtmp * _pa[_k]; \
273 for (_k = 0; _k < _pnz; _k++) apa[_pj[_k]] += _valtmp * _pa[_k]; \
/petsc/src/dm/field/impls/da/
H A Ddmfieldda.c60 PetscInt _k, _l; \
61 for (_k = 0; _k < (c); _k++) (y)[_k] = 0.; \
63 for (_k = 0; _k < (c); _k++) (y)[_k] += cast((A)[(c) * _l + _k]) * (x)[_l]; \
69 PetscInt _m, _j, _k; \
72 for (_k = _j + 1; _k < (dim); _k++) { \
73 PetscInt _ind = (1 << _j) + (1 << _k); \
76 (out)[(_m * (dim) + _k) * (dim) + _j] += cast(c); \
77 (out)[(_m * (dim) + _j) * (dim) + _k] += cast(c); \
/petsc/doc/manual/
H A Dsnes.md37 \mathbf{x}_{k+1} = \mathbf{x}_k - \mathbf{J}(\mathbf{x}_k)^{-1} \mathbf{F}(\mathbf{x}_k), \;\; k=0,…
41 $\mathbf{J}(\mathbf{x}_k) = \mathbf{F}'(\mathbf{x}_k)$, the Jacobian, is nonsingular at each
47 …text{(Approximately) solve} & \mathbf{J}(\mathbf{x}_k) \Delta \mathbf{x}_k &= -\mathbf{F}(\mathbf{…
48 2. & \text{Update} & \mathbf{x}_{k+1} &\gets \mathbf{x}_k + \Delta \mathbf{x}_k.
53 choices for $J(\mathbf{x}_k)$.
636 \mathbf{x}_{k+1} = \mathbf{x}_k - \lambda \mathbf{F}(\mathbf{x}_k), \;\; k=0,1, \ldots,
658 which is the nonlinear function's residual, \$ mathbf\{F}(mathbf\{x}\_k)\$. The different update is…
972 inner iterations, particularly when $\| \mathbf{x}_k - \mathbf{x}_* \|$ is large,
984 \mathbf{r}_k^{(i)} = \mathbf{F}'(\mathbf{x}_k) \Delta \mathbf{x}_k + \mathbf{F}(\mathbf{x}_k)
990 \frac{ \| \mathbf{r}_k^{(i)} \| }{ \| \mathbf{F}(\mathbf{x}_k) \| } \leq \eta_k \leq \eta < 1.
H A Dtao.md2172 \displaystyle \min_{u,v} & \tilde{f}_k(u, v) \\
2181 \tilde{f}_k(u,v) = f(u,v) - g(u,v)^T y^k + \frac{\rho_k}{2} \| g(u,v) \|^2
2217 \displaystyle \min_{\alpha \geq 0} \; \tilde{f}_k(u_k + \alpha du, v_k).
2249 \displaystyle \min_{u,v} & \tilde{f}_k(u, v) \\
2258 \displaystyle \min_{du,dv} & \tilde{f}_k(u_k+du, v_k+dv) \\
2273 \displaystyle \min_{dv} & \tilde{f}_k(u_k-A_k^{-1}(B_k dv + \alpha_k g_k), v_k+dv), \\
2281 \displaystyle \min_{dv} & \tilde{f}_k(u_{k+\frac{1}{2}} - A_k^{-1} B_k dv, v_{k+\frac{1}{2}}+dv). \\
2290 \displaystyle \min_{dv} & \frac{1}{2} dv^T \tilde{H}_k dv + \tilde{g}_{k+\frac{1}{2}}^T dv,
2294 where $\tilde{H}_k$ is the limited-memory quasi-Newton
2300 \tilde{g}_{k+\frac{1}{2}} & = & \nabla_v \tilde{f}_k(u_{k+\frac{1}{2}}, v_{k+\frac{1}{2}}) -
[all …]
H A Dksp.md1464 [f^{F}_i]_k &= f^{F,k}_i \\
/petsc/src/dm/field/impls/ds/
H A Ddmfieldds.c74 PetscInt _i, _j, _k; \
76 for (_k = 0; _k < (c); _k++) (y)[_i * (c) + _k] = 0.; \
78 …for (_k = 0; _k < (c); _k++) (y)[_i * (c) + _k] += (A)[(_i * (n) + _j) * (c) + _k] * cast((b)[_j])…
/petsc/src/mat/impls/dense/seq/
H A Ddense.c521 …atSolve_SeqDense_SetUp(Mat A, Vec xx, Vec yy, PetscScalar **_y, PetscBLASInt *_m, PetscBLASInt *_k) in MatSolve_SeqDense_SetUp() argument
538 *_k = k; in MatSolve_SeqDense_SetUp()
543 …olve_SeqDense_TearDown(Mat A, Vec xx, Vec yy, PetscScalar **_y, PetscBLASInt *_m, PetscBLASInt *_k) in MatSolve_SeqDense_TearDown() argument
552 k = *_k; in MatSolve_SeqDense_TearDown()
638 …t X, PetscScalar **_y, PetscBLASInt *_ldy, PetscBLASInt *_m, PetscBLASInt *_nrhs, PetscBLASInt *_k) in MatMatSolve_SeqDense_SetUp() argument
649 *_k = 0; in MatMatSolve_SeqDense_SetUp()
683 *_k = k; in MatMatSolve_SeqDense_SetUp()
689 …t X, PetscScalar **_y, PetscBLASInt *_ldy, PetscBLASInt *_m, PetscBLASInt *_nrhs, PetscBLASInt *_k) in MatMatSolve_SeqDense_TearDown() argument
698 k = *_k; in MatMatSolve_SeqDense_TearDown()