Lines Matching refs:iteration

42 iteration. In practice, the Newton iteration {math:numref}`newton` is
219 to be $\mathbf{A}(\mathbf{x})$. Sometimes this iteration exhibits better global
399 necessary to monitor the progress of the nonlinear iteration. In this
457 …4. update variables for the next iteration: $\lambda_j \gets \lambda_{j+1}$, $f(\lambda_j) \gets f…
558 **Choosing the Continuation Step.** For the first iteration from an equilibrium
571 Since in the first iteration, $\Delta\mathbf x = \delta\mathbf x^F = \mathbf 0$ and
592 surface at every iteration, or only when fully converged.
599 the constraint equation is not satisfied at every iteration.
612 iteration. As such, it is generally more robust.
614 iteration, $\delta\lambda$ is chosen as one of the roots of the above
632 **Nonlinear Richardson.** The nonlinear Richardson iteration, `SNESNRICHARDSON`, merely
633 takes the form of a line search-damped fixed-point iteration of the form
655 fixed-point iteration iterate, into an approximate residual-minimizing new iterate.
669 This iteration is similar to the line search Newton methods.
873 `its` and `mctx` respectively denote the iteration number and an
948 at each iteration can be costly, modifications
965 each global or outer Newton iteration a sequence of subsidiary inner
968 system at each global iteration is critical, since these inner
981 by iteration on the system until the residuals