1lid velocity = 0.0204082, prandtl # = 1., grashof # = 1. 2 0 SNES Function norm 0.146194 3 0 KSP Residual norm 0.146194 4 1 KSP Residual norm < 1.e-11 5 1 SNES Function norm 2.50702e-05 6 0 KSP Residual norm 2.50702e-05 7 1 KSP Residual norm < 1.e-11 8 2 SNES Function norm < 1.e-11 9SNES Object: 1 MPI processes 10 type: newtonls 11 maximum iterations=50, maximum function evaluations=10000 12 tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 13 total number of linear solver iterations=2 14 total number of function evaluations=3 15 norm schedule ALWAYS 16 Jacobian is built using colored finite differences on a DMDA 17 SNESLineSearch Object: 1 MPI processes 18 type: bt 19 interpolation: cubic 20 alpha=1.000000e-04 21 maxstep=1.000000e+08, minlambda=1.000000e-12 22 tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 23 maximum iterations=40 24 KSP Object: 1 MPI processes 25 type: fgmres 26 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 27 happy breakdown tolerance 1e-30 28 maximum iterations=10000, initial guess is zero 29 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 30 right preconditioning 31 using UNPRECONDITIONED norm type for convergence test 32 PC Object: 1 MPI processes 33 type: fieldsplit 34 FieldSplit with MULTIPLICATIVE composition: total splits = 2, blocksize = 2 35 Solver info for each split is in the following KSP objects: 36 Split number 0 Fields 0, 1 37 KSP Object: (fieldsplit_0_) 1 MPI processes 38 type: preonly 39 maximum iterations=10000, initial guess is zero 40 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 41 left preconditioning 42 using NONE norm type for convergence test 43 PC Object: (fieldsplit_0_) 1 MPI processes 44 type: lu 45 out-of-place factorization 46 tolerance for zero pivot 2.22045e-14 47 matrix ordering: nd 48 factor fill ratio given 5., needed 2.5576 49 Factored matrix follows: 50 Mat Object: 1 MPI processes 51 type: seqaij 52 rows=196, cols=196, bs=2 53 package used to perform factorization: petsc 54 total: nonzeros=8880, allocated nonzeros=8880 55 total number of mallocs used during MatSetValues calls=0 56 using I-node routines: found 49 nodes, limit used is 5 57 linear system matrix = precond matrix: 58 Mat Object: (fieldsplit_0_) 1 MPI processes 59 type: seqaij 60 rows=196, cols=196, bs=2 61 total: nonzeros=3472, allocated nonzeros=3472 62 total number of mallocs used during MatSetValues calls=0 63 using I-node routines: found 49 nodes, limit used is 5 64 Split number 1 Fields 0, 1 65 KSP Object: (fieldsplit_1_) 1 MPI processes 66 type: preonly 67 maximum iterations=10000, initial guess is zero 68 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 69 left preconditioning 70 using NONE norm type for convergence test 71 PC Object: (fieldsplit_1_) 1 MPI processes 72 type: lu 73 out-of-place factorization 74 tolerance for zero pivot 2.22045e-14 75 matrix ordering: nd 76 factor fill ratio given 5., needed 2.5576 77 Factored matrix follows: 78 Mat Object: 1 MPI processes 79 type: seqaij 80 rows=196, cols=196, bs=2 81 package used to perform factorization: petsc 82 total: nonzeros=8880, allocated nonzeros=8880 83 total number of mallocs used during MatSetValues calls=0 84 using I-node routines: found 49 nodes, limit used is 5 85 linear system matrix = precond matrix: 86 Mat Object: (fieldsplit_1_) 1 MPI processes 87 type: seqaij 88 rows=196, cols=196, bs=2 89 total: nonzeros=3472, allocated nonzeros=3472 90 total number of mallocs used during MatSetValues calls=0 91 using I-node routines: found 49 nodes, limit used is 5 92 linear system matrix = precond matrix: 93 Mat Object: 1 MPI processes 94 type: seqaij 95 rows=196, cols=196, bs=4 96 total: nonzeros=3472, allocated nonzeros=3472 97 total number of mallocs used during MatSetValues calls=0 98 using I-node routines: found 49 nodes, limit used is 5 99Number of SNES iterations = 2 100