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