Lines Matching refs:where

23 where $\mathbf{F}: \, \Re^n \to \Re^n$. Newton-like methods provide the
40 where $\mathbf{x}_0$ is an initial approximation to the solution and
93 or use the option `-snes_type <method>`, where details regarding the
117 where `x` should be initialized to the initial guess before calling and contains the solution on re…
181 preconditioner storage `B`, rather than `A`. In the case where they
192 `-snes_mf_operator` may be used to obtain the exact solution, where
202 where $\mathbf{A}(\mathbf{x})$ usually contains the lower-derivative parts of the
246 Occasionally nonlinear solvers will propose solutions $u$, where the function value (or the objecti…
420 if set, and `SNESLINESEARCHCP`, which minimizes $F(x) \cdot Y$ where
423 the case where a single secant search is not sufficient. The number of
508 where $\delta s = 1$ unless partial corrections are used (discussed more
513 …mbda$, computed by $K \delta\mathbf x^Q = \mathbf Q(\mathbf x, \lambda)$, where $\mathbf Q(\mathbf…
535 where $L$ is a user-provided step size corresponding to the radius of the
561 quadratic equation $a\delta\lambda^2 + b\delta\lambda + c = 0$, where
579 where the sign is positive for the first increment and is determined by the previous
586 where $(\Delta\mathbf x)_{i-1}$ and $(\Delta\lambda)_{i-1}$ are the
639 where the default linesearch is `SNESLINESEARCHSECANT`. This simple solver
872 The routine, `mon`, indicates a user-defined monitoring routine, where
956 particular interest are Newton-Krylov methods, where the subsidiary
964 Two levels of iterations occur for the inexact techniques, where during
1079 where $h$ is computed via
1173 certain situations where one is unable to compute Jacobian matrices
1232 This is harder in the unstructured case, but one typically knows where the nonzero entries are from…
1303 where $h$ is computed via: