1KSP Object: 1 MPI processes 2 type: gmres 3 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 4 happy breakdown tolerance 1e-30 5 maximum iterations=10000, initial guess is zero 6 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 7 left preconditioning 8 using PRECONDITIONED norm type for convergence test 9PC Object: 1 MPI processes 10 type: asm 11 total subdomain blocks = 1, amount of overlap = 1 12 restriction/interpolation type - RESTRICT 13 Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0: 14 KSP Object: (sub_) 1 MPI processes 15 type: preonly 16 maximum iterations=10000, initial guess is zero 17 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 18 left preconditioning 19 using NONE norm type for convergence test 20 PC Object: (sub_) 1 MPI processes 21 type: ilu 22 out-of-place factorization 23 0 levels of fill 24 tolerance for zero pivot 2.22045e-14 25 matrix ordering: natural 26 factor fill ratio given 1., needed 1. 27 Factored matrix follows: 28 Mat Object: 1 MPI processes 29 type: seqaijcusparse 30 rows=64, cols=64 31 package used to perform factorization: cusparse 32 total: nonzeros=288, allocated nonzeros=288 33 not using I-node routines 34 linear system matrix = precond matrix: 35 Mat Object: (sub_) 1 MPI processes 36 type: seqaijcusparse 37 rows=64, cols=64 38 total: nonzeros=288, allocated nonzeros=288 39 total number of mallocs used during MatSetValues calls=0 40 not using I-node routines 41 linear system matrix = precond matrix: 42 Mat Object: 1 MPI processes 43 type: seqaijcusparse 44 rows=64, cols=64 45 total: nonzeros=288, allocated nonzeros=320 46 total number of mallocs used during MatSetValues calls=0 47 not using I-node routines 48Infinity norm of the error: 1.30446e-06 49