1 2---- Minimum Surface Area Problem ----- 3mx:4, my:4 4 0 TAO, Function value: 0.210375, Residual: 0.403597 5 1 TAO, Function value: 0.0110611, Residual: 0.0197949 6 2 TAO, Function value: 4.46353e-05, Residual: 8.72583e-05 7 3 TAO, Function value: 8.12611e-10, Residual: 1.80227e-09 8Tao Object: 1 MPI process 9 type: ssils 10 TaoLineSearch Object: 1 MPI process 11 type: armijo 12 Armijo linesearch : alpha=1. beta=0.5 sigma=0.0001 memsize=1 13 maximum function evaluations=30 14 tolerances: ftol=0.0001, rtol=1e-10, gtol=0.9 15 total number of function evaluations=1 16 total number of gradient evaluations=1 17 total number of function/gradient evaluations=0 18 Termination reason: SUCCESS 19 KSP Object: 1 MPI process 20 type: gmres 21 restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement 22 happy breakdown tolerance=1e-30 23 maximum iterations=10000, initial guess is zero 24 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 25 left preconditioning 26 using PRECONDITIONED norm type for convergence test 27 PC Object: 1 MPI process 28 type: ilu 29 out-of-place factorization 30 0 levels of fill 31 tolerance for zero pivot 2.22045e-14 32 matrix ordering: natural 33 factor fill ratio given 1., needed 1. 34 Factored matrix: 35 Mat Object: 1 MPI process 36 type: seqaij 37 rows=16, cols=16 38 package used to perform factorization: petsc 39 total: nonzeros=82, allocated nonzeros=82 40 not using I-node routines 41 linear system matrix, which is also used to construct the preconditioner: 42 Mat Object: 1 MPI process 43 type: seqaij 44 rows=16, cols=16 45 total: nonzeros=82, allocated nonzeros=112 46 total number of mallocs used during MatSetValues calls=0 47 not using I-node routines 48 total KSP iterations: 13 49 Active Set subset type: subvec 50 convergence tolerances: gatol=1e-16, grtol=0., steptol=0., gttol=1e-05 51 Residual in Function/Gradient:=1.80227e-09 52 convergence tolerances: catol=1e-08, crtol=1e-08 53 Residual in Constraints:=0. 54 convergence tolerances: function minimum=1e-08 55 Objective value=8.12611e-10 56 total number of iterations=3, (max: 2000) 57 total number of constraint function evaluations=7 58 total number of Jacobian evaluations=4 59 Solution converged: Minf -- f < fmin 60