1*c4762a1bSJed Brown 0 SNES Function norm 14.5309 2*c4762a1bSJed Brown 0 KSP Residual norm 18.0889 3*c4762a1bSJed Brown 1 KSP Residual norm 0.985108 4*c4762a1bSJed Brown 2 KSP Residual norm 0.119912 5*c4762a1bSJed Brown 3 KSP Residual norm 0.00306439 6*c4762a1bSJed Brown 4 KSP Residual norm 0.000310043 7*c4762a1bSJed Brown 5 KSP Residual norm 9.96095e-06 8*c4762a1bSJed Brown 6 KSP Residual norm 5.3834e-07 9*c4762a1bSJed Brown 7 KSP Residual norm 7.3847e-08 10*c4762a1bSJed Brown 8 KSP Residual norm 2.7968e-09 11*c4762a1bSJed Brown 1 SNES Function norm 5.15304e-09 12*c4762a1bSJed BrownSNES Object: 5 MPI processes 13*c4762a1bSJed Brown type: newtonls 14*c4762a1bSJed Brown maximum iterations=50, maximum function evaluations=10000 15*c4762a1bSJed Brown tolerances: relative=1e-08, absolute=1e-50, solution=1e-08 16*c4762a1bSJed Brown total number of linear solver iterations=8 17*c4762a1bSJed Brown total number of function evaluations=2 18*c4762a1bSJed Brown norm schedule ALWAYS 19*c4762a1bSJed Brown SNESLineSearch Object: 5 MPI processes 20*c4762a1bSJed Brown type: bt 21*c4762a1bSJed Brown interpolation: cubic 22*c4762a1bSJed Brown alpha=1.000000e-04 23*c4762a1bSJed Brown maxstep=1.000000e+08, minlambda=1.000000e-12 24*c4762a1bSJed Brown tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08 25*c4762a1bSJed Brown maximum iterations=40 26*c4762a1bSJed Brown KSP Object: 5 MPI processes 27*c4762a1bSJed Brown type: gmres 28*c4762a1bSJed Brown restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 29*c4762a1bSJed Brown happy breakdown tolerance 1e-30 30*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 31*c4762a1bSJed Brown tolerances: relative=1e-09, absolute=1e-50, divergence=10000. 32*c4762a1bSJed Brown left preconditioning 33*c4762a1bSJed Brown using PRECONDITIONED norm type for convergence test 34*c4762a1bSJed Brown PC Object: 5 MPI processes 35*c4762a1bSJed Brown type: bddc 36*c4762a1bSJed Brown Use verbose output: 0 37*c4762a1bSJed Brown Use user-defined CSR: 0 38*c4762a1bSJed Brown Use local mat graph: 1 39*c4762a1bSJed Brown Connectivity graph topological dimension: 2 40*c4762a1bSJed Brown Use vertices: 1 (vertex size 1) 41*c4762a1bSJed Brown Use edges: 0 42*c4762a1bSJed Brown Use faces: 0 43*c4762a1bSJed Brown Use true near null space: 0 44*c4762a1bSJed Brown Use QR for single constraints on cc: 0 45*c4762a1bSJed Brown Use change of basis on local edge nodes: 0 46*c4762a1bSJed Brown Use change of basis on local face nodes: 0 47*c4762a1bSJed Brown User defined change of basis matrix: 0 48*c4762a1bSJed Brown Has change of basis matrix: 0 49*c4762a1bSJed Brown Eliminate dirichlet boundary dofs: 0 50*c4762a1bSJed Brown Switch on static condensation ops around the interface preconditioner: 0 51*c4762a1bSJed Brown Use exact dirichlet trick: 0 52*c4762a1bSJed Brown Interface extension: DIRICHLET 53*c4762a1bSJed Brown Multilevel max levels: 0 54*c4762a1bSJed Brown Multilevel coarsening ratio: 8 55*c4762a1bSJed Brown Use estimated eigs for coarse problem: 0 56*c4762a1bSJed Brown Use deluxe scaling: 0 57*c4762a1bSJed Brown Use deluxe zerorows: 0 58*c4762a1bSJed Brown Use deluxe singlemat: 0 59*c4762a1bSJed Brown Rebuild interface graph for Schur principal minors: 0 60*c4762a1bSJed Brown Number of dofs' layers for the computation of principal minors: -1 61*c4762a1bSJed Brown Use user CSR graph to compute successive layers: 0 62*c4762a1bSJed Brown Adaptive constraint selection threshold (active 0, userdefined 0): 0. 63*c4762a1bSJed Brown Min constraints / connected component: 0 64*c4762a1bSJed Brown Max constraints / connected component: 0 65*c4762a1bSJed Brown Invert exact Schur complement for adaptive selection: 0 66*c4762a1bSJed Brown Symmetric computation of primal basis functions: 1 67*c4762a1bSJed Brown Num. Procs. to map coarse adjacency list: 0 68*c4762a1bSJed Brown Coarse eqs per proc (significant at the coarsest level): 1 69*c4762a1bSJed Brown Detect disconnected: 0 (filter 0) 70*c4762a1bSJed Brown Benign subspace trick: 0 (change explicit 0) 71*c4762a1bSJed Brown Benign subspace trick is active: 0 72*c4762a1bSJed Brown Algebraic computation of no-net-flux: 0 73*c4762a1bSJed Brown ********************************** STATISTICS AT LEVEL 0 ********************************** 74*c4762a1bSJed Brown Global dofs sizes: all 529 interface 67 coarse 10 75*c4762a1bSJed Brown Coarsening ratios: all/coarse 52 interface/coarse 6 76*c4762a1bSJed Brown Active processes : 5 77*c4762a1bSJed Brown Total subdomains : 5 78*c4762a1bSJed Brown Dofs type : MIN MAX MEAN 79*c4762a1bSJed Brown Interior dofs : 49 105 92 80*c4762a1bSJed Brown Interface dofs : 15 39 27 81*c4762a1bSJed Brown Primal dofs : 3 7 4 82*c4762a1bSJed Brown Local dofs : 64 144 120 83*c4762a1bSJed Brown Local subs : 1 1 84*c4762a1bSJed Brown --- Interior solver (rank 0) 85*c4762a1bSJed Brown KSP Object: (pc_bddc_dirichlet_) 1 MPI processes 86*c4762a1bSJed Brown type: preonly 87*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 88*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 89*c4762a1bSJed Brown left preconditioning 90*c4762a1bSJed Brown using NONE norm type for convergence test 91*c4762a1bSJed Brown PC Object: (pc_bddc_dirichlet_) 1 MPI processes 92*c4762a1bSJed Brown type: lu 93*c4762a1bSJed Brown out-of-place factorization 94*c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 95*c4762a1bSJed Brown matrix ordering: nd 96*c4762a1bSJed Brown factor fill ratio given 5., needed 1.54071 97*c4762a1bSJed Brown Factored matrix follows: 98*c4762a1bSJed Brown Mat Object: 1 MPI processes 99*c4762a1bSJed Brown type: seqaij 100*c4762a1bSJed Brown rows=105, cols=105 101*c4762a1bSJed Brown package used to perform factorization: petsc 102*c4762a1bSJed Brown total: nonzeros=1949, allocated nonzeros=1949 103*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 104*c4762a1bSJed Brown not using I-node routines 105*c4762a1bSJed Brown linear system matrix = precond matrix: 106*c4762a1bSJed Brown Mat Object: (pc_bddc_dirichlet_) 1 MPI processes 107*c4762a1bSJed Brown type: seqaij 108*c4762a1bSJed Brown rows=105, cols=105 109*c4762a1bSJed Brown total: nonzeros=1265, allocated nonzeros=1265 110*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 111*c4762a1bSJed Brown not using I-node routines 112*c4762a1bSJed Brown --- Correction solver (rank 0) 113*c4762a1bSJed Brown KSP Object: (pc_bddc_neumann_) 1 MPI processes 114*c4762a1bSJed Brown type: preonly 115*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 116*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 117*c4762a1bSJed Brown left preconditioning 118*c4762a1bSJed Brown using NONE norm type for convergence test 119*c4762a1bSJed Brown PC Object: (pc_bddc_neumann_) 1 MPI processes 120*c4762a1bSJed Brown type: lu 121*c4762a1bSJed Brown out-of-place factorization 122*c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 123*c4762a1bSJed Brown matrix ordering: nd 124*c4762a1bSJed Brown factor fill ratio given 5., needed 1.52481 125*c4762a1bSJed Brown Factored matrix follows: 126*c4762a1bSJed Brown Mat Object: 1 MPI processes 127*c4762a1bSJed Brown type: seqaij 128*c4762a1bSJed Brown rows=124, cols=124 129*c4762a1bSJed Brown package used to perform factorization: petsc 130*c4762a1bSJed Brown total: nonzeros=2458, allocated nonzeros=2458 131*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 132*c4762a1bSJed Brown not using I-node routines 133*c4762a1bSJed Brown linear system matrix = precond matrix: 134*c4762a1bSJed Brown Mat Object: (pc_bddc_neumann_) 1 MPI processes 135*c4762a1bSJed Brown type: seqaij 136*c4762a1bSJed Brown rows=124, cols=124 137*c4762a1bSJed Brown total: nonzeros=1612, allocated nonzeros=1612 138*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 139*c4762a1bSJed Brown not using I-node routines 140*c4762a1bSJed Brown --- Coarse solver 141*c4762a1bSJed Brown KSP Object: (pc_bddc_coarse_) 5 MPI processes 142*c4762a1bSJed Brown type: preonly 143*c4762a1bSJed Brown maximum iterations=1, initial guess is zero 144*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 145*c4762a1bSJed Brown left preconditioning 146*c4762a1bSJed Brown using NONE norm type for convergence test 147*c4762a1bSJed Brown PC Object: (pc_bddc_coarse_) 5 MPI processes 148*c4762a1bSJed Brown type: redundant 149*c4762a1bSJed Brown First (color=0) of 5 PCs follows 150*c4762a1bSJed Brown linear system matrix = precond matrix: 151*c4762a1bSJed Brown Mat Object: (pc_bddc_coarse_) 5 MPI processes 152*c4762a1bSJed Brown type: mpiaij 153*c4762a1bSJed Brown rows=10, cols=10 154*c4762a1bSJed Brown total: nonzeros=80, allocated nonzeros=92 155*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 156*c4762a1bSJed Brown using I-node (on process 0) routines: found 1 nodes, limit used is 5 157*c4762a1bSJed Brown KSP Object: (pc_bddc_coarse_redundant_) 1 MPI processes 158*c4762a1bSJed Brown type: preonly 159*c4762a1bSJed Brown maximum iterations=10000, initial guess is zero 160*c4762a1bSJed Brown tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 161*c4762a1bSJed Brown left preconditioning 162*c4762a1bSJed Brown using NONE norm type for convergence test 163*c4762a1bSJed Brown PC Object: (pc_bddc_coarse_redundant_) 1 MPI processes 164*c4762a1bSJed Brown type: lu 165*c4762a1bSJed Brown out-of-place factorization 166*c4762a1bSJed Brown tolerance for zero pivot 2.22045e-14 167*c4762a1bSJed Brown matrix ordering: nd 168*c4762a1bSJed Brown factor fill ratio given 5., needed 1.175 169*c4762a1bSJed Brown Factored matrix follows: 170*c4762a1bSJed Brown Mat Object: 1 MPI processes 171*c4762a1bSJed Brown type: seqaij 172*c4762a1bSJed Brown rows=10, cols=10 173*c4762a1bSJed Brown package used to perform factorization: petsc 174*c4762a1bSJed Brown total: nonzeros=94, allocated nonzeros=94 175*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 176*c4762a1bSJed Brown using I-node routines: found 4 nodes, limit used is 5 177*c4762a1bSJed Brown linear system matrix = precond matrix: 178*c4762a1bSJed Brown Mat Object: 1 MPI processes 179*c4762a1bSJed Brown type: seqaij 180*c4762a1bSJed Brown rows=10, cols=10 181*c4762a1bSJed Brown total: nonzeros=80, allocated nonzeros=80 182*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 183*c4762a1bSJed Brown using I-node routines: found 7 nodes, limit used is 5 184*c4762a1bSJed Brown linear system matrix = precond matrix: 185*c4762a1bSJed Brown Mat Object: 5 MPI processes 186*c4762a1bSJed Brown type: is 187*c4762a1bSJed Brown rows=529, cols=529 188*c4762a1bSJed Brown total: nonzeros=7832, allocated nonzeros=8924 189*c4762a1bSJed Brown total number of mallocs used during MatSetValues calls=0 190