Home
last modified time | relevance | path

Searched refs:iteration (Results 1 – 25 of 37) sorted by relevance

12

/petsc/src/tao/unconstrained/tutorials/output/
H A Deptorsion2f_3.out1 iteration multiple of 5
2 iteration multiple of 5
3 iteration multiple of 5
4 iteration multiple of 5
5 iteration multiple of 5
6 iteration multiple of 5
7 iteration multiple of 5
H A Drosenbrock1_23.out1 TAO solve did not converge due to DIVERGED_MAXFCN iteration 0
H A Drosenbrock1_22.out1 TAO solve did not converge due to DIVERGED_MAXITS iteration 1
/petsc/src/ksp/ksp/tutorials/output/
H A Dex2f_2.out10 iteration 0 residual norm 0.1118E+01
11 iteration 0 solution vector:
12 iteration 1 residual norm 0.5916E+00
13 iteration 1 solution vector:
14 iteration 2 residual norm 0.3162E+00
15 iteration 2 solution vector:
16 iteration 3 residual norm 0.2570E-16
17 iteration 3 solution vector:
H A Dex77_deflation.out5 …relative tolerance 1.000000000000e-05 times initial residual norm 1.926034675817e-05 at iteration 1
/petsc/src/snes/tutorials/output/
H A Dex15_nleqerr.out3 Line search: entering iteration with lambda: 1.000000000000e+00
6 Line search: entering iteration with lambda: 2.886019430766e-01
11 Line search: entering iteration with lambda: 1.000000000000e+00
14 Line search: entering iteration with lambda: 2.324329826076e-01
19 Line search: entering iteration with lambda: 1.000000000000e+00
22 Line search: entering iteration with lambda: 2.018780657684e-01
27 Line search: entering iteration with lambda: 1.000000000000e+00
30 Line search: entering iteration with lambda: 1.791551122411e-01
35 Line search: entering iteration with lambda: 1.000000000000e+00
38 Line search: entering iteration with lambda: 1.624163594771e-01
[all …]
H A Dex3_4.out6 Checking candidate step at iteration 1 with tolerance 1.
10 Checking candidate step at iteration 2 with tolerance 1.
13 Checking candidate step at iteration 3 with tolerance 1.
/petsc/src/ksp/ksp/tests/raja/
H A Dex1.raja.cxx117 int iteration; in main() local
135 iteration = 0; in main()
162 if (iteration > maxIter) { in main()
167 iteration++; in main()
170 printf("No of iterations: %d \n \n", iteration); in main()
182 iteration = 0; in main()
212 if (iteration > maxIter) { in main()
216 iteration++; in main()
219 printf("No of iterations: %d \n \n", iteration); in main()
224 iteration = 0; in main()
[all …]
/petsc/src/tao/leastsquares/tests/output/
H A Dchwirut2_5.out2 TAO solve did not converge due to DIVERGED_LS_FAILURE iteration 1
/petsc/share/petsc/saws/js/
H A DPETSc.js13 var iteration = 0; variable
44 iteration ++;
45 if(iteration == 2) { //remove text
/petsc/doc/manual/
H A Dsnes.md42 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
[all …]
H A Dksp.md79 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
[all …]
H A Ddmcommonality.md44 …or `DMStagGetGhostCorners()` and iterates over the tuples within the bounds with an inner iteration
65 vectors or arrays for said points. If needed one can then have an inner iteration over the fields a…
H A Dtao.md586 current iteration number, objective function value, gradient norm,
1631 iteration, $x_{N+1}$ is removed from the set and replaced with
1644 impacted at each iteration.
1737 At each iteration, the bound tolerance is estimated as
1769 iteration. By default, the number of BNCG iterations is set to zero and
2036 of bound constrained problems at each outer iteration
2048 iteration $k$.
2128 method using PETSc’s SNES object. After each Newton iteration, a
2131 updated after each Newton iteration. The Newton update is obtained by
2363 iteration of the code. The quantities $v_{k+\frac{1}{2}}$,
[all …]
H A Dts.md946 - `-ts_monitor` - prints the time and timestep at each iteration.
948 adaption calculation at each iteration.
957 - `-ts_monitor_draw_solution` - plots the solution at each iteration,
959 - `-ts_monitor_draw_error` - plots the error at each iteration only
963 iteration to a binary file, `TSMonitorSolution()`. Solution viewers work
969 at each iteration to a file in vtk format,
1523 to compute it at each Newton iteration. This is done with the command
/petsc/doc/changes/
H A D2028.md45 - `SLESSolve()` now ALWAYS returns a 0 or positive iteration
57 iteration.
191 display the Newton update at each iteration.
H A D232.md59 iteration in as the second argument. Also the convergence test
H A D311.md54 iteration than requested. For example -ksp_max_it 2 resulted in 3
H A D33.md103 reduction per iteration instead of two blocking reductions.
108 iteration (like KSPIBCGS).
H A D36.md139 linear iteration SNESMonitorVI() becomes SNESVIMonitor()
H A D2015.md79 - Initialized iteration counter to 0 for successive calls to SNES
/petsc/src/sys/classes/viewer/impls/cgns/
H A Dcgnsv.c519 PetscErrorCode PetscViewerCGNSGetSolutionIteration(PetscViewer viewer, PetscInt *iteration, PetscBo… in PetscViewerCGNSGetSolutionIteration() argument
528 PetscAssertPointer(iteration, 2); in PetscViewerCGNSGetSolutionIteration()
540 *iteration = (PetscInt)steps[cgv->solution_file_pointer_index - 1]; in PetscViewerCGNSGetSolutionIteration()
/petsc/src/tao/leastsquares/tutorials/
H A DtomographyGenerateData.m47 % Need 100/500/1000+ iteration to get good/very good/excellent result with small regularizer.
/petsc/src/binding/petsc4py/src/petsc4py/PETSc/
H A DKSP.pyx120 iterations as well as the "0-iteration" case. It is commonly
277 Used by the `Type.PREONLY` solver after the single iteration of the
938 Set the relative, absolute, divergence, and maximum iteration
990 Return the relative, absolute, divergence, and maximum iteration
1167 each iteration of the solver.
1241 Set an ADDITIONAL function to be called at every iteration to
1763 iteration of the Krylov method we remove the nullspace(A) from
2366 """The maximum number of iteration the solver may take."""
2373 # --- iteration ---
2384 """The norm of the residual at the current iteration."""
/petsc/doc/overview/
H A Dlinear_solve_table.md658 * - Pipelined Conjugate Gradient over iteration pairs

12