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