1. petsc
  2. PETSc
  3. petsc

Source

petsc / src / snes / examples / tutorials / output / ex40f90.out

  0 SNES Function norm 53.7401 
  1 SNES Function norm 21.1059 
  2 SNES Function norm 1.48792 
  3 SNES Function norm 0.0100219 
  4 SNES Function norm 4.69213e-07 
SNES Object: 1 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
  total number of linear solver iterations=4
  total number of function evaluations=22
  SNESLineSearch Object:   1 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxstep=1.000000e+08, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object:   1 MPI processes
    type: fgmres
      GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      GMRES: happy breakdown tolerance 1e-30
    maximum iterations=10000, initial guess is zero
    tolerances:  relative=1e-05, absolute=1e-50, divergence=10000
    right preconditioning
    using UNPRECONDITIONED norm type for convergence test
  PC Object:   1 MPI processes
    type: mg
      MG: type is FULL, levels=2 cycles=v
        Using Galerkin computed coarse grid matrices
    Coarse grid solver -- level -------------------------------
      KSP Object:      (mg_coarse_)       1 MPI processes
        type: preonly
        maximum iterations=1, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000
        left preconditioning
        using NONE norm type for convergence test
      PC Object:      (mg_coarse_)       1 MPI processes
        type: lu
          LU: out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          using diagonal shift on blocks to prevent zero pivot
          matrix ordering: nd
          factor fill ratio given 5, needed 2.38265
            Factored matrix follows:
              Matrix Object:               1 MPI processes
                type: seqaij
                rows=200, cols=200
                package used to perform factorization: petsc
                total: nonzeros=7472, allocated nonzeros=7472
                total number of mallocs used during MatSetValues calls =0
                  using I-node routines: found 82 nodes, limit used is 5
        linear system matrix = precond matrix:
        Matrix Object:         1 MPI processes
          type: seqaij
          rows=200, cols=200
          total: nonzeros=3136, allocated nonzeros=0
          total number of mallocs used during MatSetValues calls =0
            using I-node routines: found 100 nodes, limit used is 5
    Down solver (pre-smoother) on level 1 -------------------------------
      KSP Object:      (mg_levels_1_)       1 MPI processes
        type: chebyshev
          Chebyshev: eigenvalue estimates:  min = 0.327737, max = 3.60511
          Chebyshev: estimated using:  [0 0.1; 0 1.1]
          KSP Object:          (mg_levels_1_est_)           1 MPI processes
            type: gmres
              GMRES: restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
              GMRES: happy breakdown tolerance 1e-30
            maximum iterations=10
            tolerances:  relative=1e-05, absolute=1e-50, divergence=10000
            left preconditioning
            using nonzero initial guess
            using NONE norm type for convergence test
          PC Object:          (mg_levels_1_)           1 MPI processes
            type: sor
              SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1
            linear system matrix = precond matrix:
            Matrix Object:             1 MPI processes
              type: seqaij
              rows=722, cols=722, bs=2
              total: nonzeros=12100, allocated nonzeros=12100
              total number of mallocs used during MatSetValues calls =0
                using I-node routines: found 361 nodes, limit used is 5
        maximum iterations=2
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000
        left preconditioning
        using nonzero initial guess
        using NONE norm type for convergence test
      PC Object:      (mg_levels_1_)       1 MPI processes
        type: sor
          SOR: type = local_symmetric, iterations = 1, local iterations = 1, omega = 1
        linear system matrix = precond matrix:
        Matrix Object:         1 MPI processes
          type: seqaij
          rows=722, cols=722, bs=2
          total: nonzeros=12100, allocated nonzeros=12100
          total number of mallocs used during MatSetValues calls =0
            using I-node routines: found 361 nodes, limit used is 5
    Up solver (post-smoother) same as down solver (pre-smoother)
    linear system matrix = precond matrix:
    Matrix Object:     1 MPI processes
      type: seqaij
      rows=722, cols=722, bs=2
      total: nonzeros=12100, allocated nonzeros=12100
      total number of mallocs used during MatSetValues calls =0
        using I-node routines: found 361 nodes, limit used is 5