xref: /petsc/src/snes/tutorials/output/ex40f90_1.out (revision 70646cd191a02c3aba559ba717dac5da7a8a1e20)
165ca196fSBarry Smith  0 SNES Function norm 26.8701
265ca196fSBarry Smith  1 SNES Function norm 6.71751
365ca196fSBarry Smith  2 SNES Function norm 0.186598
465ca196fSBarry Smith  3 SNES Function norm 0.000161417
565ca196fSBarry Smith  4 SNES Function norm 1.212e-10
68cc725e6SPierre JolivetSNES Object: 1 MPI process
7c4762a1bSJed Brown  type: newtonls
8c4762a1bSJed Brown  maximum iterations=50, maximum function evaluations=10000
9c4762a1bSJed Brown  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
10c4762a1bSJed Brown  total number of linear solver iterations=4
1165ca196fSBarry Smith  total number of function evaluations=5
12c4762a1bSJed Brown  norm schedule ALWAYS
13c4762a1bSJed Brown  Jacobian is built using colored finite differences on a DMDA
148cc725e6SPierre Jolivet  SNESLineSearch Object: 1 MPI process
15c4762a1bSJed Brown    type: bt
16c4762a1bSJed Brown      interpolation: cubic
17c4762a1bSJed Brown      alpha=1.000000e-04
18a99ef635SJonas Heinzmann    maxlambda=1.000000e+00, minlambda=1.000000e-12
19c4762a1bSJed Brown    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
20c4762a1bSJed Brown    maximum iterations=40
218cc725e6SPierre Jolivet  KSP Object: 1 MPI process
22c4762a1bSJed Brown    type: fgmres
23f971d498SPierre Jolivet      restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
24*143f2514SPierre Jolivet      happy breakdown tolerance=1e-30
25c4762a1bSJed Brown    maximum iterations=10000, initial guess is zero
26c4762a1bSJed Brown    tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
27c4762a1bSJed Brown    right preconditioning
28c4762a1bSJed Brown    using UNPRECONDITIONED norm type for convergence test
298cc725e6SPierre Jolivet  PC Object: 1 MPI process
30c4762a1bSJed Brown    type: mg
31c4762a1bSJed Brown      type is FULL, levels=2 cycles=v
32c4762a1bSJed Brown        Using Galerkin computed coarse grid matrices for pmat
3363a3b9bcSJacob Faibussowitsch    Coarse grid solver -- level 0 -------------------------------
348cc725e6SPierre Jolivet      KSP Object: (mg_coarse_) 1 MPI process
35c4762a1bSJed Brown        type: preonly
36c4762a1bSJed Brown        maximum iterations=10000, initial guess is zero
37c4762a1bSJed Brown        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
38c4762a1bSJed Brown        left preconditioning
398405740aSBarry Smith        not checking for convergence
408cc725e6SPierre Jolivet      PC Object: (mg_coarse_) 1 MPI process
41c4762a1bSJed Brown        type: lu
42c4762a1bSJed Brown          out-of-place factorization
438405740aSBarry Smith          tolerance for zero pivot 2.22045e-14
44c4762a1bSJed Brown          using diagonal shift on blocks to prevent zero pivot [INBLOCKS]
45c4762a1bSJed Brown          matrix ordering: nd
46c4762a1bSJed Brown          factor fill ratio given 5., needed 2.38265
47ecf3d421SBarry Smith            Factored matrix:
4826cc229bSBarry Smith              Mat Object: (mg_coarse_) 1 MPI process
49c4762a1bSJed Brown                type: seqaij
50c4762a1bSJed Brown                rows=200, cols=200, bs=2
51c4762a1bSJed Brown                package used to perform factorization: petsc
52c4762a1bSJed Brown                total: nonzeros=7472, allocated nonzeros=7472
53c4762a1bSJed Brown                  using I-node routines: found 82 nodes, limit used is 5
54ecf3d421SBarry Smith        linear system matrix, which is also used to construct the preconditioner:
5526cc229bSBarry Smith        Mat Object: 1 MPI process
56c4762a1bSJed Brown          type: seqaij
57c4762a1bSJed Brown          rows=200, cols=200, bs=2
58cbc6b225SStefano Zampini          total: nonzeros=3136, allocated nonzeros=3136
59c4762a1bSJed Brown          total number of mallocs used during MatSetValues calls=0
60c4762a1bSJed Brown            using I-node routines: found 100 nodes, limit used is 5
61c4762a1bSJed Brown    Down solver (pre-smoother) on level 1 -------------------------------
628cc725e6SPierre Jolivet      KSP Object: (mg_levels_1_) 1 MPI process
63c4762a1bSJed Brown        type: chebyshev
64f2edd1f0SMalachi Phillips          Chebyshev polynomial of first kind
6573f7197eSJed Brown          eigenvalue targets used: min 0.1, max 1.1
6673f7197eSJed Brown          eigenvalues estimated via gmres: min 1., max 1.
6773f7197eSJed Brown          eigenvalues estimated using gmres with transform: [0. 0.1; 0. 1.1]
688cc725e6SPierre Jolivet          KSP Object: (mg_levels_1_esteig_) 1 MPI process
69c4762a1bSJed Brown            type: gmres
70f971d498SPierre Jolivet              restart=30, using classical (unmodified) Gram-Schmidt orthogonalization with no iterative refinement
71*143f2514SPierre Jolivet              happy breakdown tolerance=1e-30
72c4762a1bSJed Brown            maximum iterations=10, initial guess is zero
73c4762a1bSJed Brown            tolerances: relative=1e-12, absolute=1e-50, divergence=10000.
74c4762a1bSJed Brown            left preconditioning
75c4762a1bSJed Brown            using PRECONDITIONED norm type for convergence test
76dd8e379bSPierre Jolivet          estimating eigenvalues using a noisy random number generated right-hand side
77c4762a1bSJed Brown        maximum iterations=2, nonzero initial guess
78c4762a1bSJed Brown        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
79c4762a1bSJed Brown        left preconditioning
808405740aSBarry Smith        not checking for convergence
818cc725e6SPierre Jolivet      PC Object: (mg_levels_1_) 1 MPI process
82c4762a1bSJed Brown        type: sor
83c4762a1bSJed Brown          type = local_symmetric, iterations = 1, local iterations = 1, omega = 1.
84ecf3d421SBarry Smith        linear system matrix, which is also used to construct the preconditioner:
858cc725e6SPierre Jolivet        Mat Object: 1 MPI process
86c4762a1bSJed Brown          type: seqaij
87c4762a1bSJed Brown          rows=722, cols=722, bs=2
88c4762a1bSJed Brown          total: nonzeros=12100, allocated nonzeros=12100
89c4762a1bSJed Brown          total number of mallocs used during MatSetValues calls=0
90c4762a1bSJed Brown            using I-node routines: found 361 nodes, limit used is 5
91c4762a1bSJed Brown    Up solver (post-smoother) same as down solver (pre-smoother)
92ecf3d421SBarry Smith    linear system matrix, which is also used to construct the preconditioner:
938cc725e6SPierre Jolivet    Mat Object: 1 MPI process
94c4762a1bSJed Brown      type: seqaij
95c4762a1bSJed Brown      rows=722, cols=722, bs=2
96c4762a1bSJed Brown      total: nonzeros=12100, allocated nonzeros=12100
97c4762a1bSJed Brown      total number of mallocs used during MatSetValues calls=0
98c4762a1bSJed Brown        using I-node routines: found 361 nodes, limit used is 5
99