Lines Matching refs:iteration

79 solution vectors. On return, the iteration number at which the iterative
87 iteration: it can also have reached the maximum number of iterations, or
476 Convergence is detected at iteration $k$ if
514 routine arguments are the iteration number, `it`, and the residual’s
528 of the residuals should be displayed at each iteration by using `-ksp_monitor` with
541 routine arguments are the iteration number (`it`) and the residual’s
558 the residual at each iteration. The routine
562 iteration computed via the Lanczos or Arnoldi algorithms.
565 residual at each iteration by actually computing the residual using the
582 Lanczos iteration. First, before the linear solve one must call
629 …vide a callback function that changes the preconditioner at each Krylov iteration. Its calling seq…
639 …ore global reductions resulting from the computations of inner products or norms in each iteration.
1136   >   iteration of the solver.
1151 …>   stronger the Krylov method the faster the convergence, but with more cost per iteration. See `…
1153 …>   , the faster the convergence, but with more cost per multigrid iteration. See `PCMGSetNumberSm…
1156   >   stronger the preconditioner the faster the convergence, but with more cost per iteration.
1237 overly expensive solver per iteration and too fast coarsening will
1363 are getting nearly one digit in reduction of the residual per iteration
1694 Loosely, this corresponds to a Gauss-Seidel iteration, while additive
1695 corresponds to a Jacobi iteration.
2044 …PCFieldSplitSetSchurFactType()`. `full` reduces the iterations but each iteration requires additio…
2427 norm of the Krylov iteration will not converge to zero; it will converge to a non-zero value while …