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