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