[petsc-users] Fwd: Fieldsplit with sub pc MUMPS in parallel
Karin&NiKo
niko.karin at gmail.com
Wed Jan 4 15:39:44 CST 2017
Dear Petsc team,
I am (still) trying to solve Biot's poroelasticity problem :
[image: Images intégrées 1]
I am using a mixed P2-P1 finite element discretization. The matrix of the
discretized system in binary format is attached to this email.
I am using the fieldsplit framework to solve the linear system. Since I am
facing some troubles, I have decided to go back to simple things. Here are
the options I am using :
-ksp_rtol 1.0e-5
-ksp_type fgmres
-pc_type fieldsplit
-pc_fieldsplit_schur_factorization_type full
-pc_fieldsplit_type schur
-pc_fieldsplit_schur_precondition selfp
-fieldsplit_0_pc_type lu
-fieldsplit_0_pc_factor_mat_solver_package mumps
-fieldsplit_0_ksp_type preonly
-fieldsplit_0_ksp_converged_reason
-fieldsplit_1_pc_type lu
-fieldsplit_1_pc_factor_mat_solver_package mumps
-fieldsplit_1_ksp_type preonly
-fieldsplit_1_ksp_converged_reason
On a single proc, everything runs fine : the solver converges in 3
iterations, according to the theory (see Run-1-proc.txt [contains
-log_view]).
On 2 procs, the solver converges in 28 iterations (see Run-2-proc.txt).
On 3 procs, the solver converges in 91 iterations (see Run-3-proc.txt).
I do not understand this behavior : since MUMPS is a parallel direct
solver, shouldn't the solver converge in max 3 iterations whatever the
number of procs?
Thanks for your precious help,
Nicolas
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20170104/5acf8079/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image.png
Type: image/png
Size: 9086 bytes
Desc: not available
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20170104/5acf8079/attachment-0001.png>
-------------- next part --------------
0 KSP unpreconditioned resid norm 2.375592557658e+10 true resid norm 2.375592557658e+10 ||r(i)||/||b|| 1.000000000000e+00
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
1 KSP unpreconditioned resid norm 6.196553125161e+04 true resid norm 6.196553125161e+04 ||r(i)||/||b|| 2.608424203547e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
2 KSP unpreconditioned resid norm 2.675633869591e+03 true resid norm 2.675633869591e+03 ||r(i)||/||b|| 1.126301671962e-07
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=1000, initial guess is zero
tolerances: relative=1e-06, absolute=1e-50, divergence=10000.
right preconditioning
using UNPRECONDITIONED norm type for convergence test
PC Object: 1 MPI processes
type: fieldsplit
FieldSplit with Schur preconditioner, factorization FULL
Preconditioner for the Schur complement formed from Sp, an assembled approximation to S, which uses (lumped, if requested) A00's diagonal's inverse
Split info:
Split number 0 Defined by IS
Split number 1 Defined by IS
KSP solver for A00 block
KSP Object: (fieldsplit_0_) 1 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 1 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: nd
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 1 MPI processes
type: seqaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=140616, allocated nonzeros=140616
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 0
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 0
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 1.99982e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 153549.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 1.99982e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 3
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 3
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 624
RINFOG(1) (global estimated flops for the elimination after analysis): 1.99982e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 153549.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.99982e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 140616
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 4995
INFOG(5) (estimated maximum front size in the complete tree): 252
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 140616
INFOG(10) (total integer space store the matrix factors after factorization): 4995
INFOG(11) (order of largest frontal matrix after factorization): 252
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 3
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 3
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 3
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 3
INFOG(20) (estimated number of entries in the factors): 140616
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 3
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 3
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 140616
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 2
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 1 MPI processes
type: seqaij
rows=624, cols=624
total: nonzeros=68940, allocated nonzeros=68940
total number of mallocs used during MatSetValues calls =0
using I-node routines: found 208 nodes, limit used is 5
KSP solver for S = A11 - A10 inv(A00) A01
KSP Object: (fieldsplit_1_) 1 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_1_) 1 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: nd
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 1 MPI processes
type: seqaij
rows=64, cols=64
package used to perform factorization: mumps
total: nonzeros=3584, allocated nonzeros=3584
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 0
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 0
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 123808.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 1024.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 123808.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 64
RINFOG(1) (global estimated flops for the elimination after analysis): 123808.
RINFOG(2) (global estimated flops for the assembly after factorization): 1024.
RINFOG(3) (global estimated flops for the elimination after factorization): 123808.
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 3584
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 222
INFOG(5) (estimated maximum front size in the complete tree): 48
INFOG(6) (number of nodes in the complete tree): 2
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 3584
INFOG(10) (total integer space store the matrix factors after factorization): 222
INFOG(11) (order of largest frontal matrix after factorization): 48
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 1
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 1
INFOG(20) (estimated number of entries in the factors): 3584
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 1
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 3584
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix followed by preconditioner matrix:
Mat Object: (fieldsplit_1_) 1 MPI processes
type: schurcomplement
rows=64, cols=64
Schur complement A11 - A10 inv(A00) A01
A11
Mat Object: (fieldsplit_1_) 1 MPI processes
type: seqaij
rows=64, cols=64
total: nonzeros=1000, allocated nonzeros=1000
total number of mallocs used during MatSetValues calls =0
not using I-node routines
A10
Mat Object: 1 MPI processes
type: seqaij
rows=64, cols=624
total: nonzeros=8400, allocated nonzeros=8400
total number of mallocs used during MatSetValues calls =0
not using I-node routines
KSP of A00
KSP Object: (fieldsplit_0_) 1 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 1 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: nd
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 1 MPI processes
type: seqaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=140616, allocated nonzeros=140616
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 0
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 0
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 1.99982e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 153549.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 1.99982e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 3
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 3
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 624
RINFOG(1) (global estimated flops for the elimination after analysis): 1.99982e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 153549.
RINFOG(3) (global estimated flops for the elimination after factorization): 1.99982e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 140616
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 4995
INFOG(5) (estimated maximum front size in the complete tree): 252
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 140616
INFOG(10) (total integer space store the matrix factors after factorization): 4995
INFOG(11) (order of largest frontal matrix after factorization): 252
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 3
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 3
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 3
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 3
INFOG(20) (estimated number of entries in the factors): 140616
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 3
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 3
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 140616
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 2
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 1 MPI processes
type: seqaij
rows=624, cols=624
total: nonzeros=68940, allocated nonzeros=68940
total number of mallocs used during MatSetValues calls =0
using I-node routines: found 208 nodes, limit used is 5
A01
Mat Object: 1 MPI processes
type: seqaij
rows=624, cols=64
total: nonzeros=8400, allocated nonzeros=8400
total number of mallocs used during MatSetValues calls =0
using I-node routines: found 208 nodes, limit used is 5
Mat Object: 1 MPI processes
type: seqaij
rows=64, cols=64
total: nonzeros=2744, allocated nonzeros=2744
total number of mallocs used during MatSetValues calls =0
using I-node routines: found 28 nodes, limit used is 5
linear system matrix = precond matrix:
Mat Object: 1 MPI processes
type: seqaij
rows=688, cols=688
total: nonzeros=86740, allocated nonzeros=86740
total number of mallocs used during MatSetValues calls =0
using I-node routines: found 208 nodes, limit used is 5
************************************************************************************************************************
*** WIDEN YOUR WINDOW TO 120 CHARACTERS. Use 'enscript -r -fCourier9' to print this document ***
************************************************************************************************************************
---------------------------------------------- PETSc Performance Summary: ----------------------------------------------
on a arch-linux2-c-debug named dsp0780450 with 1 processor, by B07947 Wed Jan 4 22:21:05 2017
Using Petsc Release Version 3.7.2, Jun, 05, 2016
Max Max/Min Avg Total
Time (sec): 1.568e-01 1.00000 1.568e-01
Objects: 7.000e+01 1.00000 7.000e+01
Flops: 1.231e+06 1.00000 1.231e+06 1.231e+06
Flops/sec: 7.847e+06 1.00000 7.847e+06 7.847e+06
Memory: 3.043e+06 1.00000 3.043e+06
MPI Messages: 0.000e+00 0.00000 0.000e+00 0.000e+00
MPI Message Lengths: 0.000e+00 0.00000 0.000e+00 0.000e+00
MPI Reductions: 0.000e+00 0.00000
Flop counting convention: 1 flop = 1 real number operation of type (multiply/divide/add/subtract)
e.g., VecAXPY() for real vectors of length N --> 2N flops
and VecAXPY() for complex vectors of length N --> 8N flops
Summary of Stages: ----- Time ------ ----- Flops ----- --- Messages --- -- Message Lengths -- -- Reductions --
Avg %Total Avg %Total counts %Total Avg %Total counts %Total
0: Main Stage: 1.5683e-01 100.0% 1.2308e+06 100.0% 0.000e+00 0.0% 0.000e+00 0.0% 0.000e+00 0.0%
------------------------------------------------------------------------------------------------------------------------
See the 'Profiling' chapter of the users' manual for details on interpreting output.
Phase summary info:
Count: number of times phase was executed
Time and Flops: Max - maximum over all processors
Ratio - ratio of maximum to minimum over all processors
Mess: number of messages sent
Avg. len: average message length (bytes)
Reduct: number of global reductions
Global: entire computation
Stage: stages of a computation. Set stages with PetscLogStagePush() and PetscLogStagePop().
%T - percent time in this phase %F - percent flops in this phase
%M - percent messages in this phase %L - percent message lengths in this phase
%R - percent reductions in this phase
Total Mflop/s: 10e-6 * (sum of flops over all processors)/(max time over all processors)
------------------------------------------------------------------------------------------------------------------------
##########################################################
# #
# WARNING!!! #
# #
# This code was compiled with a debugging option, #
# To get timing results run ./configure #
# using --with-debugging=no, the performance will #
# be generally two or three times faster. #
# #
##########################################################
Event Count Time (sec) Flops --- Global --- --- Stage --- Total
Max Ratio Max Ratio Max Ratio Mess Avg len Reduct %T %F %M %L %R %T %F %M %L %R Mflop/s
------------------------------------------------------------------------------------------------------------------------
--- Event Stage 0: Main Stage
VecMDot 2 1.0 1.0014e-05 1.0 4.12e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 412
VecNorm 7 1.0 2.7895e-05 1.0 9.63e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 1 0 0 0 0 1 0 0 0 345
VecScale 5 1.0 3.2425e-04 1.0 2.19e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 7
VecCopy 10 1.0 4.2439e-05 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecSet 29 1.0 9.0361e-05 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecAXPY 5 1.0 1.9193e-04 1.0 6.62e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 1 0 0 0 0 1 0 0 0 35
VecAYPX 3 1.0 1.9312e-05 1.0 2.06e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 107
VecMAXPY 5 1.0 3.5524e-05 1.0 1.10e+04 1.0 0.0e+00 0.0e+00 0.0e+00 0 1 0 0 0 0 1 0 0 0 310
VecScatterBegin 9 1.0 5.2929e-05 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatMult 9 1.0 1.1399e-03 1.0 9.30e+05 1.0 0.0e+00 0.0e+00 0.0e+00 1 76 0 0 0 1 76 0 0 0 816
MatSolve 6 1.0 1.6625e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatLUFactorSym 2 1.0 2.3232e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatLUFactorNum 2 1.0 7.0572e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 4 0 0 0 0 4 0 0 0 0 0
MatConvert 1 1.0 1.1921e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatScale 2 1.0 9.2983e-05 1.0 1.11e+04 1.0 0.0e+00 0.0e+00 0.0e+00 0 1 0 0 0 0 1 0 0 0 120
MatAssemblyBegin 8 1.0 9.7752e-06 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatAssemblyEnd 8 1.0 4.3797e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetRow 128 1.0 1.3161e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetRowIJ 2 1.0 1.7309e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetSubMatrice 4 1.0 6.2459e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 4 0 0 0 0 4 0 0 0 0 0
MatGetOrdering 2 1.0 8.4996e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatView 6 1.0 2.7837e-02 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 18 0 0 0 0 18 0 0 0 0 0
MatAXPY 1 1.0 6.2799e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatMatMult 1 1.0 1.5202e-03 1.0 2.54e+05 1.0 0.0e+00 0.0e+00 0.0e+00 1 21 0 0 0 1 21 0 0 0 167
MatMatMultSym 1 1.0 8.8406e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatMatMultNum 1 1.0 6.2108e-04 1.0 2.54e+05 1.0 0.0e+00 0.0e+00 0.0e+00 0 21 0 0 0 0 21 0 0 0 409
KSPGMRESOrthog 2 1.0 5.2691e-05 1.0 8.25e+03 1.0 0.0e+00 0.0e+00 0.0e+00 0 1 0 0 0 0 1 0 0 0 157
KSPSetUp 3 1.0 1.8287e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
KSPSolve 1 1.0 1.5977e-02 1.0 9.65e+05 1.0 0.0e+00 0.0e+00 0.0e+00 10 78 0 0 0 10 78 0 0 0 60
PCSetUp 3 1.0 2.1162e-02 1.0 2.65e+05 1.0 0.0e+00 0.0e+00 0.0e+00 13 22 0 0 0 13 22 0 0 0 13
PCApply 2 1.0 1.4143e-02 1.0 6.84e+04 1.0 0.0e+00 0.0e+00 0.0e+00 9 6 0 0 0 9 6 0 0 0 5
KSPSolve_FS_0 2 1.0 1.0471e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
KSPSolve_FS_Schu 2 1.0 1.9639e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
KSPSolve_FS_Low 2 1.0 1.0584e-02 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 7 0 0 0 0 7 0 0 0 0 0
------------------------------------------------------------------------------------------------------------------------
Memory usage is given in bytes:
Object Type Creations Destructions Memory Descendants' Mem.
Reports information only for process 0.
--- Event Stage 0: Main Stage
Vector 26 26 172600 0.
Vector Scatter 3 3 1992 0.
Matrix 11 11 2316912 0.
Krylov Solver 5 5 24280 0.
Preconditioner 5 5 4840 0.
Index Set 15 13 17584 0.
Viewer 1 0 0 0.
Distributed Mesh 1 1 4624 0.
Star Forest Bipartite Graph 2 2 1616 0.
Discrete System 1 1 872 0.
========================================================================================================================
Average time to get PetscTime(): 9.53674e-08
#PETSc Option Table entries:
-fieldsplit_0_ksp_converged_reason
-fieldsplit_0_ksp_type preonly
-fieldsplit_0_pc_factor_mat_solver_package mumps
-fieldsplit_0_pc_type lu
-fieldsplit_1_ksp_converged_reason
-fieldsplit_1_ksp_type preonly
-fieldsplit_1_pc_factor_mat_solver_package mumps
-fieldsplit_1_pc_type lu
-ksp_rtol 1.0e-5
-ksp_type fgmres
-ksp_view
-log_summary
-pc_fieldsplit_schur_factorization_type full
-pc_fieldsplit_schur_precondition selfp
-pc_fieldsplit_type schur
-pc_type fieldsplit
#End of PETSc Option Table entries
Compiled without FORTRAN kernels
Compiled with full precision matrices (default)
sizeof(short) 2 sizeof(int) 4 sizeof(long) 8 sizeof(void*) 8 sizeof(PetscScalar) 8 sizeof(PetscInt) 4
Configure options: --prefix=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install --with-mpi=yes --with-x=yes --download-ml=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/ml-6.2-p3.tar.gz --with-mumps-lib="-L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp " --with-mumps-include=/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include --with-scalapack-lib="-L/usr/lib -lscalapack-openmpi" --with-blacs-lib="-L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi" --with-blas-lib="-L/usr/lib -lopenblas -lcblas" --with-lapack-lib="-L/usr/lib -llapack"
-----------------------------------------
Libraries compiled on Wed Nov 30 11:59:58 2016 on dsp0780450
Machine characteristics: Linux-3.16.0-4-amd64-x86_64-with-debian-8.6
Using PETSc directory: /home/B07947/dev/codeaster-prerequisites/petsc-3.7.2
Using PETSc arch: arch-linux2-c-debug
-----------------------------------------
Using C compiler: mpicc -fPIC -Wall -Wwrite-strings -Wno-strict-aliasing -Wno-unknown-pragmas -fvisibility=hidden -g3 ${COPTFLAGS} ${CFLAGS}
Using Fortran compiler: mpif90 -fPIC -Wall -ffree-line-length-0 -Wno-unused-dummy-argument -g ${FOPTFLAGS} ${FFLAGS}
-----------------------------------------
Using include paths: -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/include -I/usr/lib/openmpi/include -I/usr/lib/openmpi/include/openmpi
-----------------------------------------
Using C linker: mpicc
Using Fortran linker: mpif90
Using libraries: -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -lpetsc -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -lml -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -lmpi_cxx -lstdc++ -lscalapack-openmpi -llapack -lopenblas -lcblas -lX11 -lssl -lcrypto -lm -lmpi_f90 -lmpi_f77 -lgfortran -lm -lgfortran -lm -lquadmath -lm -lmpi_cxx -lstdc++ -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -ldl -lmpi -lhwloc -lgcc_s -lpthread -ldl
-----------------------------------------
-------------- next part --------------
0 KSP unpreconditioned resid norm 2.375592557658e+10 true resid norm 2.375592557658e+10 ||r(i)||/||b|| 1.000000000000e+00
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
1 KSP unpreconditioned resid norm 1.303564177055e+10 true resid norm 1.303564177055e+10 ||r(i)||/||b|| 5.487322196112e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
2 KSP unpreconditioned resid norm 1.071183507871e+10 true resid norm 1.071183507871e+10 ||r(i)||/||b|| 4.509121332352e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
3 KSP unpreconditioned resid norm 1.055458147519e+10 true resid norm 1.055458147519e+10 ||r(i)||/||b|| 4.442925804412e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
4 KSP unpreconditioned resid norm 6.525228688268e+09 true resid norm 6.525228688268e+09 ||r(i)||/||b|| 2.746779394991e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
5 KSP unpreconditioned resid norm 3.448826301973e+09 true resid norm 3.448826301973e+09 ||r(i)||/||b|| 1.451775175358e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
6 KSP unpreconditioned resid norm 2.198988275290e+09 true resid norm 2.198988275290e+09 ||r(i)||/||b|| 9.256588501262e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
7 KSP unpreconditioned resid norm 2.004030973880e+09 true resid norm 2.004030973880e+09 ||r(i)||/||b|| 8.435920408237e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
8 KSP unpreconditioned resid norm 1.484494627562e+09 true resid norm 1.484494627562e+09 ||r(i)||/||b|| 6.248944596060e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
9 KSP unpreconditioned resid norm 1.349414519794e+09 true resid norm 1.349414519794e+09 ||r(i)||/||b|| 5.680328116218e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
10 KSP unpreconditioned resid norm 1.261837655142e+09 true resid norm 1.261837655142e+09 ||r(i)||/||b|| 5.311675401045e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
11 KSP unpreconditioned resid norm 9.178806138105e+08 true resid norm 9.178806138106e+08 ||r(i)||/||b|| 3.863796469861e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
12 KSP unpreconditioned resid norm 5.407955744874e+08 true resid norm 5.407955744874e+08 ||r(i)||/||b|| 2.276466024210e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
13 KSP unpreconditioned resid norm 5.265237838393e+08 true resid norm 5.265237838393e+08 ||r(i)||/||b|| 2.216389263142e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
14 KSP unpreconditioned resid norm 3.590262609540e+08 true resid norm 3.590262609540e+08 ||r(i)||/||b|| 1.511312450431e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
15 KSP unpreconditioned resid norm 1.793849911732e+08 true resid norm 1.793849911732e+08 ||r(i)||/||b|| 7.551168258837e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
16 KSP unpreconditioned resid norm 1.434526359423e+08 true resid norm 1.434526359423e+08 ||r(i)||/||b|| 6.038604367567e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
17 KSP unpreconditioned resid norm 1.236301089463e+08 true resid norm 1.236301089464e+08 ||r(i)||/||b|| 5.204179839167e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
18 KSP unpreconditioned resid norm 6.088689145868e+07 true resid norm 6.088689145872e+07 ||r(i)||/||b|| 2.563019119691e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
19 KSP unpreconditioned resid norm 3.931575158104e+07 true resid norm 3.931575158114e+07 ||r(i)||/||b|| 1.654987150654e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
20 KSP unpreconditioned resid norm 3.835858071661e+07 true resid norm 3.835858071665e+07 ||r(i)||/||b|| 1.614695272259e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
21 KSP unpreconditioned resid norm 2.077211508217e+07 true resid norm 2.077211508226e+07 ||r(i)||/||b|| 8.743972115632e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
22 KSP unpreconditioned resid norm 8.335358693348e+06 true resid norm 8.335358693410e+06 ||r(i)||/||b|| 3.508749287221e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
23 KSP unpreconditioned resid norm 2.472991237989e+06 true resid norm 2.472991238011e+06 ||r(i)||/||b|| 1.040999741323e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
24 KSP unpreconditioned resid norm 6.209407637559e+05 true resid norm 6.209407637614e+05 ||r(i)||/||b|| 2.613835279791e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
25 KSP unpreconditioned resid norm 1.765314903856e+05 true resid norm 1.765314903114e+05 ||r(i)||/||b|| 7.431050823187e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
26 KSP unpreconditioned resid norm 4.334232432165e+04 true resid norm 4.334232435112e+04 ||r(i)||/||b|| 1.824484767449e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
27 KSP unpreconditioned resid norm 1.788850623345e+04 true resid norm 1.788850627330e+04 ||r(i)||/||b|| 7.530123890830e-07
KSP Object: 2 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=1000, initial guess is zero
tolerances: relative=1e-06, absolute=1e-50, divergence=10000.
right preconditioning
using UNPRECONDITIONED norm type for convergence test
PC Object: 2 MPI processes
type: fieldsplit
FieldSplit with Schur preconditioner, factorization FULL
Preconditioner for the Schur complement formed from Sp, an assembled approximation to S, which uses (lumped, if requested) A00's diagonal's inverse
Split info:
Split number 0 Defined by IS
Split number 1 Defined by IS
KSP solver for A00 block
KSP Object: (fieldsplit_0_) 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=146498, allocated nonzeros=146498
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 1.51255e+07
[1] 6.89106e+06
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 87833.
[1] 72313.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 1.51255e+07
[1] 6.89106e+06
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 8
[1] 8
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 8
[1] 8
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 413
[1] 211
RINFOG(1) (global estimated flops for the elimination after analysis): 2.20165e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 160146.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.20165e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 146498
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 5065
INFOG(5) (estimated maximum front size in the complete tree): 263
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 146498
INFOG(10) (total integer space store the matrix factors after factorization): 5065
INFOG(11) (order of largest frontal matrix after factorization): 263
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 8
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 16
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 8
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 16
INFOG(20) (estimated number of entries in the factors): 146498
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 8
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 15
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 146498
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 3
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 2 MPI processes
type: mpiaij
rows=624, cols=624
total: nonzeros=73470, allocated nonzeros=73470
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 112 nodes, limit used is 5
KSP solver for S = A11 - A10 inv(A00) A01
KSP Object: (fieldsplit_1_) 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_1_) 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=64, cols=64
package used to perform factorization: mumps
total: nonzeros=3038, allocated nonzeros=3038
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 71763.
[1] 15274.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 1205.
[1] 256.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 71763.
[1] 15274.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 52
[1] 12
RINFOG(1) (global estimated flops for the elimination after analysis): 87037.
RINFOG(2) (global estimated flops for the assembly after factorization): 1461.
RINFOG(3) (global estimated flops for the elimination after factorization): 87037.
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 3038
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 318
INFOG(5) (estimated maximum front size in the complete tree): 45
INFOG(6) (number of nodes in the complete tree): 4
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 3038
INFOG(10) (total integer space store the matrix factors after factorization): 318
INFOG(11) (order of largest frontal matrix after factorization): 45
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 2
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 2
INFOG(20) (estimated number of entries in the factors): 3038
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 2
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 3038
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix followed by preconditioner matrix:
Mat Object: (fieldsplit_1_) 2 MPI processes
type: schurcomplement
rows=64, cols=64
Schur complement A11 - A10 inv(A00) A01
A11
Mat Object: (fieldsplit_1_) 2 MPI processes
type: mpiaij
rows=64, cols=64
total: nonzeros=1110, allocated nonzeros=1110
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
A10
Mat Object: 2 MPI processes
type: mpiaij
rows=64, cols=624
total: nonzeros=6080, allocated nonzeros=6080
total number of mallocs used during MatSetValues calls =0
not using I-node (on process 0) routines
KSP of A00
KSP Object: (fieldsplit_0_) 2 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 2 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 2 MPI processes
type: mpiaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=146498, allocated nonzeros=146498
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 1.51255e+07
[1] 6.89106e+06
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 87833.
[1] 72313.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 1.51255e+07
[1] 6.89106e+06
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 8
[1] 8
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 8
[1] 8
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 413
[1] 211
RINFOG(1) (global estimated flops for the elimination after analysis): 2.20165e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 160146.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.20165e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 146498
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 5065
INFOG(5) (estimated maximum front size in the complete tree): 263
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 146498
INFOG(10) (total integer space store the matrix factors after factorization): 5065
INFOG(11) (order of largest frontal matrix after factorization): 263
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 8
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 16
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 8
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 16
INFOG(20) (estimated number of entries in the factors): 146498
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 8
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 15
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 146498
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 2, 3
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 2 MPI processes
type: mpiaij
rows=624, cols=624
total: nonzeros=73470, allocated nonzeros=73470
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 112 nodes, limit used is 5
A01
Mat Object: 2 MPI processes
type: mpiaij
rows=624, cols=64
total: nonzeros=6080, allocated nonzeros=6080
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 111 nodes, limit used is 5
Mat Object: 2 MPI processes
type: mpiaij
rows=64, cols=64
total: nonzeros=2846, allocated nonzeros=2846
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 37 nodes, limit used is 5
linear system matrix = precond matrix:
Mat Object: 2 MPI processes
type: mpiaij
rows=688, cols=688
total: nonzeros=86740, allocated nonzeros=94187
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 117 nodes, limit used is 5
************************************************************************************************************************
*** WIDEN YOUR WINDOW TO 120 CHARACTERS. Use 'enscript -r -fCourier9' to print this document ***
************************************************************************************************************************
---------------------------------------------- PETSc Performance Summary: ----------------------------------------------
on a arch-linux2-c-debug named dsp0780450 with 2 processors, by B07947 Wed Jan 4 22:23:35 2017
Using Petsc Release Version 3.7.2, Jun, 05, 2016
Max Max/Min Avg Total
Time (sec): 3.263e-01 1.00000 3.263e-01
Objects: 2.620e+02 1.00769 2.610e+02
Flops: 7.742e+06 1.75026 6.083e+06 1.217e+07
Flops/sec: 2.372e+07 1.75027 1.864e+07 3.728e+07
Memory: 3.540e+06 1.24844 6.376e+06
MPI Messages: 4.890e+02 1.00411 4.880e+02 9.760e+02
MPI Message Lengths: 1.677e+06 1.01260 3.415e+03 3.333e+06
MPI Reductions: 1.975e+03 1.00000
Flop counting convention: 1 flop = 1 real number operation of type (multiply/divide/add/subtract)
e.g., VecAXPY() for real vectors of length N --> 2N flops
and VecAXPY() for complex vectors of length N --> 8N flops
Summary of Stages: ----- Time ------ ----- Flops ----- --- Messages --- -- Message Lengths -- -- Reductions --
Avg %Total Avg %Total counts %Total Avg %Total counts %Total
0: Main Stage: 3.2632e-01 100.0% 1.2165e+07 100.0% 9.760e+02 100.0% 3.415e+03 100.0% 1.973e+03 99.9%
------------------------------------------------------------------------------------------------------------------------
See the 'Profiling' chapter of the users' manual for details on interpreting output.
Phase summary info:
Count: number of times phase was executed
Time and Flops: Max - maximum over all processors
Ratio - ratio of maximum to minimum over all processors
Mess: number of messages sent
Avg. len: average message length (bytes)
Reduct: number of global reductions
Global: entire computation
Stage: stages of a computation. Set stages with PetscLogStagePush() and PetscLogStagePop().
%T - percent time in this phase %F - percent flops in this phase
%M - percent messages in this phase %L - percent message lengths in this phase
%R - percent reductions in this phase
Total Mflop/s: 10e-6 * (sum of flops over all processors)/(max time over all processors)
------------------------------------------------------------------------------------------------------------------------
##########################################################
# #
# WARNING!!! #
# #
# This code was compiled with a debugging option, #
# To get timing results run ./configure #
# using --with-debugging=no, the performance will #
# be generally two or three times faster. #
# #
##########################################################
Event Count Time (sec) Flops --- Global --- --- Stage --- Total
Max Ratio Max Ratio Max Ratio Mess Avg len Reduct %T %F %M %L %R %T %F %M %L %R Mflop/s
------------------------------------------------------------------------------------------------------------------------
--- Event Stage 0: Main Stage
VecMDot 27 1.0 3.4330e-03 4.2 3.07e+05 1.4 0.0e+00 0.0e+00 5.4e+01 1 4 0 0 3 1 4 0 0 3 151
VecNorm 57 1.0 4.5562e-04 1.2 4.63e+04 1.4 0.0e+00 0.0e+00 1.1e+02 0 1 0 0 6 0 1 0 0 6 172
VecScale 55 1.0 6.2103e-03 1.1 1.31e+04 1.7 0.0e+00 0.0e+00 0.0e+00 2 0 0 0 0 2 0 0 0 0 3
VecCopy 29 1.0 1.5283e-04 1.1 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecSet 121 1.0 4.5204e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecAXPY 55 1.0 3.2640e-03 1.0 4.12e+04 1.3 0.0e+00 0.0e+00 0.0e+00 1 1 0 0 0 1 1 0 0 0 22
VecAYPX 28 1.0 1.8382e-04 1.1 1.14e+04 1.4 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 105
VecMAXPY 55 1.0 1.5895e-03 1.2 6.36e+05 1.4 0.0e+00 0.0e+00 0.0e+00 0 9 0 0 0 0 9 0 0 0 678
VecAssemblyBegin 1 1.0 5.9128e-05 1.0 0.00e+00 0.0 2.0e+00 1.0e+03 6.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecAssemblyEnd 1 1.0 1.0014e-05 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecScatterBegin 379 1.0 2.6152e-03 1.1 0.00e+00 0.0 3.0e+02 1.8e+03 8.1e+01 1 0 31 16 4 1 0 31 16 4 0
VecScatterEnd 298 1.0 2.0123e-03 1.5 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatMult 109 1.0 1.4856e-02 1.4 6.46e+06 1.8 1.6e+02 1.3e+03 0.0e+00 4 83 17 7 0 4 83 17 7 0 683
MatSolve 81 1.0 3.3831e-02 1.0 0.00e+00 0.0 1.4e+02 2.4e+03 9.5e+01 10 0 14 10 5 10 0 14 10 5 0
MatLUFactorSym 2 1.0 4.2470e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 1.6e+01 1 0 0 0 1 1 0 0 0 1 0
MatLUFactorNum 2 1.0 9.1913e-02 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 28 0 0 0 0 28 0 0 0 0 0
MatConvert 1 1.0 4.1819e-04 1.1 0.00e+00 0.0 0.0e+00 0.0e+00 4.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatScale 2 1.0 2.6798e-04 1.2 8.40e+0316.1 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 33
MatAssemblyBegin 14 1.0 3.8922e-03 3.9 0.00e+00 0.0 3.0e+00 9.5e+04 3.2e+01 1 0 0 9 2 1 0 0 9 2 0
MatAssemblyEnd 14 1.0 1.0869e-02 1.0 0.00e+00 0.0 1.2e+01 3.3e+02 1.6e+02 3 0 1 0 8 3 0 1 0 8 0
MatGetRow 128 0.0 2.7323e-04 0.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetRowIJ 2 2.0 3.8147e-06 2.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetSubMatrix 4 1.0 4.1627e-02 1.0 0.00e+00 0.0 8.0e+00 2.9e+02 1.8e+02 13 0 1 0 9 13 0 1 0 9 0
MatGetOrdering 2 2.0 4.3321e-04 1.7 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatView 6 1.0 1.7805e-02 1.4 0.00e+00 0.0 7.2e+01 2.1e+03 1.8e+01 5 0 7 4 1 5 0 7 4 1 0
MatAXPY 1 1.0 1.7102e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 3.7e+01 1 0 0 0 2 1 0 0 0 2 0
MatMatMult 1 1.0 5.5580e-03 1.0 2.20e+05 0.0 4.0e+00 2.8e+03 3.7e+01 2 2 0 0 2 2 2 0 0 2 40
MatMatMultSym 1 1.0 4.2591e-03 1.0 0.00e+00 0.0 3.0e+00 2.3e+03 3.3e+01 1 0 0 0 2 1 0 0 0 2 0
MatMatMultNum 1 1.0 1.2820e-03 1.0 2.20e+05 0.0 1.0e+00 4.2e+03 4.0e+00 0 2 0 0 0 0 2 0 0 0 171
MatGetLocalMat 2 1.0 3.0327e-04 1.7 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetBrAoCol 2 1.0 4.1389e-04 1.0 0.00e+00 0.0 4.0e+00 2.8e+03 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
KSPGMRESOrthog 27 1.0 4.7998e-03 2.1 6.13e+05 1.4 0.0e+00 0.0e+00 4.3e+02 1 9 0 0 22 1 9 0 0 22 217
KSPSetUp 3 1.0 3.2687e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 1.0e+01 0 0 0 0 1 0 0 0 0 1 0
KSPSolve 1 1.0 1.8870e-01 1.0 7.51e+06 1.7 3.0e+02 1.8e+03 1.5e+03 58 98 31 16 77 58 98 31 16 77 63
PCSetUp 3 1.0 1.5060e-01 1.0 2.28e+05436.0 1.8e+01 1.1e+03 3.8e+02 46 2 2 1 19 46 2 2 1 19 2
PCApply 27 1.0 1.6088e-01 1.0 6.38e+0514.7 2.0e+02 1.9e+03 4.3e+02 49 6 20 11 22 49 6 20 11 22 4
KSPSolve_FS_0 27 1.0 1.9183e-02 1.1 0.00e+00 0.0 5.4e+01 3.0e+03 1.1e+02 6 0 6 5 5 6 0 6 5 5 0
KSPSolve_FS_Schu 27 1.0 3.1643e-02 1.1 0.00e+00 0.0 2.9e+01 3.3e+02 1.5e+02 9 0 3 0 7 9 0 3 0 7 0
KSPSolve_FS_Low 27 1.0 1.0088e-01 1.0 0.00e+00 0.0 5.8e+01 2.8e+03 1.5e+02 31 0 6 5 7 31 0 6 5 7 0
------------------------------------------------------------------------------------------------------------------------
Memory usage is given in bytes:
Object Type Creations Destructions Memory Descendants' Mem.
Reports information only for process 0.
--- Event Stage 0: Main Stage
Vector 154 154 692384 0.
Vector Scatter 14 14 19448 0.
Matrix 37 37 2353112 0.
Index Set 42 40 39600 0.
Krylov Solver 5 5 24280 0.
Preconditioner 5 5 4840 0.
Viewer 1 0 0 0.
Distributed Mesh 1 1 4624 0.
Star Forest Bipartite Graph 2 2 1616 0.
Discrete System 1 1 872 0.
========================================================================================================================
Average time to get PetscTime(): 9.53674e-08
Average time for MPI_Barrier(): 6.19888e-07
Average time for zero size MPI_Send(): 1.43051e-06
#PETSc Option Table entries:
-fieldsplit_0_ksp_converged_reason
-fieldsplit_0_ksp_type preonly
-fieldsplit_0_pc_factor_mat_solver_package mumps
-fieldsplit_0_pc_type lu
-fieldsplit_1_ksp_converged_reason
-fieldsplit_1_ksp_type preonly
-fieldsplit_1_pc_factor_mat_solver_package mumps
-fieldsplit_1_pc_type lu
-ksp_rtol 1.0e-5
-ksp_type fgmres
-ksp_view
-log_summary
-pc_fieldsplit_schur_factorization_type full
-pc_fieldsplit_schur_precondition selfp
-pc_fieldsplit_type schur
-pc_type fieldsplit
#End of PETSc Option Table entries
Compiled without FORTRAN kernels
Compiled with full precision matrices (default)
sizeof(short) 2 sizeof(int) 4 sizeof(long) 8 sizeof(void*) 8 sizeof(PetscScalar) 8 sizeof(PetscInt) 4
Configure options: --prefix=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install --with-mpi=yes --with-x=yes --download-ml=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/ml-6.2-p3.tar.gz --with-mumps-lib="-L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp " --with-mumps-include=/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include --with-scalapack-lib="-L/usr/lib -lscalapack-openmpi" --with-blacs-lib="-L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi" --with-blas-lib="-L/usr/lib -lopenblas -lcblas" --with-lapack-lib="-L/usr/lib -llapack"
-----------------------------------------
Libraries compiled on Wed Nov 30 11:59:58 2016 on dsp0780450
Machine characteristics: Linux-3.16.0-4-amd64-x86_64-with-debian-8.6
Using PETSc directory: /home/B07947/dev/codeaster-prerequisites/petsc-3.7.2
Using PETSc arch: arch-linux2-c-debug
-----------------------------------------
Using C compiler: mpicc -fPIC -Wall -Wwrite-strings -Wno-strict-aliasing -Wno-unknown-pragmas -fvisibility=hidden -g3 ${COPTFLAGS} ${CFLAGS}
Using Fortran compiler: mpif90 -fPIC -Wall -ffree-line-length-0 -Wno-unused-dummy-argument -g ${FOPTFLAGS} ${FFLAGS}
-----------------------------------------
Using include paths: -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/include -I/usr/lib/openmpi/include -I/usr/lib/openmpi/include/openmpi
-----------------------------------------
Using C linker: mpicc
Using Fortran linker: mpif90
Using libraries: -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -lpetsc -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -lml -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -lmpi_cxx -lstdc++ -lscalapack-openmpi -llapack -lopenblas -lcblas -lX11 -lssl -lcrypto -lm -lmpi_f90 -lmpi_f77 -lgfortran -lm -lgfortran -lm -lquadmath -lm -lmpi_cxx -lstdc++ -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -ldl -lmpi -lhwloc -lgcc_s -lpthread -ldl
-----------------------------------------
-------------- next part --------------
0 KSP unpreconditioned resid norm 2.375592557658e+10 true resid norm 2.375592557658e+10 ||r(i)||/||b|| 1.000000000000e+00
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
1 KSP unpreconditioned resid norm 2.354387765268e+10 true resid norm 2.354387765268e+10 ||r(i)||/||b|| 9.910738934074e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
2 KSP unpreconditioned resid norm 7.565226261144e+09 true resid norm 7.565226261144e+09 ||r(i)||/||b|| 3.184563883548e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
3 KSP unpreconditioned resid norm 7.046563779272e+09 true resid norm 7.046563779272e+09 ||r(i)||/||b|| 2.966234153478e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
4 KSP unpreconditioned resid norm 6.712061059639e+09 true resid norm 6.712061059639e+09 ||r(i)||/||b|| 2.825426034445e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
5 KSP unpreconditioned resid norm 4.119098261045e+09 true resid norm 4.119098261045e+09 ||r(i)||/||b|| 1.733924551905e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
6 KSP unpreconditioned resid norm 4.093786883357e+09 true resid norm 4.093786883357e+09 ||r(i)||/||b|| 1.723269788062e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
7 KSP unpreconditioned resid norm 2.519521928135e+09 true resid norm 2.519521928135e+09 ||r(i)||/||b|| 1.060586723937e-01
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
8 KSP unpreconditioned resid norm 2.373916289395e+09 true resid norm 2.373916289395e+09 ||r(i)||/||b|| 9.992943788879e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
9 KSP unpreconditioned resid norm 2.092596303640e+09 true resid norm 2.092596303640e+09 ||r(i)||/||b|| 8.808734043616e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
10 KSP unpreconditioned resid norm 2.075761860693e+09 true resid norm 2.075761860693e+09 ||r(i)||/||b|| 8.737869859045e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
11 KSP unpreconditioned resid norm 1.710779772940e+09 true resid norm 1.710779772940e+09 ||r(i)||/||b|| 7.201486498286e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
12 KSP unpreconditioned resid norm 1.648406379841e+09 true resid norm 1.648406379841e+09 ||r(i)||/||b|| 6.938927193247e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
13 KSP unpreconditioned resid norm 1.168410200806e+09 true resid norm 1.168410200806e+09 ||r(i)||/||b|| 4.918394768662e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
14 KSP unpreconditioned resid norm 1.166360451836e+09 true resid norm 1.166360451836e+09 ||r(i)||/||b|| 4.909766399445e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
15 KSP unpreconditioned resid norm 8.277208864954e+08 true resid norm 8.277208864951e+08 ||r(i)||/||b|| 3.484271256141e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
16 KSP unpreconditioned resid norm 8.276908129860e+08 true resid norm 8.276908129857e+08 ||r(i)||/||b|| 3.484144662423e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
17 KSP unpreconditioned resid norm 6.225378714956e+08 true resid norm 6.225378714955e+08 ||r(i)||/||b|| 2.620558266562e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
18 KSP unpreconditioned resid norm 5.761996033674e+08 true resid norm 5.761996033668e+08 ||r(i)||/||b|| 2.425498436208e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
19 KSP unpreconditioned resid norm 4.207038617987e+08 true resid norm 4.207038617981e+08 ||r(i)||/||b|| 1.770942834629e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
20 KSP unpreconditioned resid norm 3.481124393225e+08 true resid norm 3.481124393216e+08 ||r(i)||/||b|| 1.465370979546e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
21 KSP unpreconditioned resid norm 3.417301046733e+08 true resid norm 3.417301046727e+08 ||r(i)||/||b|| 1.438504694633e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
22 KSP unpreconditioned resid norm 2.567284390162e+08 true resid norm 2.567284390162e+08 ||r(i)||/||b|| 1.080692217984e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
23 KSP unpreconditioned resid norm 2.564957247063e+08 true resid norm 2.564957247063e+08 ||r(i)||/||b|| 1.079712612668e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
24 KSP unpreconditioned resid norm 2.418470506609e+08 true resid norm 2.418470506610e+08 ||r(i)||/||b|| 1.018049369962e-02
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
25 KSP unpreconditioned resid norm 1.561397633279e+08 true resid norm 1.561397633288e+08 ||r(i)||/||b|| 6.572665957613e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
26 KSP unpreconditioned resid norm 1.559442432818e+08 true resid norm 1.559442432828e+08 ||r(i)||/||b|| 6.564435588086e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
27 KSP unpreconditioned resid norm 7.736290224512e+07 true resid norm 7.736290224773e+07 ||r(i)||/||b|| 3.256572849513e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
28 KSP unpreconditioned resid norm 5.012849210895e+07 true resid norm 5.012849211088e+07 ||r(i)||/||b|| 2.110146874694e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
29 KSP unpreconditioned resid norm 4.745677367047e+07 true resid norm 4.745677367368e+07 ||r(i)||/||b|| 1.997681526687e-03
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
30 KSP unpreconditioned resid norm 2.290461197130e+07 true resid norm 2.290461197130e+07 ||r(i)||/||b|| 9.641641575896e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
31 KSP unpreconditioned resid norm 2.222737485540e+07 true resid norm 2.222737485540e+07 ||r(i)||/||b|| 9.356560233254e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
32 KSP unpreconditioned resid norm 2.201309723363e+07 true resid norm 2.201309723363e+07 ||r(i)||/||b|| 9.266360581351e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
33 KSP unpreconditioned resid norm 2.194874591650e+07 true resid norm 2.194874591650e+07 ||r(i)||/||b|| 9.239272048461e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
34 KSP unpreconditioned resid norm 2.128835019268e+07 true resid norm 2.128835019267e+07 ||r(i)||/||b|| 8.961280049498e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
35 KSP unpreconditioned resid norm 2.120111549764e+07 true resid norm 2.120111549764e+07 ||r(i)||/||b|| 8.924558813461e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
36 KSP unpreconditioned resid norm 1.976723092962e+07 true resid norm 1.976723092962e+07 ||r(i)||/||b|| 8.320968537262e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
37 KSP unpreconditioned resid norm 1.944717353711e+07 true resid norm 1.944717353711e+07 ||r(i)||/||b|| 8.186241144095e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
38 KSP unpreconditioned resid norm 1.903474216858e+07 true resid norm 1.903474216858e+07 ||r(i)||/||b|| 8.012629146873e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
39 KSP unpreconditioned resid norm 1.898023583422e+07 true resid norm 1.898023583422e+07 ||r(i)||/||b|| 7.989684835911e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
40 KSP unpreconditioned resid norm 1.694730587985e+07 true resid norm 1.694730587985e+07 ||r(i)||/||b|| 7.133927838434e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
41 KSP unpreconditioned resid norm 1.638896360821e+07 true resid norm 1.638896360821e+07 ||r(i)||/||b|| 6.898894995852e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
42 KSP unpreconditioned resid norm 1.519868139235e+07 true resid norm 1.519868139236e+07 ||r(i)||/||b|| 6.397848546613e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
43 KSP unpreconditioned resid norm 1.435025731851e+07 true resid norm 1.435025731851e+07 ||r(i)||/||b|| 6.040706463847e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
44 KSP unpreconditioned resid norm 1.398045017059e+07 true resid norm 1.398045017059e+07 ||r(i)||/||b|| 5.885037030245e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
45 KSP unpreconditioned resid norm 9.779767739199e+06 true resid norm 9.779767739203e+06 ||r(i)||/||b|| 4.116769817146e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
46 KSP unpreconditioned resid norm 9.762980432404e+06 true resid norm 9.762980432407e+06 ||r(i)||/||b|| 4.109703240539e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
47 KSP unpreconditioned resid norm 8.724157152360e+06 true resid norm 8.724157152364e+06 ||r(i)||/||b|| 3.672413067738e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
48 KSP unpreconditioned resid norm 8.701406903245e+06 true resid norm 8.701406903245e+06 ||r(i)||/||b|| 3.662836404835e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
49 KSP unpreconditioned resid norm 7.415213990246e+06 true resid norm 7.415213990273e+06 ||r(i)||/||b|| 3.121416577253e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
50 KSP unpreconditioned resid norm 7.191611476981e+06 true resid norm 7.191611477012e+06 ||r(i)||/||b|| 3.027291634598e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
51 KSP unpreconditioned resid norm 5.811126704500e+06 true resid norm 5.811126704556e+06 ||r(i)||/||b|| 2.446179874501e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
52 KSP unpreconditioned resid norm 4.174772896367e+06 true resid norm 4.174772896381e+06 ||r(i)||/||b|| 1.757360656365e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
53 KSP unpreconditioned resid norm 4.033730917892e+06 true resid norm 4.033730917902e+06 ||r(i)||/||b|| 1.697989373177e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
54 KSP unpreconditioned resid norm 3.072328590301e+06 true resid norm 3.072328590311e+06 ||r(i)||/||b|| 1.293289364966e-04
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
55 KSP unpreconditioned resid norm 2.184704206300e+06 true resid norm 2.184704206347e+06 ||r(i)||/||b|| 9.196460055008e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
56 KSP unpreconditioned resid norm 2.087788381502e+06 true resid norm 2.087788381688e+06 ||r(i)||/||b|| 8.788495211261e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
57 KSP unpreconditioned resid norm 1.295154635850e+06 true resid norm 1.295154636297e+06 ||r(i)||/||b|| 5.451922435611e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
58 KSP unpreconditioned resid norm 1.293544515105e+06 true resid norm 1.293544515547e+06 ||r(i)||/||b|| 5.445144670860e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
59 KSP unpreconditioned resid norm 1.034191001856e+06 true resid norm 1.034191002189e+06 ||r(i)||/||b|| 4.353402265279e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
60 KSP unpreconditioned resid norm 8.496752472634e+05 true resid norm 8.496752472634e+05 ||r(i)||/||b|| 3.576687612210e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
61 KSP unpreconditioned resid norm 8.496711167836e+05 true resid norm 8.496711167853e+05 ||r(i)||/||b|| 3.576670225062e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
62 KSP unpreconditioned resid norm 8.482716981331e+05 true resid norm 8.482716981338e+05 ||r(i)||/||b|| 3.570779405750e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
63 KSP unpreconditioned resid norm 8.475428645046e+05 true resid norm 8.475428645056e+05 ||r(i)||/||b|| 3.567711398040e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
64 KSP unpreconditioned resid norm 8.465314549473e+05 true resid norm 8.465314549483e+05 ||r(i)||/||b|| 3.563453893722e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
65 KSP unpreconditioned resid norm 8.211742970257e+05 true resid norm 8.211742970257e+05 ||r(i)||/||b|| 3.456713544495e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
66 KSP unpreconditioned resid norm 8.199302190668e+05 true resid norm 8.199302190672e+05 ||r(i)||/||b|| 3.451476628112e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
67 KSP unpreconditioned resid norm 7.928265198998e+05 true resid norm 7.928265198998e+05 ||r(i)||/||b|| 3.337384255326e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
68 KSP unpreconditioned resid norm 7.879389590406e+05 true resid norm 7.879389590406e+05 ||r(i)||/||b|| 3.316810184897e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
69 KSP unpreconditioned resid norm 7.459634072370e+05 true resid norm 7.459634072382e+05 ||r(i)||/||b|| 3.140115104476e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
70 KSP unpreconditioned resid norm 7.257146826826e+05 true resid norm 7.257146826828e+05 ||r(i)||/||b|| 3.054878583212e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
71 KSP unpreconditioned resid norm 6.685588318458e+05 true resid norm 6.685588318459e+05 ||r(i)||/||b|| 2.814282397420e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
72 KSP unpreconditioned resid norm 6.124291328776e+05 true resid norm 6.124291328784e+05 ||r(i)||/||b|| 2.578005773356e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
73 KSP unpreconditioned resid norm 6.094795320798e+05 true resid norm 6.094795320799e+05 ||r(i)||/||b|| 2.565589499408e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
74 KSP unpreconditioned resid norm 5.357696539008e+05 true resid norm 5.357696539018e+05 ||r(i)||/||b|| 2.255309531825e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
75 KSP unpreconditioned resid norm 5.242423536496e+05 true resid norm 5.242423536500e+05 ||r(i)||/||b|| 2.206785637378e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
76 KSP unpreconditioned resid norm 3.951117863892e+05 true resid norm 3.951117863909e+05 ||r(i)||/||b|| 1.663213605874e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
77 KSP unpreconditioned resid norm 3.370805526075e+05 true resid norm 3.370805526076e+05 ||r(i)||/||b|| 1.418932516525e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
78 KSP unpreconditioned resid norm 3.130844272170e+05 true resid norm 3.130844272167e+05 ||r(i)||/||b|| 1.317921401157e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
79 KSP unpreconditioned resid norm 2.798298725063e+05 true resid norm 2.798298725051e+05 ||r(i)||/||b|| 1.177937149210e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
80 KSP unpreconditioned resid norm 2.379383176697e+05 true resid norm 2.379383176686e+05 ||r(i)||/||b|| 1.001595652005e-05
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
81 KSP unpreconditioned resid norm 2.174610490053e+05 true resid norm 2.174610490057e+05 ||r(i)||/||b|| 9.153970797925e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
82 KSP unpreconditioned resid norm 2.135469574287e+05 true resid norm 2.135469574286e+05 ||r(i)||/||b|| 8.989208050016e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
83 KSP unpreconditioned resid norm 1.169940105631e+05 true resid norm 1.169940105627e+05 ||r(i)||/||b|| 4.924834866383e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
84 KSP unpreconditioned resid norm 7.882375855358e+04 true resid norm 7.882375855376e+04 ||r(i)||/||b|| 3.318067245987e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
85 KSP unpreconditioned resid norm 7.804803294150e+04 true resid norm 7.804803294074e+04 ||r(i)||/||b|| 3.285413262015e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
86 KSP unpreconditioned resid norm 5.378742608807e+04 true resid norm 5.378742608692e+04 ||r(i)||/||b|| 2.264168824470e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
87 KSP unpreconditioned resid norm 3.900919284375e+04 true resid norm 3.900919284392e+04 ||r(i)||/||b|| 1.642082634001e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
88 KSP unpreconditioned resid norm 3.889074491459e+04 true resid norm 3.889074491442e+04 ||r(i)||/||b|| 1.637096596765e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
89 KSP unpreconditioned resid norm 2.953428329101e+04 true resid norm 2.953428328769e+04 ||r(i)||/||b|| 1.243238584516e-06
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_1_ solve converged due to CONVERGED_ITS iterations 1
Linear fieldsplit_0_ solve converged due to CONVERGED_ITS iterations 1
90 KSP unpreconditioned resid norm 2.172827479107e+04 true resid norm 2.172827478767e+04 ||r(i)||/||b|| 9.146465254586e-07
KSP Object: 3 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=1000, initial guess is zero
tolerances: relative=1e-06, absolute=1e-50, divergence=10000.
right preconditioning
using UNPRECONDITIONED norm type for convergence test
PC Object: 3 MPI processes
type: fieldsplit
FieldSplit with Schur preconditioner, factorization FULL
Preconditioner for the Schur complement formed from Sp, an assembled approximation to S, which uses (lumped, if requested) A00's diagonal's inverse
Split info:
Split number 0 Defined by IS
Split number 1 Defined by IS
KSP solver for A00 block
KSP Object: (fieldsplit_0_) 3 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 3 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 3 MPI processes
type: mpiaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=148148, allocated nonzeros=148148
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 4.02519e+06
[1] 2.70367e+06
[2] 1.62473e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 55439.
[1] 30276.
[2] 65773.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 4.02519e+06
[1] 2.70367e+06
[2] 1.62473e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 9
[1] 9
[2] 10
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 9
[1] 9
[2] 10
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 278
[1] 87
[2] 259
RINFOG(1) (global estimated flops for the elimination after analysis): 2.29761e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 151488.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.29761e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 148148
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 4993
INFOG(5) (estimated maximum front size in the complete tree): 286
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 148148
INFOG(10) (total integer space store the matrix factors after factorization): 4993
INFOG(11) (order of largest frontal matrix after factorization): 286
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 10
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 28
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 10
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 28
INFOG(20) (estimated number of entries in the factors): 148148
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 10
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 28
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 148148
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 1, 2
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 3 MPI processes
type: mpiaij
rows=624, cols=624
total: nonzeros=72004, allocated nonzeros=72004
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 84 nodes, limit used is 5
KSP solver for S = A11 - A10 inv(A00) A01
KSP Object: (fieldsplit_1_) 3 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_1_) 3 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 3 MPI processes
type: mpiaij
rows=64, cols=64
package used to perform factorization: mumps
total: nonzeros=3736, allocated nonzeros=3736
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 0.
[1] 0.
[2] 137244.
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 0.
[1] 0.
[2] 1225.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 0.
[1] 0.
[2] 137244.
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 1
[1] 1
[2] 1
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 1
[1] 1
[2] 1
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 0
[1] 0
[2] 64
RINFOG(1) (global estimated flops for the elimination after analysis): 137244.
RINFOG(2) (global estimated flops for the assembly after factorization): 1225.
RINFOG(3) (global estimated flops for the elimination after factorization): 137244.
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 3736
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 228
INFOG(5) (estimated maximum front size in the complete tree): 55
INFOG(6) (number of nodes in the complete tree): 2
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 3736
INFOG(10) (total integer space store the matrix factors after factorization): 228
INFOG(11) (order of largest frontal matrix after factorization): 55
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 1
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 3
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 1
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 3
INFOG(20) (estimated number of entries in the factors): 3736
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 1
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 3
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 3736
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 0, 0
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix followed by preconditioner matrix:
Mat Object: (fieldsplit_1_) 3 MPI processes
type: schurcomplement
rows=64, cols=64
Schur complement A11 - A10 inv(A00) A01
A11
Mat Object: (fieldsplit_1_) 3 MPI processes
type: mpiaij
rows=64, cols=64
total: nonzeros=1498, allocated nonzeros=1498
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 49 nodes, limit used is 5
A10
Mat Object: 3 MPI processes
type: mpiaij
rows=64, cols=624
total: nonzeros=6619, allocated nonzeros=6619
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 49 nodes, limit used is 5
KSP of A00
KSP Object: (fieldsplit_0_) 3 MPI processes
type: preonly
maximum iterations=10000, initial guess is zero
tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
left preconditioning
using NONE norm type for convergence test
PC Object: (fieldsplit_0_) 3 MPI processes
type: lu
LU: out-of-place factorization
tolerance for zero pivot 2.22045e-14
matrix ordering: natural
factor fill ratio given 0., needed 0.
Factored matrix follows:
Mat Object: 3 MPI processes
type: mpiaij
rows=624, cols=624
package used to perform factorization: mumps
total: nonzeros=148148, allocated nonzeros=148148
total number of mallocs used during MatSetValues calls =0
MUMPS run parameters:
SYM (matrix type): 0
PAR (host participation): 1
ICNTL(1) (output for error): 6
ICNTL(2) (output of diagnostic msg): 0
ICNTL(3) (output for global info): 0
ICNTL(4) (level of printing): 0
ICNTL(5) (input mat struct): 0
ICNTL(6) (matrix prescaling): 7
ICNTL(7) (sequentia matrix ordering):7
ICNTL(8) (scalling strategy): 77
ICNTL(10) (max num of refinements): 0
ICNTL(11) (error analysis): 0
ICNTL(12) (efficiency control): 1
ICNTL(13) (efficiency control): 0
ICNTL(14) (percentage of estimated workspace increase): 20
ICNTL(18) (input mat struct): 3
ICNTL(19) (Shur complement info): 0
ICNTL(20) (rhs sparse pattern): 0
ICNTL(21) (solution struct): 1
ICNTL(22) (in-core/out-of-core facility): 0
ICNTL(23) (max size of memory can be allocated locally):0
ICNTL(24) (detection of null pivot rows): 0
ICNTL(25) (computation of a null space basis): 0
ICNTL(26) (Schur options for rhs or solution): 0
ICNTL(27) (experimental parameter): -32
ICNTL(28) (use parallel or sequential ordering): 1
ICNTL(29) (parallel ordering): 0
ICNTL(30) (user-specified set of entries in inv(A)): 0
ICNTL(31) (factors is discarded in the solve phase): 0
ICNTL(33) (compute determinant): 0
CNTL(1) (relative pivoting threshold): 0.01
CNTL(2) (stopping criterion of refinement): 1.49012e-08
CNTL(3) (absolute pivoting threshold): 0.
CNTL(4) (value of static pivoting): -1.
CNTL(5) (fixation for null pivots): 0.
RINFO(1) (local estimated flops for the elimination after analysis):
[0] 4.02519e+06
[1] 2.70367e+06
[2] 1.62473e+07
RINFO(2) (local estimated flops for the assembly after factorization):
[0] 55439.
[1] 30276.
[2] 65773.
RINFO(3) (local estimated flops for the elimination after factorization):
[0] 4.02519e+06
[1] 2.70367e+06
[2] 1.62473e+07
INFO(15) (estimated size of (in MB) MUMPS internal data for running numerical factorization):
[0] 9
[1] 9
[2] 10
INFO(16) (size of (in MB) MUMPS internal data used during numerical factorization):
[0] 9
[1] 9
[2] 10
INFO(23) (num of pivots eliminated on this processor after factorization):
[0] 278
[1] 87
[2] 259
RINFOG(1) (global estimated flops for the elimination after analysis): 2.29761e+07
RINFOG(2) (global estimated flops for the assembly after factorization): 151488.
RINFOG(3) (global estimated flops for the elimination after factorization): 2.29761e+07
(RINFOG(12) RINFOG(13))*2^INFOG(34) (determinant): (0.,0.)*(2^0)
INFOG(3) (estimated real workspace for factors on all processors after analysis): 148148
INFOG(4) (estimated integer workspace for factors on all processors after analysis): 4993
INFOG(5) (estimated maximum front size in the complete tree): 286
INFOG(6) (number of nodes in the complete tree): 23
INFOG(7) (ordering option effectively use after analysis): 2
INFOG(8) (structural symmetry in percent of the permuted matrix after analysis): 100
INFOG(9) (total real/complex workspace to store the matrix factors after factorization): 148148
INFOG(10) (total integer space store the matrix factors after factorization): 4993
INFOG(11) (order of largest frontal matrix after factorization): 286
INFOG(12) (number of off-diagonal pivots): 0
INFOG(13) (number of delayed pivots after factorization): 0
INFOG(14) (number of memory compress after factorization): 0
INFOG(15) (number of steps of iterative refinement after solution): 0
INFOG(16) (estimated size (in MB) of all MUMPS internal data for factorization after analysis: value on the most memory consuming processor): 10
INFOG(17) (estimated size of all MUMPS internal data for factorization after analysis: sum over all processors): 28
INFOG(18) (size of all MUMPS internal data allocated during factorization: value on the most memory consuming processor): 10
INFOG(19) (size of all MUMPS internal data allocated during factorization: sum over all processors): 28
INFOG(20) (estimated number of entries in the factors): 148148
INFOG(21) (size in MB of memory effectively used during factorization - value on the most memory consuming processor): 10
INFOG(22) (size in MB of memory effectively used during factorization - sum over all processors): 28
INFOG(23) (after analysis: value of ICNTL(6) effectively used): 0
INFOG(24) (after analysis: value of ICNTL(12) effectively used): 1
INFOG(25) (after factorization: number of pivots modified by static pivoting): 0
INFOG(28) (after factorization: number of null pivots encountered): 0
INFOG(29) (after factorization: effective number of entries in the factors (sum over all processors)): 148148
INFOG(30, 31) (after solution: size in Mbytes of memory used during solution phase): 1, 2
INFOG(32) (after analysis: type of analysis done): 1
INFOG(33) (value used for ICNTL(8)): 7
INFOG(34) (exponent of the determinant if determinant is requested): 0
linear system matrix = precond matrix:
Mat Object: (fieldsplit_0_) 3 MPI processes
type: mpiaij
rows=624, cols=624
total: nonzeros=72004, allocated nonzeros=72004
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 84 nodes, limit used is 5
A01
Mat Object: 3 MPI processes
type: mpiaij
rows=624, cols=64
total: nonzeros=6619, allocated nonzeros=6619
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 84 nodes, limit used is 5
Mat Object: 3 MPI processes
type: mpiaij
rows=64, cols=64
total: nonzeros=3254, allocated nonzeros=3254
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 36 nodes, limit used is 5
linear system matrix = precond matrix:
Mat Object: 3 MPI processes
type: mpiaij
rows=688, cols=688
total: nonzeros=86740, allocated nonzeros=100623
total number of mallocs used during MatSetValues calls =0
using I-node (on process 0) routines: found 89 nodes, limit used is 5
************************************************************************************************************************
*** WIDEN YOUR WINDOW TO 120 CHARACTERS. Use 'enscript -r -fCourier9' to print this document ***
************************************************************************************************************************
---------------------------------------------- PETSc Performance Summary: ----------------------------------------------
on a arch-linux2-c-debug named dsp0780450 with 3 processors, by B07947 Wed Jan 4 22:24:59 2017
Using Petsc Release Version 3.7.2, Jun, 05, 2016
Max Max/Min Avg Total
Time (sec): 6.375e-01 1.00000 6.375e-01
Objects: 3.880e+02 1.00518 3.867e+02
Flops: 1.960e+07 3.76942 1.356e+07 4.069e+07
Flops/sec: 3.074e+07 3.76942 2.128e+07 6.383e+07
Memory: 2.840e+06 2.46007 6.751e+06
MPI Messages: 1.442e+03 1.39324 1.209e+03 3.627e+03
MPI Message Lengths: 2.737e+06 1.92279 1.757e+03 6.373e+06
MPI Reductions: 5.530e+03 1.00000
Flop counting convention: 1 flop = 1 real number operation of type (multiply/divide/add/subtract)
e.g., VecAXPY() for real vectors of length N --> 2N flops
and VecAXPY() for complex vectors of length N --> 8N flops
Summary of Stages: ----- Time ------ ----- Flops ----- --- Messages --- -- Message Lengths -- -- Reductions --
Avg %Total Avg %Total counts %Total Avg %Total counts %Total
0: Main Stage: 6.3745e-01 100.0% 4.0689e+07 100.0% 3.627e+03 100.0% 1.757e+03 100.0% 5.528e+03 100.0%
------------------------------------------------------------------------------------------------------------------------
See the 'Profiling' chapter of the users' manual for details on interpreting output.
Phase summary info:
Count: number of times phase was executed
Time and Flops: Max - maximum over all processors
Ratio - ratio of maximum to minimum over all processors
Mess: number of messages sent
Avg. len: average message length (bytes)
Reduct: number of global reductions
Global: entire computation
Stage: stages of a computation. Set stages with PetscLogStagePush() and PetscLogStagePop().
%T - percent time in this phase %F - percent flops in this phase
%M - percent messages in this phase %L - percent message lengths in this phase
%R - percent reductions in this phase
Total Mflop/s: 10e-6 * (sum of flops over all processors)/(max time over all processors)
------------------------------------------------------------------------------------------------------------------------
##########################################################
# #
# WARNING!!! #
# #
# This code was compiled with a debugging option, #
# To get timing results run ./configure #
# using --with-debugging=no, the performance will #
# be generally two or three times faster. #
# #
##########################################################
Event Count Time (sec) Flops --- Global --- --- Stage --- Total
Max Ratio Max Ratio Max Ratio Mess Avg len Reduct %T %F %M %L %R %T %F %M %L %R Mflop/s
------------------------------------------------------------------------------------------------------------------------
--- Event Stage 0: Main Stage
VecMDot 90 1.0 1.0739e-02 2.8 8.55e+05 2.8 0.0e+00 0.0e+00 1.8e+02 1 5 0 0 3 1 5 0 0 3 178
VecNorm 185 1.0 4.0359e-03 2.1 1.14e+05 2.8 0.0e+00 0.0e+00 3.7e+02 0 1 0 0 7 0 1 0 0 7 63
VecScale 183 1.0 2.8165e-02 1.2 3.43e+04 3.4 0.0e+00 0.0e+00 0.0e+00 4 0 0 0 0 4 0 0 0 0 2
VecCopy 92 1.0 4.0483e-04 1.3 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecSet 373 1.0 1.3938e-03 1.4 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecAXPY 181 1.0 1.4770e-02 1.2 9.96e+04 2.5 0.0e+00 0.0e+00 0.0e+00 2 1 0 0 0 2 1 0 0 0 16
VecAYPX 91 1.0 4.9877e-04 1.3 2.79e+04 2.8 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 126
VecWAXPY 2 1.0 1.1921e-05 1.4 6.14e+02 2.8 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 115
VecMAXPY 181 1.0 5.1925e-03 1.6 1.73e+06 2.8 0.0e+00 0.0e+00 0.0e+00 1 10 0 0 0 1 10 0 0 0 747
VecAssemblyBegin 1 1.0 4.1962e-05 1.1 0.00e+00 0.0 6.0e+00 7.2e+02 6.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecAssemblyEnd 1 1.0 1.0014e-05 1.2 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
VecScatterBegin 1263 1.0 8.3861e-03 1.0 0.00e+00 0.0 2.6e+03 9.1e+02 2.7e+02 1 0 72 38 5 1 0 72 38 5 0
VecScatterEnd 993 1.0 9.8801e-03 1.1 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 1 0 0 0 0 1 0 0 0 0 0
MatMult 363 1.0 4.3428e-02 1.7 1.64e+07 3.9 1.5e+03 7.9e+02 0.0e+00 6 84 40 18 0 6 84 40 18 0 782
MatSolve 270 1.0 1.1593e-01 1.0 0.00e+00 0.0 1.2e+03 1.0e+03 2.8e+02 18 0 33 19 5 18 0 33 19 5 0
MatLUFactorSym 2 1.0 1.4674e-02 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 1.6e+01 2 0 0 0 0 2 0 0 0 0 0
MatLUFactorNum 2 1.0 1.6366e-01 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 26 0 0 0 0 26 0 0 0 0 0
MatConvert 1 1.0 3.1614e-04 1.3 0.00e+00 0.0 0.0e+00 0.0e+00 4.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatScale 2 1.0 2.5296e-04 1.5 8.44e+0319.6 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 39
MatAssemblyBegin 14 1.0 3.6721e-03 3.6 0.00e+00 0.0 9.0e+00 5.3e+04 3.2e+01 0 0 0 8 1 0 0 0 8 1 0
MatAssemblyEnd 14 1.0 9.9134e-03 1.1 0.00e+00 0.0 3.2e+01 2.0e+02 1.6e+02 2 0 1 0 3 2 0 1 0 3 0
MatGetRow 128 0.0 2.0242e-04 0.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetRowIJ 2 2.0 5.2452e-06 5.5 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetSubMatrix 4 1.0 3.2568e-02 1.0 0.00e+00 0.0 2.0e+01 1.8e+02 1.8e+02 5 0 1 0 3 5 0 1 0 3 0
MatGetOrdering 2 2.0 2.8801e-04 2.5 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatView 6 1.0 5.2862e-03 1.2 0.00e+00 0.0 1.4e+02 2.1e+03 1.8e+01 1 0 4 5 0 1 0 4 5 0 0
MatAXPY 1 1.0 1.1809e-03 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 3.7e+01 0 0 0 0 1 0 0 0 0 1 0
MatMatMult 1 1.0 4.0901e-03 1.0 2.82e+05 0.0 8.0e+00 3.7e+03 3.7e+01 1 1 0 0 1 1 1 0 0 1 69
MatMatMultSym 1 1.0 3.1250e-03 1.0 0.00e+00 0.0 6.0e+00 3.0e+03 3.3e+01 0 0 0 0 1 0 0 0 0 1 0
MatMatMultNum 1 1.0 9.5606e-04 1.0 2.82e+05 0.0 2.0e+00 5.7e+03 4.0e+00 0 1 0 0 0 0 1 0 0 0 295
MatGetLocalMat 2 1.0 1.9097e-04 2.0 0.00e+00 0.0 0.0e+00 0.0e+00 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
MatGetBrAoCol 2 1.0 2.4199e-04 1.5 0.00e+00 0.0 8.0e+00 3.7e+03 0.0e+00 0 0 0 0 0 0 0 0 0 0 0
KSPGMRESOrthog 90 1.0 1.7338e-02 1.8 1.71e+06 2.8 0.0e+00 0.0e+00 1.6e+03 2 9 0 0 28 2 9 0 0 28 221
KSPSetUp 3 1.0 3.6407e-04 1.0 0.00e+00 0.0 0.0e+00 0.0e+00 1.0e+01 0 0 0 0 0 0 0 0 0 0 0
KSPSolve 1 1.0 5.1757e-01 1.0 1.93e+07 3.7 2.6e+03 9.1e+02 5.1e+03 81 99 73 38 92 81 99 73 38 92 78
PCSetUp 3 1.0 2.2046e-01 1.0 2.90e+05673.4 3.6e+01 1.1e+03 3.8e+02 35 1 1 1 7 35 1 1 1 7 1
PCApply 90 1.0 4.1464e-01 1.0 2.15e+0622.0 1.5e+03 9.1e+02 1.2e+03 65 6 43 22 23 65 6 43 22 23 6
KSPSolve_FS_0 90 1.0 6.7575e-02 1.0 0.00e+00 0.0 5.4e+02 1.1e+03 3.6e+02 10 0 15 9 7 10 0 15 9 7 0
KSPSolve_FS_Schu 90 1.0 8.9136e-02 1.1 0.00e+00 0.0 9.2e+01 7.5e+02 4.0e+02 14 0 3 1 7 14 0 3 1 7 0
KSPSolve_FS_Low 90 1.0 2.1874e-01 1.0 0.00e+00 0.0 5.5e+02 1.1e+03 4.0e+02 34 0 15 9 7 34 0 15 9 7 0
------------------------------------------------------------------------------------------------------------------------
Memory usage is given in bytes:
Object Type Creations Destructions Memory Descendants' Mem.
Reports information only for process 0.
--- Event Stage 0: Main Stage
Vector 280 280 1105608 0.
Vector Scatter 14 14 17840 0.
Matrix 37 37 1853640 0.
Index Set 42 40 37772 0.
Krylov Solver 5 5 24280 0.
Preconditioner 5 5 4840 0.
Viewer 1 0 0 0.
Distributed Mesh 1 1 4624 0.
Star Forest Bipartite Graph 2 2 1616 0.
Discrete System 1 1 872 0.
========================================================================================================================
Average time to get PetscTime(): 0.
Average time for MPI_Barrier(): 1.19209e-06
Average time for zero size MPI_Send(): 6.35783e-07
#PETSc Option Table entries:
-fieldsplit_0_ksp_converged_reason
-fieldsplit_0_ksp_type preonly
-fieldsplit_0_pc_factor_mat_solver_package mumps
-fieldsplit_0_pc_type lu
-fieldsplit_1_ksp_converged_reason
-fieldsplit_1_ksp_type preonly
-fieldsplit_1_pc_factor_mat_solver_package mumps
-fieldsplit_1_pc_type lu
-ksp_rtol 1.0e-5
-ksp_type fgmres
-ksp_view
-log_summary
-pc_fieldsplit_schur_factorization_type full
-pc_fieldsplit_schur_precondition selfp
-pc_fieldsplit_type schur
-pc_type fieldsplit
#End of PETSc Option Table entries
Compiled without FORTRAN kernels
Compiled with full precision matrices (default)
sizeof(short) 2 sizeof(int) 4 sizeof(long) 8 sizeof(void*) 8 sizeof(PetscScalar) 8 sizeof(PetscInt) 4
Configure options: --prefix=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install --with-mpi=yes --with-x=yes --download-ml=/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/ml-6.2-p3.tar.gz --with-mumps-lib="-L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp " --with-mumps-include=/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include --with-scalapack-lib="-L/usr/lib -lscalapack-openmpi" --with-blacs-lib="-L/usr/lib -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi" --with-blas-lib="-L/usr/lib -lopenblas -lcblas" --with-lapack-lib="-L/usr/lib -llapack"
-----------------------------------------
Libraries compiled on Wed Nov 30 11:59:58 2016 on dsp0780450
Machine characteristics: Linux-3.16.0-4-amd64-x86_64-with-debian-8.6
Using PETSc directory: /home/B07947/dev/codeaster-prerequisites/petsc-3.7.2
Using PETSc arch: arch-linux2-c-debug
-----------------------------------------
Using C compiler: mpicc -fPIC -Wall -Wwrite-strings -Wno-strict-aliasing -Wno-unknown-pragmas -fvisibility=hidden -g3 ${COPTFLAGS} ${CFLAGS}
Using Fortran compiler: mpif90 -fPIC -Wall -ffree-line-length-0 -Wno-unused-dummy-argument -g ${FOPTFLAGS} ${FFLAGS}
-----------------------------------------
Using include paths: -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/include -I/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/include -I/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/include -I/usr/lib/openmpi/include -I/usr/lib/openmpi/include/openmpi
-----------------------------------------
Using C linker: mpicc
Using Fortran linker: mpif90
Using libraries: -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/arch-linux2-c-debug/lib -lpetsc -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Mumps-502_consortium_aster1/MPI/lib -lzmumps -ldmumps -lmumps_common -lpord -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Scotch_aster-604_aster6/MPI/lib -lesmumps -lptscotch -lptscotcherr -lptscotcherrexit -lscotch -lscotcherr -lscotcherrexit -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Parmetis_aster-403_aster/lib -lparmetis -L/home/B07947/dev/codeaster-prerequisites/v13/prerequisites/Metis_aster-510_aster1/lib -lmetis -L/usr/lib -lscalapack-openmpi -lblacs-openmpi -lblacsCinit-openmpi -lblacsF77init-openmpi -L/usr/lib/x86_64-linux-gnu -lgomp -Wl,-rpath,/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -L/home/B07947/dev/codeaster-prerequisites/petsc-3.7.2/Install/lib -lml -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -lmpi_cxx -lstdc++ -lscalapack-openmpi -llapack -lopenblas -lcblas -lX11 -lssl -lcrypto -lm -lmpi_f90 -lmpi_f77 -lgfortran -lm -lgfortran -lm -lquadmath -lm -lmpi_cxx -lstdc++ -Wl,-rpath,/usr/lib/openmpi/lib -L/usr/lib/openmpi/lib -Wl,-rpath,/usr/lib/gcc/x86_64-linux-gnu/4.9 -L/usr/lib/gcc/x86_64-linux-gnu/4.9 -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -Wl,-rpath,/lib/x86_64-linux-gnu -L/lib/x86_64-linux-gnu -Wl,-rpath,/usr/lib/x86_64-linux-gnu -L/usr/lib/x86_64-linux-gnu -ldl -lmpi -lhwloc -lgcc_s -lpthread -ldl
-----------------------------------------
-------------- next part --------------
A non-text attachment was scrubbed...
Name: Matrix.bin.gz
Type: application/x-gzip
Size: 177035 bytes
Desc: not available
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20170104/5acf8079/attachment-0001.bin>
More information about the petsc-users
mailing list