[Didasko-Regression] test passed - Linux - beowulf - mpi -
TestDidasko.exe
Trilinos test harness
trilinos-regression at software.sandia.gov
Sat Jul 23 21:36:45 MDT 2005
../../../../logLinux.txt
-------------- next part --------------
didasko-regression at software.sandia.gov
Script owner(s) is listed on the previous line.
Package being tested: ML
Name of subdirectory: MPI
Date: Sat Jul 23 22:35:39 CDT 2005
Linux beowulf 2.6.10-beowulf #1 Sat Jan 22 23:03:17 CST 2005 i686 AMD Athlon(tm) AuthenticAMD GNU/Linux
[DIDASKO Test amesos : ex1.exe ]
||b-Ax||_2 = 3.97826e-15
||x_exact - x||_2 = 7.40778e-15
[Test w/ 1 proc passed]
||b-Ax||_2 = 3.97826e-15
||x_exact - x||_2 = 7.40778e-15
[Test w/ 4 procs passed]
[DIDASKO Test aztecoo : ex1.exe ]
*******************************************************
***** Preconditioned GMRES solution
***** 1 step block Jacobi
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 6.798693e-01
iter: 2 residual = 4.028772e-01
iter: 3 residual = 1.824286e-01
iter: 4 residual = 5.684696e-02
iter: 5 residual = 2.070778e-02
iter: 6 residual = 4.119793e-03
iter: 7 residual = 1.386616e-04
iter: 8 residual = 1.272363e-05
iter: 9 residual = 1.232283e-36
Solution time: 0.001437 (sec.)
total iterations: 9
Solver performed 9iterations.
Norm of the true residual = 7.4111e-15
[Test w/ 1 proc passed]
*******************************************************
***** Preconditioned GMRES solution
***** 1 step block Jacobi
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 6.798693e-01
iter: 2 residual = 4.028772e-01
iter: 3 residual = 1.824286e-01
iter: 4 residual = 5.684696e-02
iter: 5 residual = 2.070778e-02
iter: 6 residual = 4.119793e-03
iter: 7 residual = 1.386616e-04
iter: 8 residual = 1.272363e-05
iter: 9 residual = 1.692224e-21
Solution time: 0.029013 (sec.)
total iterations: 9
Solver performed 9iterations.
Norm of the true residual = 2.57035e-15
[Test w/ 4 procs passed]
[DIDASKO Test aztecoo : ex2.exe ]
*******************************************************
***** Preconditioned GMRESR solution
***** AztecOO Operator
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 7.376015e-17
Solution time: 0.000523 (sec.)
total iterations: 1
[Test w/ 1 proc passed]
*******************************************************
***** Preconditioned GMRESR solution
***** AztecOO Operator
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 2.220015e-16
Solution time: 0.069195 (sec.)
total iterations: 1
[Test w/ 4 procs passed]
[DIDASKO Test aztecoo : ex3.exe ]
*******************************************************
***** Preconditioned CG (with condnum) solution
***** icc(0) domain decomp. without overlap
***** No scaling
***** NOTE: convergence VARIES when the total number of
***** processors is changed.
*******************************************************
*********************************************************************
***** Condition number estimate for subdomain preconditioner on PE 0 = 1.7071e+00
*********************************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 2.833240e-01
iter: 2 residual = 1.678361e-01
iter: 3 residual = 1.204563e-01
iter: 4 residual = 9.409235e-02
iter: 5 residual = 7.815670e-02
iter: 6 residual = 7.379748e-02
iter: 7 residual = 7.172844e-02
iter: 8 residual = 3.611592e-02
iter: 9 residual = 1.048571e-02
iter: 10 residual = 5.841847e-03
iter: 11 residual = 2.325823e-03
iter: 12 residual = 9.957212e-04
iter: 13 residual = 5.047650e-04
iter: 14 residual = 4.269165e-04
iter: 15 residual = 2.240136e-04
iter: 16 residual = 7.676852e-05
iter: 17 residual = 2.197514e-05
iter: 18 residual = 1.349057e-05
iter: 19 residual = 1.401451e-05
iter: 20 residual = 8.988586e-06
iter: 21 residual = 3.538193e-06
iter: 22 residual = 1.052144e-06
iter: 23 residual = 3.998271e-07
iter: 24 residual = 1.694367e-07
iter: 25 residual = 9.909627e-08
iter: 26 residual = 3.736529e-08
iter: 27 residual = 1.633258e-08
iter: 28 residual = 1.037898e-08
iter: 29 residual = 2.923729e-09
iter: 30 residual = 7.432531e-10
iter: 31 residual = 4.653065e-10
iter: 32 residual = 1.764335e-10
iter: 33 residual = 6.373921e-11
iter: 34 residual = 1.763829e-11
iter: 35 residual = 4.962715e-12
iter: 36 residual = 1.541029e-12
iter: 37 residual = 7.620345e-13
-----------------------------------------------------
Analysis of the Lanczos matrix of
the preconditioned system:
smallest eigenvalue = 3.419584e-02
largest eigenvalue = 1.202359e+00
estimated condition number = 3.516096e+01
-----------------------------------------------------
Solution time: 0.008978 (sec.)
total iterations: 37
||b-Ax||_2 = 8.62451e-12
||x_exact - x||_2 = 9.30413e-12
[Test w/ 1 proc passed]
*******************************************************
***** Preconditioned CG (with condnum) solution
***** icc(0) domain decomp. without overlap
***** No scaling
***** NOTE: convergence VARIES when the total number of
***** processors is changed.
*******************************************************
*********************************************************************
***** Condition number estimate for subdomain preconditioner on PE 0 = 1.6437e+00
*********************************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 3.091237e-01
iter: 2 residual = 1.849971e-01
iter: 3 residual = 1.354599e-01
iter: 4 residual = 1.247074e-01
iter: 5 residual = 1.149190e-01
iter: 6 residual = 8.538871e-02
iter: 7 residual = 8.400185e-02
iter: 8 residual = 8.843012e-02
iter: 9 residual = 7.442151e-02
iter: 10 residual = 3.684231e-02
iter: 11 residual = 1.704846e-02
iter: 12 residual = 8.652855e-03
iter: 13 residual = 4.307353e-03
iter: 14 residual = 2.556082e-03
iter: 15 residual = 1.297558e-03
iter: 16 residual = 6.621170e-04
iter: 17 residual = 5.049810e-04
iter: 18 residual = 3.237423e-04
iter: 19 residual = 2.141377e-04
iter: 20 residual = 1.563852e-04
iter: 21 residual = 8.366096e-05
iter: 22 residual = 3.932088e-05
iter: 23 residual = 2.085933e-05
iter: 24 residual = 1.471811e-05
iter: 25 residual = 1.302526e-05
iter: 26 residual = 8.326986e-06
iter: 27 residual = 4.724175e-06
iter: 28 residual = 3.455638e-06
iter: 29 residual = 2.505456e-06
iter: 30 residual = 2.174769e-06
iter: 31 residual = 1.120404e-06
iter: 32 residual = 6.700631e-07
iter: 33 residual = 4.115400e-07
iter: 34 residual = 2.103724e-07
iter: 35 residual = 1.245696e-07
iter: 36 residual = 8.231450e-08
iter: 37 residual = 3.777145e-08
iter: 38 residual = 1.831501e-08
iter: 39 residual = 1.124118e-08
iter: 40 residual = 7.427534e-09
iter: 41 residual = 5.117815e-09
iter: 42 residual = 4.111083e-09
iter: 43 residual = 3.440726e-09
iter: 44 residual = 2.444174e-09
iter: 45 residual = 1.341538e-09
iter: 46 residual = 6.973961e-10
iter: 47 residual = 3.423225e-10
iter: 48 residual = 1.760662e-10
iter: 49 residual = 8.891623e-11
iter: 50 residual = 4.005462e-11
iter: 51 residual = 2.442729e-11
iter: 52 residual = 1.273926e-11
iter: 53 residual = 6.674018e-12
iter: 54 residual = 3.961524e-12
iter: 55 residual = 2.081765e-12
iter: 56 residual = 1.041417e-12
iter: 57 residual = 5.946417e-13
-----------------------------------------------------
Analysis of the Lanczos matrix of
the preconditioned system:
smallest eigenvalue = 2.604982e-02
largest eigenvalue = 1.570399e+00
estimated condition number = 6.028444e+01
-----------------------------------------------------
*********************************************************************
***** Condition number estimate for subdomain preconditioner on PE 3 = 1.6423e+00
*********************************************************************
*********************************************************************
***** Condition number estimate for subdomain preconditioner on PE 2 = 1.6437e+00
*********************************************************************
*********************************************************************
***** Condition number estimate for subdomain preconditioner on PE 1 = 1.6423e+00
*********************************************************************
Solution time: 0.210222 (sec.)
total iterations: 57
||b-Ax||_2 = 6.72818e-12
||x_exact - x||_2 = 9.56116e-12
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex1.exe ]
Epetra::MpiComm
Processor 0 of 1 total processors
On proc 0 dvalue2 = 0
[Test w/ 1 proc passed]
Epetra::MpiComm
Epetra::MpiComm
Epetra::MpiComm
Epetra::MpiComm
Processor 1 of 4 total processors
Processor 2 of 4 total processors
Processor 3 of 4 total processors
Processor 0 of 4 total processors
On proc 0 dvalue2 = 0
On proc 1 dvalue2 = 1
On proc 2 dvalue2 = 3
On proc 3 dvalue2 = 6
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex10.exe ]
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 2
LDA: 2
0 100
1 101
Inf norm of A = 201
One norm of A = 102
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 1
LDA: 2
11
12
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 1
LDA: 2
1200
1223
[Test w/ 1 proc passed]
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Data access mode: Copy
Data access mode: Copy
Data access mode: Copy
A_Copied: yes
A_Copied: yes
A_Copied: yes
Rows(M): 2
Rows(M): 2
Rows(M): 2
Columns(N): 2
Columns(N): 2
Columns(N): 2
LDA: 2
LDA: 2
LDA: 2
0 100
0 100
0 100
1 101
1 101
1 101
Inf norm of A = 201
Inf norm of A = 201
Inf norm of A = 201
One norm of A = 102
One norm of A = 102
One norm of A = 102
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Data access mode: Copy
Data access mode: Copy
Data access mode: Copy
A_Copied: yes
A_Copied: yes
A_Copied: yes
Rows(M): 2
Rows(M): 2
Rows(M): 2
Columns(N): 1
Columns(N): 1
Columns(N): 1
LDA: 2
LDA: 2
LDA: 2
11
11
11
12
12
12
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Data access mode: Copy
Data access mode: Copy
Data access mode: Copy
A_Copied: yes
A_Copied: yes
A_Copied: yes
Rows(M): 2
Rows(M): 2
Rows(M): 2
Columns(N): 1
Columns(N): 1
Columns(N): 1
LDA: 2
LDA: 2
LDA: 2
1200
1200
1200
1223
1223
1223
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 2
LDA: 2
0 100
1 101
Inf norm of A = 201
One norm of A = 102
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 1
LDA: 2
11
12
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 2
Columns(N): 1
LDA: 2
1200
1223
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex11.exe ]
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
0.5 0.333333 0.25 0.2 0.166667
0.333333 0.25 0.2 0.166667 0.142857
0.25 0.2 0.166667 0.142857 0.125
0.2 0.166667 0.142857 0.125 0.111111
0.166667 0.142857 0.125 0.111111 0.1
A * x =
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 0 0 0 0
The (estimated) condition number of A is 2.81723e+06
The inverse of A is
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
450 -4200 12600 -15120 6300
-4200 44100 -141120 176400 -75600
12600 -141120 470400 -604800 264600
-15120 176400 -604800 793800 -352800
6300 -75600 264600 -352800 158760
[Test w/ 1 proc passed]
Epetra::SerialDenseMatrix
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
0.5 0.333333 0.25 0.2 0.166667
0.333333 0.25 0.2 0.166667 0.142857
0.25 0.2 0.166667 0.142857 0.125
0.2 0.166667 0.142857 0.125 0.111111
0.166667 0.142857 0.125 0.111111 0.1
A * x =
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 0 0 0 0
The (estimated) condition number of A is 2.81723e+06
The inverse of A is
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
450 -4200 12600 -15120 6300
-4200 44100 -141120 176400 -75600
12600 -141120 470400 -604800 264600
-15120 176400 -604800 793800 -352800
6300 -75600 264600 -352800 158760
Columns(N): 5
LDA: 5
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
0.5 0.333333 0.25 0.2 0.166667
0.333333 0.25 0.2 0.166667 0.142857
0.25 0.2 0.166667 0.142857 0.125
0.2 0.166667 0.142857 0.125 0.111111
0.166667 0.142857 0.125 0.111111 0.1
A * x =
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 0 0 0 0
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
0.5 0.333333 0.25 0.2 0.166667
0.333333 0.25 0.2 0.166667 0.142857
0.25 0.2 0.166667 0.142857 0.125
0.2 0.166667 0.142857 0.125 0.111111
0.166667 0.142857 0.125 0.111111 0.1
A * x =
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 0 0 0 0
The (estimated) condition number of A is 2.81723e+06
The inverse of A is
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
450 -4200 12600 -15120 6300
-4200 44100 -141120 176400 -75600
12600 -141120 470400 -604800 264600
-15120 176400 -604800 793800 -352800
6300 -75600 264600 -352800 158760
The (estimated) condition number of A is 2.81723e+06
The inverse of A is
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
450 -4200 12600 -15120 6300
-4200 44100 -141120 176400 -75600
12600 -141120 470400 -604800 264600
-15120 176400 -604800 793800 -352800
6300 -75600 264600 -352800 158760
0.5 0.333333 0.25 0.2 0.166667
0.333333 0.25 0.2 0.166667 0.142857
0.25 0.2 0.166667 0.142857 0.125
0.2 0.166667 0.142857 0.125 0.111111
0.166667 0.142857 0.125 0.111111 0.1
A * x =
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 0 0 0 0
The (estimated) condition number of A is 2.81723e+06
The inverse of A is
Epetra::SerialDenseMatrix
Data access mode: Copy
A_Copied: yes
Rows(M): 5
Columns(N): 5
LDA: 5
450 -4200 12600 -15120 6300
-4200 44100 -141120 176400 -75600
12600 -141120 470400 -604800 264600
-15120 176400 -604800 793800 -352800
6300 -75600 264600 -352800 158760
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex12.exe ]
q dot z = 2
[Test w/ 1 proc passed]
q dot z = 2
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex13.exe ]
[Test w/ 1 proc passed]
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex14.exe ]
*** general Information about the matrix
Number of Global Rows = 5
Number of Global Cols = 5
is the matrix square = yes
||A||_\infty = 4
||A||_1 = 4
||A||_F = 5.2915
Number of nonzero diagonal entries = 5( 100 %)
Nonzero per row : min = 2 average = 2.6 max = 3
Maximum number of nonzero elements/row = 3
min( a_{i,j} ) = -1
max( a_{i,j} ) = 2
min( abs(a_{i,j}) ) = 1
max( abs(a_{i,j}) ) = 2
Number of diagonal dominant rows = 2 (40 % of total)
Number of weakly diagonal dominant rows = 3 (60 % of total)
*** Information about the Trilinos storage
Base Index = 0
is storage optimized = no
are indices global = no
is matrix lower triangular = no
is matrix upper triangular = no
are there diagonal entries = yes
[Test w/ 1 proc passed]
*** general Information about the matrix
Number of Global Rows = 5
Number of Global Cols = 5
is the matrix square = yes
||A||_\infty = 4
||A||_1 = 4
||A||_F = 5.2915
Number of nonzero diagonal entries = 5( 100 %)
Nonzero per row : min = 1 average = 2.6 max = 3
Maximum number of nonzero elements/row = 3
min( a_{i,j} ) = -1
max( a_{i,j} ) = 2
min( abs(a_{i,j}) ) = 1
max( abs(a_{i,j}) ) = 2
Number of diagonal dominant rows = 2 (40 % of total)
Number of weakly diagonal dominant rows = 3 (60 % of total)
*** Information about the Trilinos storage
Base Index = 0
is storage optimized = no
are indices global = no
is matrix lower triangular = no
is matrix upper triangular = no
are there diagonal entries = yes
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex15.exe ]
A = spalloc(5,5,13);
% On proc 0: 5 rows and 13 nonzeros
A(1,1) = 2;
A(1,2) = -1;
A(2,1) = -1;
A(2,2) = 2;
A(2,3) = -1;
A(3,2) = -1;
A(3,3) = 2;
A(3,4) = -1;
A(4,3) = -1;
A(4,4) = 2;
A(4,5) = -1;
A(5,4) = -1;
A(5,5) = 2;
%End of Matrix Output
[Test w/ 1 proc passed]
% On proc 1: 1 rows and 3 nonzeros
A(3,3) = 2;
A(3,2) = -1;
A(3,4) = -1;
% On proc 2: 1 rows and 3 nonzeros
A(4,4) = 2;
A(4,3) = -1;
A(4,5) = -1;
% On proc 3: 1 rows and 2 nonzeros
A(5,5) = 2;
A(5,4) = -1;
A = spalloc(5,5,13);
% On proc 0: 2 rows and 5 nonzeros
A(1,1) = 2;
A(1,2) = -1;
A(2,1) = -1;
A(2,2) = 2;
A(2,3) = -1;
%End of Matrix Output
%End of Matrix Output
%End of Matrix Output
%End of Matrix Output
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex16.exe ]
v = zeros(5)
% On proc 0: 5 rows of 5 elements
b(0) = -0.212298;
b(1) = -0.0908558;
b(2) = 0.98591;
b(3) = 0.187888;
b(4) = -0.173478;
% End of vector
[Test w/ 1 proc passed]
% On proc 1: 1 rows of 5 elements
b(2) = -0.212267;
% On proc 2: 1 rows of 5 elements
b(3) = -0.212235;
% On proc 3: 1 rows of 5 elements
b(4) = -0.212204;
% End of vector
v = zeros(5)
% On proc 0: 2 rows of 5 elements
b(0) = -0.212298;
b(1) = -0.0908558;
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex17.exe ]
Epetra::VbrMatrix
Number of Global Block Rows = 5
Number of Global Block Cols = 5
Number of Global Block Diags = 5
Number of Global Blk Entries = 9
Global Max Num Block Entries = 2
Number of Global Rows = 15
Number of Global Cols = 15
Number of Global Diagonals = 15
Number of Global Nonzeros = 95
Global Maximum Num Entries = 36
** Matrix is Upper Triangular **
Number of My Block Rows = 5
Number of My Block Cols = 5
Number of My Block Diags = 5
Number of My Blk Entries = 9
My Max Num Block Entries = 2
Number of My Rows = 15
Number of My Cols = 15
Number of My Diagonals = 15
Number of My Nonzeros = 95
My Maximum Num Entries = 2
Processor Block Row Index Block Col Index
Values
0 0 0
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 1
Columns(N): 1
LDA: 1
0
0 0 1
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 1
Columns(N): 2
LDA: 1
0 0
0 1 1
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 2
Columns(N): 2
LDA: 2
1 1
1 1
0 1 2
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 2
Columns(N): 3
LDA: 2
1 1 1
1 1 1
0 2 2
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 3
Columns(N): 3
LDA: 3
2 2 2
2 2 2
2 2 2
0 2 3
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 3
Columns(N): 4
LDA: 3
2 2 2 2
2 2 2 2
2 2 2 2
0 3 3
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 4
Columns(N): 4
LDA: 4
3 3 3 3
3 3 3 3
3 3 3 3
3 3 3 3
0 3 4
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 4
Columns(N): 5
LDA: 4
3 3 3 3 3
3 3 3 3 3
3 3 3 3 3
3 3 3 3 3
0 4 4
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 5
Columns(N): 5
LDA: 5
4 4 4 4 4
4 4 4 4 4
4 4 4 4 4
4 4 4 4 4
4 4 4 4 4
[Test w/ 1 proc passed]
Epetra::VbrMatrix
Epetra::VbrMatrix
Epetra::VbrMatrix
Epetra::VbrMatrix
Number of Global Block Rows = 5
Number of Global Block Cols = 5
Number of Global Block Diags = 5
Number of Global Blk Entries = 9
Global Max Num Block Entries = 2
Number of Global Rows = 15
Number of Global Cols = 15
Number of Global Diagonals = 15
Number of Global Nonzeros = 95
Global Maximum Num Entries = 36
** Matrix is Upper Triangular **
Number of My Block Rows = 2
Number of My Block Cols = 3
Number of My Block Diags = 2
Number of My Blk Entries = 4
My Max Num Block Entries = 2
Number of My Rows = 3
Number of My Cols = 6
Number of My Diagonals = 3
Number of My Nonzeros = 13
My Maximum Num Entries = 2
Number of My Block Rows = 1
Number of My Block Cols = 2
Number of My Block Diags = 1
Number of My Blk Entries = 2
My Max Num Block Entries = 2
Number of My Rows = 3
Number of My Cols = 7
Number of My Diagonals = 3
Number of My Nonzeros = 21
My Maximum Num Entries = 2
Number of My Block Rows = 1
Number of My Block Cols = 2
Number of My Block Diags = 1
Number of My Blk Entries = 2
My Max Num Block Entries = 2
Number of My Rows = 4
Number of My Cols = 9
Number of My Diagonals = 4
Number of My Nonzeros = 36
My Maximum Num Entries = 2
Number of My Block Rows = 1
Number of My Block Cols = 1
Number of My Block Diags = 1
Number of My Blk Entries = 1
My Max Num Block Entries = 1
Number of My Rows = 5
Number of My Cols = 5
Number of My Diagonals = 5
Number of My Nonzeros = 25
My Maximum Num Entries = 1
Processor Block Row Index Block Col Index
Values
0 0 0
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 1
Columns(N): 1
LDA: 1
0
0 0 1
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 1
Columns(N): 2
LDA: 1
0 0
0 1 1
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 2
Columns(N): 2
LDA: 2
1 1
1 1
0 1 2
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 2
Columns(N): 3
LDA: 2
1 1 1
1 1 1
1 2 2
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 3
Columns(N): 3
LDA: 3
0 0 0
0 0 0
0 0 0
1 2 3
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 3
Columns(N): 4
LDA: 3
0 0 0 0
0 0 0 0
0 0 0 0
2 3 3
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 4
Columns(N): 4
LDA: 4
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
2 3 4
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 4
Columns(N): 5
LDA: 4
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
3 4 4
Epetra::SerialDenseMatrix
Data access mode: View
A_Copied: no
Rows(M): 5
Columns(N): 5
LDA: 5
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex18.exe ]
min(x) = -0.212298
max(x) = 0.98591
ave(x) = 0.139433
x dot b = 0.25881
Number of vectors = 1
Local Size = 5
Global Size = 5
[Test w/ 1 proc passed]
min(x) = -0.212298
min(x) = -0.212298
min(x) = -0.212298
min(x) = -0.212298
max(x) = -0.0908558
max(x) = -0.0908558
max(x) = -0.0908558
ave(x) = -0.187972
ave(x) = -0.187972
ave(x) = -0.187972
max(x) = -0.0908558
ave(x) = -0.187972
x dot b = 0.243139
Number of vectors = 1
Local Size = 2
Global Size = 5
x dot b = 0.243139
x dot b = 0.243139
x dot b = 0.243139
Number of vectors = 1
Number of vectors = 1
Number of vectors = 1
Local Size = 1
Local Size = 1
Local Size = 1
Global Size = 5
Global Size = 5
Global Size = 5
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex19.exe ]
Epetra::CrsMatrix
Number of Global Rows = 30
Number of Global Cols = 30
Number of Global Diagonals = 0
Number of Global Nonzeros = 0
Global Maximum Num Entries = 0
** Matrix is Lower Triangular **
** Matrix is Upper Triangular **
** Matrix has no diagonal **
Number of My Rows = 30
Number of My Cols = 30
Number of My Diagonals = 0
Number of My Nonzeros = 0
My Maximum Num Entries = 5
Processor Row Index Col Index Value
0 0 1 -1
0 0 5 -1
0 0 0 4
0 1 0 -1
0 1 2 -1
0 1 6 -1
0 1 1 4
0 2 1 -1
0 2 3 -1
0 2 7 -1
0 2 2 4
0 3 2 -1
0 3 4 -1
0 3 8 -1
0 3 3 4
0 4 3 -1
0 4 9 -1
0 4 4 4
0 5 6 -1
0 5 0 -1
0 5 10 -1
0 5 5 4
0 6 5 -1
0 6 7 -1
0 6 1 -1
0 6 11 -1
0 6 6 4
0 7 6 -1
0 7 8 -1
0 7 2 -1
0 7 12 -1
0 7 7 4
0 8 7 -1
0 8 9 -1
0 8 3 -1
0 8 13 -1
0 8 8 4
0 9 8 -1
0 9 4 -1
0 9 14 -1
0 9 9 4
0 10 11 -1
0 10 5 -1
0 10 15 -1
0 10 10 4
0 11 10 -1
0 11 12 -1
0 11 6 -1
0 11 16 -1
0 11 11 4
0 12 11 -1
0 12 13 -1
0 12 7 -1
0 12 17 -1
0 12 12 4
0 13 12 -1
0 13 14 -1
0 13 8 -1
0 13 18 -1
0 13 13 4
0 14 13 -1
0 14 9 -1
0 14 19 -1
0 14 14 4
0 15 16 -1
0 15 10 -1
0 15 20 -1
0 15 15 4
0 16 15 -1
0 16 17 -1
0 16 11 -1
0 16 21 -1
0 16 16 4
0 17 16 -1
0 17 18 -1
0 17 12 -1
0 17 22 -1
0 17 17 4
0 18 17 -1
0 18 19 -1
0 18 13 -1
0 18 23 -1
0 18 18 4
0 19 18 -1
0 19 14 -1
0 19 24 -1
0 19 19 4
0 20 21 -1
0 20 15 -1
0 20 25 -1
0 20 20 4
0 21 20 -1
0 21 22 -1
0 21 16 -1
0 21 26 -1
0 21 21 4
0 22 21 -1
0 22 23 -1
0 22 17 -1
0 22 27 -1
0 22 22 4
0 23 22 -1
0 23 24 -1
0 23 18 -1
0 23 28 -1
0 23 23 4
0 24 23 -1
0 24 19 -1
0 24 29 -1
0 24 24 4
0 25 26 -1
0 25 20 -1
0 25 25 4
0 26 25 -1
0 26 27 -1
0 26 21 -1
0 26 26 4
0 27 26 -1
0 27 28 -1
0 27 22 -1
0 27 27 4
0 28 27 -1
0 28 29 -1
0 28 23 -1
0 28 28 4
0 29 28 -1
0 29 24 -1
0 29 29 4
[Test w/ 1 proc passed]
Epetra::CrsMatrix
Number of Global Rows = 30
Number of Global Cols = 30
Number of Global Diagonals = 0
Number of Global Nonzeros = 0
Global Maximum Num Entries = 0
** Matrix is Lower Triangular **
** Matrix is Upper Triangular **
** Matrix has no diagonal **
Number of My Rows = 8
Number of My Cols = 8
Number of My Diagonals = 0
Number of My Nonzeros = 0
My Maximum Num Entries = 5
Epetra::CrsMatrix
Epetra::CrsMatrix
Epetra::CrsMatrix
Number of My Rows = 8
Number of My Cols = 8
Number of My Diagonals = 0
Number of My Nonzeros = 0
My Maximum Num Entries = 5
Number of My Rows = 7
Number of My Cols = 7
Number of My Diagonals = 0
Number of My Nonzeros = 0
My Maximum Num Entries = 5
Number of My Rows = 7
Number of My Cols = 7
Number of My Diagonals = 0
Number of My Nonzeros = 0
My Maximum Num Entries = 5
Processor Row Index Col Index Value
0 0 1 -1
0 0 5 -1
0 0 0 4
0 1 0 -1
0 1 2 -1
0 1 6 -1
0 1 1 4
0 2 1 -1
0 2 3 -1
0 2 7 -1
0 2 2 4
0 3 2 -1
0 3 4 -1
0 3 8 -1
0 3 3 4
0 4 3 -1
0 4 9 -1
0 4 4 4
0 5 6 -1
0 5 0 -1
0 5 10 -1
0 5 5 4
0 6 5 -1
0 6 7 -1
0 6 1 -1
0 6 11 -1
0 6 6 4
0 7 6 -1
0 7 8 -1
0 7 2 -1
0 7 12 -1
0 7 7 4
1 8 7 -1
1 8 9 -1
1 8 3 -1
1 8 13 -1
1 8 8 4
1 9 8 -1
1 9 4 -1
1 9 14 -1
1 9 9 4
1 10 11 -1
1 10 5 -1
1 10 15 -1
1 10 10 4
1 11 10 -1
1 11 12 -1
1 11 6 -1
1 11 16 -1
1 11 11 4
1 12 11 -1
1 12 13 -1
1 12 7 -1
1 12 17 -1
1 12 12 4
1 13 12 -1
1 13 14 -1
1 13 8 -1
1 13 18 -1
1 13 13 4
1 14 13 -1
1 14 9 -1
1 14 19 -1
1 14 14 4
1 15 16 -1
1 15 10 -1
1 15 20 -1
1 15 15 4
2 16 15 -1
2 16 17 -1
2 16 11 -1
2 16 21 -1
2 16 16 4
2 17 16 -1
2 17 18 -1
2 17 12 -1
2 17 22 -1
2 17 17 4
2 18 17 -1
2 18 19 -1
2 18 13 -1
2 18 23 -1
2 18 18 4
2 19 18 -1
2 19 14 -1
2 19 24 -1
2 19 19 4
2 20 21 -1
2 20 15 -1
2 20 25 -1
2 20 20 4
2 21 20 -1
2 21 22 -1
2 21 16 -1
2 21 26 -1
2 21 21 4
2 22 21 -1
2 22 23 -1
2 22 17 -1
2 22 27 -1
2 22 22 4
3 23 22 -1
3 23 24 -1
3 23 18 -1
3 23 28 -1
3 23 23 4
3 24 23 -1
3 24 19 -1
3 24 29 -1
3 24 24 4
3 25 26 -1
3 25 20 -1
3 25 25 4
3 26 25 -1
3 26 27 -1
3 26 21 -1
3 26 26 4
3 27 26 -1
3 27 28 -1
3 27 22 -1
3 27 27 4
3 28 27 -1
3 28 29 -1
3 28 23 -1
3 28 28 4
3 29 28 -1
3 29 24 -1
3 29 29 4
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex2.exe ]
Epetra::Map
Number of Global Elements = 4
Number of Global Points = 4
Maximum of all GIDs = 3
Minimum of all GIDs = 0
Index Base = 0
Constant Element Size = 1
Number of Local Elements = 4
Number of Local Points = 4
Maximum of my GIDs = 3
Minimum of my GIDs = 0
MyPID Local Index Global Index
0 0 0
0 1 1
0 2 2
0 3 3
Epetra::Map
Number of Global Elements = 0
Number of Global Points = 0
Maximum of all GIDs = -1
Minimum of all GIDs = 0
Index Base = 0
Constant Element Size = 1
Number of Local Elements = 0
Number of Local Points = 0
Maximum of my GIDs = -1
Minimum of my GIDs = 0
MyPID Local Index Global Index
[Test w/ 1 proc passed]
Epetra::Map
Epetra::Map
Epetra::Map
Epetra::Map
Number of Global Elements = 4
Number of Global Points = 4
Maximum of all GIDs = 3
Minimum of all GIDs = 0
Index Base = 0
Constant Element Size = 1
Number of Local Elements = 1
Number of Local Points = 1
Maximum of my GIDs = 0
Minimum of my GIDs = 0
MyPID Local Index Global Index
0 0 0
Number of Local Elements = 1
Number of Local Points = 1
Maximum of my GIDs = 1
Minimum of my GIDs = 1
MyPID Local Index Global Index
1 0 1
Number of Local Elements = 1
Number of Local Points = 1
Maximum of my GIDs = 2
Minimum of my GIDs = 2
MyPID Local Index Global Index
2 0 2
Number of Local Elements = 1
Number of Local Points = 1
Maximum of my GIDs = 3
Minimum of my GIDs = 3
MyPID Local Index Global Index
3 0 3
Epetra::Map
Number of Global Elements = 6
Number of Global Points = 6
Epetra::Map
Epetra::Map
Epetra::Map
Maximum of all GIDs = 5
Minimum of all GIDs = 0
Index Base = 0
Constant Element Size = 1
Number of Local Elements = 0
Number of Local Points = 0
Maximum of my GIDs = -1
Minimum of my GIDs = 0
MyPID Local Index Global Index
Number of Local Elements = 1
Number of Local Points = 1
Maximum of my GIDs = 0
Minimum of my GIDs = 0
MyPID Local Index Global Index
1 0 0
Number of Local Elements = 2
Number of Local Points = 2
Maximum of my GIDs = 2
Minimum of my GIDs = 1
MyPID Local Index Global Index
2 0 1
2 1 2
Number of Local Elements = 3
Number of Local Points = 3
Maximum of my GIDs = 5
Minimum of my GIDs = 3
MyPID Local Index Global Index
3 0 3
3 1 4
3 2 5
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex20.exe ]
Total ops: 26
Total MFLOPs for mat-vec = 3.22939
Total ops: 10
Total MFLOPs for vec-vec = 0.158848
q dot z = 2
[Test w/ 1 proc passed]
Total ops: 26
Total ops: 26
Total ops: 26
Total ops: 26
Total MFLOPs for mat-vec = 0.109239
Total MFLOPs for mat-vec = 0.127419
Total MFLOPs for mat-vec = 0.114028
Total MFLOPs for mat-vec = 0.111556
Total ops: 10
Total MFLOPs for vec-vec = 0.13152
q dot z = 2
Total ops: 10
Total ops: 10
Total ops: 10
Total MFLOPs for vec-vec = 0.0180151
Total MFLOPs for vec-vec = 0.0179226
Total MFLOPs for vec-vec = 0.0174835
q dot z = 2
q dot z = 2
q dot z = 2
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex21.exe ]
Epetra::Vector
MyPID GID Value
0 0 1
0 1 1
0 2 1
0 3 1
0 4 1
Epetra::Vector
MyPID GID Value
0 0 1
0 1 0
0 2 0
0 3 0
0 4 1
[Test w/ 1 proc passed]
This is mono-process example
Please run with one processo only
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex22.exe ]
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
0 2 2
0 3 3
0 4 4
0 -1 1
1 0 2
2 1 3
3 2 4
4 3 -1
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
0 2 2
0 3 3
0 4 4
Epetra::Vector
MyPID GID Value
0 0 -1
0 1 0
0 2 0
0 3 0
0 4 5
[Test w/ 1 proc passed]
Epetra::Vector
Epetra::Vector
Epetra::Vector
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
1 2 2
2 3 3
3 4 4
0 -1 2
1 0 1
Epetra::Vector
2 0 1
Epetra::Vector
4 0 -1
Epetra::Vector
3 0 1
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
1 2 2
2 3 3
3 4 4
Epetra::Vector
MyPID GID Value
Epetra::Vector
Epetra::Vector
Epetra::Vector
0 0 -1
0 1 0
1 2 0
2 3 0
3 4 5
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex23.exe ]
Epetra::CrsMatrix
Number of Global Rows = 10
Number of Global Cols = 10
Number of Global Diagonals = 10
Number of Global Nonzeros = 10
Global Maximum Num Entries = 1
** Matrix is Lower Triangular **
** Matrix is Upper Triangular **
Number of My Rows = 10
Number of My Cols = 10
Number of My Diagonals = 10
Number of My Nonzeros = 10
My Maximum Num Entries = 1
Processor Row Index Col Index Value
0 0 0 0
0 1 1 1
0 2 2 2
0 3 3 3
0 4 4 4
0 5 5 5
0 6 6 6
0 7 7 7
0 8 8 8
0 9 9 9
[Test w/ 1 proc passed]
Epetra::CrsMatrix
Epetra::CrsMatrix
Epetra::CrsMatrix
Epetra::CrsMatrix
Number of Global Rows = 10
Number of Global Cols = 10
Number of Global Diagonals = 10
Number of Global Nonzeros = 10
Global Maximum Num Entries = 1
** Matrix is Lower Triangular **
** Matrix is Upper Triangular **
Number of My Rows = 3
Number of My Cols = 3
Number of My Diagonals = 3
Number of My Nonzeros = 3
My Maximum Num Entries = 1
Number of My Rows = 3
Number of My Cols = 3
Number of My Diagonals = 3
Number of My Nonzeros = 3
My Maximum Num Entries = 1
Number of My Rows = 2
Number of My Cols = 2
Number of My Diagonals = 2
Number of My Nonzeros = 2
My Maximum Num Entries = 1
Number of My Rows = 2
Number of My Cols = 2
Number of My Diagonals = 2
Number of My Nonzeros = 2
My Maximum Num Entries = 1
Processor Row Index Col Index Value
0 0 0 0
0 1 1 1
0 2 2 2
1 3 3 3
1 4 4 4
1 5 5 5
2 6 6 6
2 7 7 7
3 8 8 8
3 9 9 9
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex24.exe ]
[Test w/ 1 proc passed]
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex25.exe ]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Max norm of residual = 2.6e-09
Two norm of residual = 4.718e-09
Scaled two norm of residual = 7.224e-08
The residual using MSR format and exact solution is 7.224e-08
Epetra::Vector
MyPID GID Value
0 0 -0.0943546
0 1 23555.2
0 2 -255606
0 3 -45232.2
0 4 44975.8
0 5 -84109.3
0 6 4114.6
0 7 177462
0 8 -182423
0 9 -8678.71
0 10 -101633
0 11 -714862
0 12 94295.3
0 13 -711319
0 14 128970
0 15 -1.05311e+06
0 16 -756.596
0 17 299379
0 18 778063
0 19 -60344.3
0 20 -673754
0 21 279365
0 22 1.21344e+06
0 23 372241
0 24 -564432
0 25 -44498.1
0 26 -186267
2.34535e+06[Test w/ 1 proc passed]
*ERR* can be used only with one process
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex3.exe ]
[Test w/ 1 proc passed]
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex4.exe ]
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 1 2 3 4
[Test w/ 1 proc passed]
Epetra::SerialDenseVector
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 1 2 3 4
Data access mode: Copy
A_Copied: yes
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 1 2 3 4
Epetra::SerialDenseVector
Data access mode: Copy
A_Copied: yes
Length(M): 5
0 1 2 3 4
Length(M): 5
0 1 2 3 4
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex5.exe ]
extracted value[0] = 0
extracted value[1] = 1
extracted value[2] = 2
extracted value[3] = 3
extracted value[4] = 4
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
0 2 2
0 3 3
0 4 4
Epetra::Vector
MyPID GID Value
0 0 0
0 1 10
0 2 20
0 3 30
0 4 40
[Test w/ 1 proc passed]
extracted value[0] = 0
extracted value[0] = 0
extracted value[0] = 0
extracted value[0] = 0
Epetra::Vector
Epetra::Vector
Epetra::Vector
extracted value[1] = 1
Epetra::Vector
MyPID GID Value
0 0 0
0 1 1
1 2 0
2 3 0
3 4 0
Epetra::Vector
MyPID GID Value
Epetra::Vector
Epetra::Vector
Epetra::Vector
0 0 0
0 1 10
1 2 0
2 3 0
3 4 0
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex6.exe ]
on proc 0, x[0] = 0
on proc 0, x[1] = 1
on proc 0, x[2] = 2
on proc 0, x[3] = 3
on proc 0, x[4] = 4
on proc 0, x[5] = 5
on proc 0, x[6] = 6
on proc 0, x[7] = 7
on proc 0, x[8] = 8
on proc 0, x[9] = 9
Epetra::Vector
MyPID GID Value
0 0 0
0 1 10
0 2 20
0 3 30
0 4 40
0 5 50
0 6 60
0 7 70
0 8 80
0 9 90
[Test w/ 1 proc passed]
on proc 0, x[0] = 0
on proc 3, x[0] = 0
on proc 1, x[0] = 0
on proc 1, x[1] = 1
on proc 1, x[2] = 2
Epetra::Vector
on proc 2, x[0] = 0
on proc 2, x[1] = 1
Epetra::Vector
on proc 3, x[1] = 1
Epetra::Vector
on proc 0, x[1] = 1
on proc 0, x[2] = 2
Epetra::Vector
MyPID GID Value
0 0 0
0 1 10
0 2 20
1 3 0
1 4 10
1 5 20
2 6 0
2 7 10
3 8 0
3 9 10
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex7.exe ]
on proc 0, x[0] = 0
on proc 0, x[1] = 1
on proc 0, x[2] = 2
on proc 0, x[3] = 3
on proc 0, x[4] = 4
on proc 0, x[5] = 5
on proc 0, x[6] = 6
on proc 0, x[7] = 7
on proc 0, x[8] = 8
on proc 0, x[9] = 9
on proc 0, x[0] = 1000
on proc 0, x[1] = 1001
on proc 0, x[2] = 1002
on proc 0, x[3] = 1003
on proc 0, x[4] = 1004
on proc 0, x[5] = 1005
on proc 0, x[6] = 1006
on proc 0, x[7] = 1007
on proc 0, x[8] = 1008
on proc 0, x[9] = 1009
Epetra::MultiVector
MyPID GID Value Value
0 0 0 10000
0 1 10 10010
0 2 20 10020
0 3 30 10030
0 4 40 10040
0 5 50 10050
0 6 60 10060
0 7 70 10070
0 8 80 10080
0 9 90 10090
[Test w/ 1 proc passed]
on proc 0, x[0] = 0
on proc 1, x[0] = 0
on proc 2, x[0] = 0
on proc 3, x[0] = 0
on proc 1, x[1] = 1
on proc 2, x[1] = 1
on proc 3, x[1] = 1
on proc 1, x[2] = 2
on proc 2, x[0] = 1000
on proc 3, x[0] = 1000
on proc 1, x[0] = 1000
on proc 2, x[1] = 1001
on proc 3, x[1] = 1001
on proc 1, x[1] = 1001
Epetra::MultiVector
Epetra::MultiVector
on proc 1, x[2] = 1002
Epetra::MultiVector
on proc 0, x[1] = 1
on proc 0, x[2] = 2
on proc 0, x[0] = 1000
on proc 0, x[1] = 1001
on proc 0, x[2] = 1002
Epetra::MultiVector
MyPID GID Value Value
0 0 0 10000
0 1 10 10010
0 2 20 10020
1 3 0 10000
1 4 10 10010
1 5 20 10020
2 6 0 10000
2 7 10 10010
3 8 0 10000
3 9 10 10010
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex8.exe ]
Epetra::Vector
MyPID GID Value
0 0 123
0 1 1
0 2 2
0 3 3
0 4 4
0 5 5
0 6 6
0 7 7
0 8 8
0 9 9
Epetra::Vector
MyPID GID Value
0 0 -0
0 1 -1
0 2 -2
0 3 -3
0 4 -4
0 5 -5
0 6 -6
0 7 -7
0 8 -8
0 9 -9
[Test w/ 1 proc passed]
Epetra::Vector
MyPID GID Value
Epetra::Vector
Epetra::Vector
Epetra::Vector
0 0 123
0 1 1
0 2 2
0 3 3
0 4 4
0 5 5
0 6 6
0 7 7
0 8 8
0 9 9
1 10 123
1 11 1
1 12 2
1 13 3
1 14 4
1 15 5
1 16 6
1 17 7
1 18 8
1 19 9
2 20 123
2 21 1
2 22 2
2 23 3
2 24 4
2 25 5
2 26 6
2 27 7
2 28 8
2 29 9
3 30 123
3 31 1
3 32 2
3 33 3
3 34 4
3 35 5
3 36 6
3 37 7
3 38 8
3 39 9
Epetra::Vector
MyPID GID Value
Epetra::Vector
Epetra::Vector
Epetra::Vector
0 0 -0
0 1 -1
0 2 -2
0 3 -3
0 4 -4
0 5 -5
0 6 -6
0 7 -7
0 8 -8
0 9 -9
1 10 -0
1 11 -1
1 12 -2
1 13 -3
1 14 -4
1 15 -5
1 16 -6
1 17 -7
1 18 -8
1 19 -9
2 20 -0
2 21 -1
2 22 -2
2 23 -3
2 24 -4
2 25 -5
2 26 -6
2 27 -7
2 28 -8
2 29 -9
3 30 -0
3 31 -1
3 32 -2
3 33 -3
3 34 -4
3 35 -5
3 36 -6
3 37 -7
3 38 -8
3 39 -9
[Test w/ 4 procs passed]
[DIDASKO Test epetra : ex9.exe ]
Epetra::Vector
MyPID GID Value
0 0 10
0 1 10
0 2 10
Epetra::Vector
MyPID GID Value
0 0 10
0 1 10
0 2 10
0 3 0
[Test w/ 1 proc passed]
Epetra::Vector
Epetra::Vector
Epetra::Vector
Epetra::Vector
MyPID GID Value
0 0 10
0 1 10
0 2 10
1 1 20
1 2 20
1 3 20
2 1 30
2 2 30
2 3 30
3 1 40
3 2 40
3 3 40
Epetra::Vector
Epetra::Vector
Epetra::Vector
Epetra::Vector
MyPID GID Value
0 0 10
0 1 100
0 2 100
0 3 90
[Test w/ 4 procs passed]
[DIDASKO Test epetraext : ex1.exe ]
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
[Test w/ 1 proc passed]
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
[Test w/ 4 procs passed]
[DIDASKO Test epetraext : ex2.exe ]
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
[Test w/ 1 proc passed]
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
Please configure Didasko with:
--enable-epetra
--enable-epetraext
--enable-epetraext-zoltan
[Test w/ 4 procs passed]
[DIDASKO Test ifpack : ex1.exe ]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
8.09767e-06
Condition number estimate (level-of-fill = 1) = 8.09767e-06
*******************************************************
***** Preconditioned CG solution
***** Ifpack_CrsIct Preconditioner: LevelFill = 1 Overlap = 0
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 20 residual = 8.192605e+02
iter: 40 residual = 1.727123e+00
iter: 60 residual = 1.588337e+00
iter: 74 residual = 3.726614e-05
Solution time: 0.001748 (sec.)
total iterations: 74
[Test w/ 1 proc passed]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
8.43803e-06
Condition number estimate (level-of-fill = 1) = 8.43803e-06
8.43803e-06
8.43803e-06
8.43803e-06
*******************************************************
***** Preconditioned CG solution
***** Ifpack_CrsIct Preconditioner: LevelFill = 1 Overlap = 0
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 20 residual = 3.657374e+00
iter: 40 residual = 3.075318e+00
iter: 60 residual = 1.928264e+01
iter: 79 residual = 2.851330e-06
Solution time: 0.535705 (sec.)
total iterations: 79
[Test w/ 4 procs passed]
[DIDASKO Test ifpack : ex2.exe ]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
*******************************************************
***** Preconditioned GMRES solution
***** Ifpack_CrsRiluk Preconditioner: LevelFill = 0 Overlap = 2 Athresh = 0 Rthresh = 1
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 9.965582e-01
iter: 2 residual = 9.958537e-01
iter: 3 residual = 9.839354e-01
iter: 4 residual = 5.978474e-01
iter: 5 residual = 5.482668e-01
iter: 6 residual = 2.170951e-01
iter: 7 residual = 3.972447e-02
iter: 8 residual = 3.217487e-03
iter: 9 residual = 5.303572e-04
iter: 10 residual = 5.391312e-06
iter: 11 residual = 9.203910e-08
Solution time: 0.001405 (sec.)
total iterations: 11
[Test w/ 1 proc passed]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
*******************************************************
***** Preconditioned GMRES solution
***** Ifpack_CrsRiluk Preconditioner: LevelFill = 0 Overlap = 2 Athresh = 0 Rthresh = 1
***** No scaling
*******************************************************
Epetra ERROR ***************************************************************
Warning: the GMRES Hessenberg matrix is ill-conditioned. This may
indicate that the application matrix is singular. In this case, GMRES
may have a least-squares solution.
***************************************************************
Epetra ERROR -4, ../../../.././packages/aztecoo/src/AztecOO.cpp, line 779
iter: 0 residual = 1.000000e+00
iter: 1 residual = 8.731825e-01
iter: 2 residual = 7.945319e-01
iter: 3 residual = 7.934453e-01
iter: 4 residual = 6.991523e-01
iter: 5 residual = 6.958022e-01
iter: 6 residual = 6.730441e-01
iter: 7 residual = 6.636096e-01
iter: 8 residual = 6.579003e-01
iter: 9 residual = 6.082321e-01
iter: 10 residual = 6.069126e-01
iter: 11 residual = 6.005440e-01
iter: 12 residual = 5.982809e-01
iter: 13 residual = 5.812388e-01
iter: 14 residual = 5.773504e-01
Solver: gmres
number of iterations: 15
Actual residual = 3.7712e-02 Recursive residual = 3.7712e-02
Calculated Norms Requested Norm
-------------------------------------------- --------------
||r||_2 / ||r0||_2: 5.773504e-01 5.000000e-06
-4, Epetra ERROR -4, ../../../.././packages/aztecoo/src/AztecOO.cpp, line 779
Epetra ERROR -4, ../../../.././packages/aztecoo/src/AztecOO.cpp, line 779
../../../.././packages/aztecoo/src/AztecOO.cpp, line 779
Solution time: 0.101974 (sec.)
total iterations: 15
[Test w/ 4 procs passed]
[DIDASKO Test ml : ex1.exe ]
**************************************************************
* ML Aggregation information *
==============================================================
ML_Aggregate : ordering = natural.
ML_Aggregate : min nodes/aggr = 2
ML_Aggregate : max neigh selected = 0
ML_Aggregate : attach scheme = MAXLINK
ML_Aggregate : strong threshold = 0.000000e+00
ML_Aggregate : P damping factor = 1.333333e+00
ML_Aggregate : number of PDEs = 1
ML_Aggregate : number of null vec = 1
ML_Aggregate : smoother drop tol = 0.000000e+00
ML_Aggregate : max coarse size = 1
ML_Aggregate : max no. of levels = 10
**************************************************************
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 0) begins
ML_Aggregate_CoarsenUncoupled : current level = 0
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 460 (Nrows=100)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 88 (100)
Aggregation(UC) : Phase 1 - total aggregates = 20
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 88
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 20
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 20
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 1) begins
ML_Aggregate_CoarsenUncoupled : current level = 1
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 140 (Nrows=20)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 16 (20)
Aggregation(UC) : Phase 1 - total aggregates = 3
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 16
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 3
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 3
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 2) begins
ML_Aggregate_CoarsenUncoupled : current level = 2
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 9 (Nrows=3)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 3 (3)
Aggregation(UC) : Phase 1 - total aggregates = 1
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 3
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 1
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 1
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
Smoothed Aggregation : operator complexity = 1.326087e+00.
*******************************************************
***** Preconditioned CG solution
***** Epetra ML::MultilLevelOperator
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 3.139016e-02
iter: 2 residual = 1.436644e-03
iter: 3 residual = 5.129060e-05
iter: 4 residual = 1.774730e-06
iter: 5 residual = 6.099343e-08
iter: 6 residual = 2.111424e-09
iter: 7 residual = 8.724768e-11
iter: 8 residual = 2.344554e-12
iter: 9 residual = 4.274051e-14
Solution time: 0.003546 (sec.)
total iterations: 9
||b-Ax||_2 = 2.95837e-13
||x_exact - x||_2 = 1.72271e-13
[Test w/ 1 proc passed]
**************************************************************
* ML Aggregation information *
==============================================================
ML_Aggregate : ordering = natural.
ML_Aggregate : min nodes/aggr = 2
ML_Aggregate : max neigh selected = 0
ML_Aggregate : attach scheme = MAXLINK
ML_Aggregate : strong threshold = 0.000000e+00
ML_Aggregate : P damping factor = 1.333333e+00
ML_Aggregate : number of PDEs = 1
ML_Aggregate : number of null vec = 1
ML_Aggregate : smoother drop tol = 0.000000e+00
ML_Aggregate : max coarse size = 1
ML_Aggregate : max no. of levels = 10
**************************************************************
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 0) begins
ML_Aggregate_CoarsenUncoupled : current level = 0
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 460 (Nrows=100)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 84 (100)
Aggregation(UC) : Phase 1 - total aggregates = 24
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 84
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 24
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 24
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 1) begins
ML_Aggregate_CoarsenUncoupled : current level = 1
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 216 (Nrows=24)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 18 (24)
Aggregation(UC) : Phase 1 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 18
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 2) begins
ML_Aggregate_CoarsenUncoupled : current level = 2
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 36 (Nrows=6)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 4 (6)
Aggregation(UC) : Phase 1 - total aggregates = 2
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 4
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 2
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 4
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 2 and singletons = 2
ML_Gen_MGHierarchy : applying coarsening
ML_Gen_MGHierarchy : Gen_RAP
ML_Gen_MGHierarchy : Gen_RAP done
ML_Gen_MGHierarchy : applying coarsening
ML_Aggregate_Coarsen (level 3) begins
ML_Aggregate_CoarsenUncoupled : current level = 3
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 16 (Nrows=4)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 0 (4)
Aggregation(UC) : Phase 1 - total aggregates = 0
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 0
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 4
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 4 and singletons = 4
Smoothed Aggregation : operator complexity = 1.617391e+00.
*******************************************************
***** Preconditioned CG solution
***** Epetra ML::MultilLevelOperator
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 1 residual = 4.485832e-02
iter: 2 residual = 3.621612e-03
iter: 3 residual = 1.924737e-04
iter: 4 residual = 1.932894e-05
iter: 5 residual = 8.610166e-07
iter: 6 residual = 4.861599e-08
iter: 7 residual = 2.728677e-09
iter: 8 residual = 2.125829e-10
iter: 9 residual = 1.369591e-11
iter: 10 residual = 6.331265e-13
Solution time: 0.103319 (sec.)
total iterations: 10
||b-Ax||_2 = 4.38636e-12
||x_exact - x||_2 = 1.87816e-12
[Test w/ 4 procs passed]
[DIDASKO Test ml : ex2.exe ]
------------------------------------------------------------------------------
***
*** ML_Epetra::MultiLevelPreconditioner
***
Matrix has 1000 rows and 6400 nonzeros, distributed over 1 process(es)
The linear system matrix is an Epetra_CrsMatrix
Default values for `SA'
Maximum number of levels = 10
Using increasing levels. Finest level = 0, coarsest level = 9
Aggregation threshold = 0
Max coarse size = 16
R and P smoothing : P = (I-\omega A) P_t, R = P^T
R and P smoothing : \omega = 1.3333/lambda_max
Using `Anorm' scheme for eigen-computations
Number of PDE equations = 1
ML_Aggregate_Coarsen (level 0) begins
ML_Aggregate_CoarsenUncoupled : current level = 0
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 6400 (Nrows=1000)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 816 (1000)
Aggregation(UC) : Phase 1 - total aggregates = 130
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 816
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 130
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 130
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
Prolongator/Restriction smoother (level 0) : damping factor = 6.666500e-01
Prolongator/Restriction smoother (level 0) : ( = 1.333300e+00 / 2.000000e+00)
Gen_Prolongator (level 0) : Max eigenvalue = 2.000000e+00
ML_Aggregate_Coarsen (level 1) begins
ML_Aggregate_CoarsenUncoupled : current level = 1
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 2704 (Nrows=130)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 84 (130)
Aggregation(UC) : Phase 1 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 84
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 6
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
Prolongator/Restriction smoother (level 1) : damping factor = 6.505775e-01
Prolongator/Restriction smoother (level 1) : ( = 1.333300e+00 / 2.049410e+00)
Gen_Prolongator (level 1) : Max eigenvalue = 2.049410e+00
Smoothed Aggregation : operator complexity = 1.428125e+00.
Number of actual levels : 3
Smoother (level 0) : # global rows = 1000, # estim. global nnz = 6400
Smoother (level 0) : symmetric Gauss-Seidel (sweeps=2,omega=0.67,both)
Smoother (level 0) : Setup time : 0.00015311 (s)
Smoother (level 1) : # global rows = 130, # estim. global nnz = 2704
Smoother (level 1) : symmetric Gauss-Seidel (sweeps=2,omega=0.67,both)
Smoother (level 1) : Setup time : 0.000127962 (s)
Amesos (level 2) : NumGlobalRows = 6
Amesos (level 2) : NumGlobalNonzeros = 36
Amesos (level 2) : Fill-in = 100 %
Amesos (level 2) : Building KLU
Amesos (level 2) : Time for symbolic fact = 5.50856e-05 (s)
Amesos (level 2) : Time for numerical fact = 3.5011e-05 (s)
------------------------------------------------------------------------------
*******************************************************
***** Preconditioned GMRES (with condnum) solution
***** ML (L=3, SGS_pre0/SGS_post0, ~/Amesos_KLU_2)
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 9 residual = 5.411234e-14
-----------------------------------------------------
Analysis of the Hessember matrix:
smallest eigenvalue (in module) = 8.529388e-01
largest eigenvalue (in module) = 9.995951e-01
estimated condition number = 1.000000e+00
-----------------------------------------------------
Solution time: 0.052954 (sec.)
total iterations: 9
max number of levels = 3
number of construction phases = 1
number of initialization phases = 1
Amesos (level 2) : Time for solve = 0.000103807 (s)
Amesos (level 2) : avg time for solve = 1.03807e-05 (s) ( # solves = 10)
------------------------------------------------------------------------------
ML time information total avg
1- Construction time = 0.00887007 0.00887007 (s)
2- Time for all applications = 0.0499098 0.00499098 (s)
(w/o first application time)
3- Time for first application(s) = 0.00513609 0.00513609 (s)
4- Total time required by ML so far is 0.0639159 (s)
(constr + all applications)
------------------------------------------------------------------------------
||b-Ax||_2 = 1.56809e-12
||x_exact - x||_2 = 1.40525e-12
Total Time = 0.068345
[Test w/ 1 proc passed]
------------------------------------------------------------------------------
***
*** ML_Epetra::MultiLevelPreconditioner
***
Matrix has 1000 rows and 6400 nonzeros, distributed over 4 process(es)
The linear system matrix is an Epetra_CrsMatrix
Default values for `SA'
Maximum number of levels = 10
Using increasing levels. Finest level = 0, coarsest level = 9
Aggregation threshold = 0
Max coarse size = 16
R and P smoothing : P = (I-\omega A) P_t, R = P^T
R and P smoothing : \omega = 1.3333/lambda_max
Using `Anorm' scheme for eigen-computations
Number of PDE equations = 1
ML_Aggregate_Coarsen (level 0) begins
ML_Aggregate_CoarsenUncoupled : current level = 0
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 6400 (Nrows=1000)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 860 (1000)
Aggregation(UC) : Phase 1 - total aggregates = 156
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 860
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 156
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 156
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
Prolongator/Restriction smoother (level 0) : damping factor = 6.666500e-01
Prolongator/Restriction smoother (level 0) : ( = 1.333300e+00 / 2.000000e+00)
Gen_Prolongator (level 0) : Max eigenvalue = 2.000000e+00
ML_Aggregate_Coarsen (level 1) begins
ML_Aggregate_CoarsenUncoupled : current level = 1
ML_Aggregate_CoarsenUncoupled : current eps = 0.000000e+00
Aggregation(UVB) : Total nonzeros = 3608 (Nrows=156)
Aggregation(UC) : Phase 0 - no. of bdry pts = 0
Aggregation(UC) : Phase 1 - nodes aggregated = 114 (156)
Aggregation(UC) : Phase 1 - total aggregates = 12
Aggregation(UC_Phase2_3) : Phase 1 - nodes aggregated = 114
Aggregation(UC_Phase2_3) : Phase 1 - total aggregates = 12
Aggregation(UC_Phase2_3) : Phase 2a- additional aggregates = 0
Aggregation(UC_Phase2_3) : Phase 2 - total aggregates = 12
Aggregation(UC_Phase2_3) : Phase 2 - boundary nodes = 0
Aggregation(UC_Phase2_3) : Phase 3 - leftovers = 0 and singletons = 0
Prolongator/Restriction smoother (level 1) : damping factor = 6.355308e-01
Prolongator/Restriction smoother (level 1) : ( = 1.333300e+00 / 2.097931e+00)
Gen_Prolongator (level 1) : Max eigenvalue = 2.097931e+00
Smoothed Aggregation : operator complexity = 1.586250e+00.
Number of actual levels : 3
Smoother (level 0) : # global rows = 1000, # estim. global nnz = 6400
Smoother (level 0) : symmetric Gauss-Seidel (sweeps=2,omega=0.67,both)
Smoother (level 0) : Setup time : 0.000215078 (s)
Smoother (level 1) : # global rows = 156, # estim. global nnz = 3608
Smoother (level 1) : symmetric Gauss-Seidel (sweeps=2,omega=0.67,both)
Smoother (level 1) : Setup time : 0.000222911 (s)
Amesos (level 2) : NumGlobalRows = 12
Amesos (level 2) : NumGlobalNonzeros = 144
Amesos (level 2) : Fill-in = 100 %
Amesos (level 2) : Building KLU
Amesos (level 2) : Time for symbolic fact = 0.0219221 (s)
Amesos (level 2) : Time for numerical fact = 0.00336199 (s)
------------------------------------------------------------------------------
*******************************************************
***** Preconditioned GMRES (with condnum) solution
***** ML (L=3, SGS_pre0/SGS_post0, ~/Amesos_KLU_2)
***** No scaling
*******************************************************
iter: 0 residual = 1.000000e+00
iter: 9 residual = 1.982167e-13
-----------------------------------------------------
Analysis of the Hessember matrix:
smallest eigenvalue (in module) = 8.367262e-01
largest eigenvalue (in module) = 9.994585e-01
estimated condition number = 1.000000e+00
-----------------------------------------------------
Solution time: 0.186493 (sec.)
total iterations: 9
max number of levels = 3
number of construction phases = 1
number of initialization phases = 1
Amesos (level 2) : Time for solve = 0.0981794 (s)
Amesos (level 2) : avg time for solve = 0.00981794 (s) ( # solves = 10)
------------------------------------------------------------------------------
ML time information total avg
1- Construction time = 0.0544261 0.0544261 (s)
2- Time for all applications = 0.135922 0.0135922 (s)
(w/o first application time)
3- Time for first application(s) = 0.00548706 0.00548706 (s)
4- Total time required by ML so far is 0.195835 (s)
(constr + all applications)
------------------------------------------------------------------------------
||b-Ax||_2 = 5.74484e-12
||x_exact - x||_2 = 5.86813e-12
Total Time = 0.395381
[Test w/ 4 procs passed]
[DIDASKO Test nox : ex1.exe ]
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.590e-01 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 2.102e-01 step = 1.000e+00 dx = 3.953e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 1.009e-02 step = 1.000e+00 dx = 8.461e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 2.877e-05 step = 1.000e+00 dx = 4.510e-03 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 2.034e-05 < 2.530e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.92e-16 [unused]
Number of Linear Iterations = 2 [unused]
Total Number of Linear Iterations = 6 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 3 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 2.88e-05 [unused]
Nonlinear Iterations = 3 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Computed solution :
Epetra::Vector
MyPID GID Value
0 0 0.786
0 1 0.618
Exact solution :
Epetra::Vector
MyPID GID Value
0 0 0.786
0 1 0.618
[Test w/ 1 proc passed]
This example can be run with one process only!
[Test w/ 4 procs passed]
[DIDASKO Test nox : ex2.exe ]
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.477e+00 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 5.186e-01 step = 1.000e+00 dx = 5.485e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 5.726e-02 step = 1.000e+00 dx = 5.656e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 6.300e-03 step = 1.000e+00 dx = 6.269e-03
************************************************************************
************************************************************************
-- Nonlinear Solver Step 4 --
f = 6.940e-04 step = 1.000e+00 dx = 6.899e-04
************************************************************************
************************************************************************
-- Nonlinear Solver Step 5 --
f = 7.644e-05 step = 1.000e+00 dx = 7.600e-05 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 1.396e-05 < 1.000e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.38e-15 [unused]
Number of Linear Iterations = 9 [unused]
Total Number of Linear Iterations = 45 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 5 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 7.64e-05 [unused]
Nonlinear Iterations = 5 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Computed solution :
Epetra::Vector
MyPID GID Value
0 0 -0.0461
0 1 -0.0663
0 2 -0.0721
0 3 -0.0663
0 4 -0.0461
0 5 -0.0706
0 6 -0.104
0 7 -0.114
0 8 -0.104
0 9 -0.0706
0 10 -0.0813
0 11 -0.122
0 12 -0.134
0 13 -0.122
0 14 -0.0813
0 15 -0.0813
0 16 -0.122
0 17 -0.134
0 18 -0.122
0 19 -0.0813
0 20 -0.0706
0 21 -0.104
0 22 -0.114
0 23 -0.104
0 24 -0.0706
0 25 -0.0461
0 26 -0.0663
0 27 -0.0721
0 28 -0.0663
0 29 -0.0461
[Test w/ 1 proc passed]
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.477e+00 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.477e+00 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.477e+00 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 0 --
f = 5.477e+00 step = 0.000e+00 dx = 0.000e+00
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 5.186e-01 step = 1.000e+00 dx = 5.485e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 5.186e-01 step = 1.000e+00 dx = 5.485e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 5.186e-01 step = 1.000e+00 dx = 5.485e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 1 --
f = 5.186e-01 step = 1.000e+00 dx = 5.485e-01
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 5.726e-02 step = 1.000e+00 dx = 5.656e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 5.726e-02 step = 1.000e+00 dx = 5.656e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 5.726e-02 step = 1.000e+00 dx = 5.656e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 2 --
f = 5.726e-02 step = 1.000e+00 dx = 5.656e-02
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 6.300e-03 step = 1.000e+00 dx = 6.269e-03
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 6.300e-03 step = 1.000e+00 dx = 6.269e-03
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 6.300e-03 step = 1.000e+00 dx = 6.269e-03
************************************************************************
************************************************************************
-- Nonlinear Solver Step 3 --
f = 6.300e-03 step = 1.000e+00 dx = 6.269e-03
************************************************************************
************************************************************************
-- Nonlinear Solver Step 4 --
f = 6.940e-04 step = 1.000e+00 dx = 6.899e-04
************************************************************************
************************************************************************
-- Nonlinear Solver Step 4 --
f = 6.940e-04 step = 1.000e+00 dx = 6.899e-04
************************************************************************
************************************************************************
-- Nonlinear Solver Step 4 --
f = 6.940e-04 step = 1.000e+00 dx = 6.899e-04
************************************************************************
************************************************************************
-- Nonlinear Solver Step 4 --
f = 6.940e-04 step = 1.000e+00 dx = 6.899e-04
************************************************************************
************************************************************************
-- Nonlinear Solver Step 5 --
f = 7.644e-05 step = 1.000e+00 dx = 7.600e-05 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 1.396e-05 < 1.000e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Nonlinear Solver Step 5 --
f = 7.644e-05 step = 1.000e+00 dx = 7.600e-05 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 1.396e-05 < 1.000e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.13e-15 [unused]
Number of Linear Iterations = 9 [unused]
Total Number of Linear Iterations = 45 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 5 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 7.64e-05 [unused]
Nonlinear Iterations = 5 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Computed solution :
Epetra::Vector
MyPID GID Value
0 0 -0.0461
0 1 -0.0663
0 2 -0.0721
0 3 -0.0663
0 4 -0.0461
0 5 -0.0706
0 6 -0.104
0 7 -0.114
************************************************************************
-- Nonlinear Solver Step 5 --
f = 7.644e-05 step = 1.000e+00 dx = 7.600e-05 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 1.396e-05 < 1.000e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.13e-15 [unused]
Number of Linear Iterations = 9 [unused]
Total Number of Linear Iterations = 45 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 5 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 7.64e-05 [unused]
Nonlinear Iterations = 5 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Epetra::Vector
************************************************************************
-- Nonlinear Solver Step 5 --
f = 7.644e-05 step = 1.000e+00 dx = 7.600e-05 (Converged!)
************************************************************************
************************************************************************
-- Final Status Test Results --
Converged....OR Combination ->
Converged....F-Norm = 1.396e-05 < 1.000e-04
(Length-Scaled Two-Norm, Relative Tolerance)
??...........Number of Iterations = -1 < 20
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.13e-15 [unused]
Number of Linear Iterations = 9 [unused]
Total Number of Linear Iterations = 45 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 5 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 7.64e-05 [unused]
Nonlinear Iterations = 5 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Epetra::Vector
************************************************************************
-- Parameter List From Solver --
Direction ->
Method = "Newton" [default]
Newton ->
Linear Solver ->
Max Iterations = 400 [default]
Output ->
Achieved Tolerance = 1.13e-15 [unused]
Number of Linear Iterations = 9 [unused]
Total Number of Linear Iterations = 45 [unused]
Tolerance = 1e-10 [default]
Rescue Bad Newton Solve = true [default]
Line Search ->
Method = "More'-Thuente"
More'-Thuente ->
Curvature Condition = 1 [default]
Default Step = 1 [default]
Interval Width = 1e-15 [default]
Max Iters = 20 [default]
Maximum Step = 1e+06 [default]
Minimum Step = 1e-12 [default]
Optimize Slope Calculation = false [default]
Recovery Step = 1 [default]
Recovery Step Type = "Constant" [default]
Sufficient Decrease = 0.0001 [default]
Sufficient Decrease Condition = "Armijo-Goldstein" [default]
Output ->
Total Number of Failed Line Searches = 0 [unused]
Total Number of Line Search Calls = 5 [unused]
Total Number of Line Search Inner Iterations = 0 [unused]
Total Number of Non-trivial Line Searches = 0 [unused]
Nonlinear Solver = "Line Search Based"
Output ->
2-Norm of Residual = 7.64e-05 [unused]
Nonlinear Iterations = 5 [unused]
Printing ->
MyPID = 0 [default]
Output Information = 2
Output Precision = 3 [default]
Output Processor = 0 [default]
Solver Options ->
[empty list]
Epetra::Vector
1 8 -0.104
1 9 -0.0706
1 10 -0.0813
1 11 -0.122
1 12 -0.134
1 13 -0.122
1 14 -0.0813
1 15 -0.0813
2 16 -0.122
2 17 -0.134
2 18 -0.122
2 19 -0.0813
2 20 -0.0706
2 21 -0.104
2 22 -0.114
3 23 -0.104
3 24 -0.0706
3 25 -0.0461
3 26 -0.0663
3 27 -0.0721
3 28 -0.0663
3 29 -0.0461
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex1.exe ]
The matrices are the same!
The matrices are different!
Teuchos::Object
Values_copied : yes
Rows : 3
Columns : 3
LDA : 3
0.680375 0.59688 -0.329554
-0.211234 0.823295 0.536459
0.566198 -0.604897 -0.444451
[Test w/ 1 proc passed]
The matrices are the same!
The matrices are the same!
The matrices are the same!
The matrices are the same!
The matrices are different!
The matrices are different!
The matrices are different!
Teuchos::Object
Teuchos::Object
Teuchos::Object
Values_copied : yes
Values_copied : yes
Values_copied : yes
Rows : 3
Rows : 3
Rows : 3
Columns : 3
Columns : 3
Columns : 3
LDA : 3
LDA : 3
LDA : 3
0.680375 0.59688 -0.329554
0.680375 0.59688 -0.329554
0.680375 0.59688 -0.329554
-0.211234 0.823295 0.536459
-0.211234 0.823295 0.536459
-0.211234 0.823295 0.536459
0.566198 -0.604897 -0.444451
0.566198 -0.604897 -0.444451
0.566198 -0.604897 -0.444451
The matrices are different!
Teuchos::Object
Values_copied : yes
Rows : 3
Columns : 3
LDA : 3
0.680375 0.59688 -0.329554
-0.211234 0.823295 0.536459
0.566198 -0.604897 -0.444451
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex2.exe ]
The index of the maximum magnitude entry of x[] is the 10-th and x[ 9 ] = 18
[Test w/ 1 proc passed]
The index of the maximum magnitude entry of x[] is the 10-th and x[ 9 ] = 18
The index of the maximum magnitude entry of x[] is the 10-th and x[ 9 ] = 18
The index of the maximum magnitude entry of x[] is the 10-th and x[ 9 ] = 18
The index of the maximum magnitude entry of x[] is the 10-th and x[ 9 ] = 18
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex3.exe ]
Teuchos::Object
Values_copied : yes
Length : 4
4.29175 -1.3688 5.6716 -3.69445
[Test w/ 1 proc passed]
Teuchos::Object
Teuchos::Object
Teuchos::Object
Teuchos::Object
Values_copied : yes
Values_copied : yes
Values_copied : yes
Length : 4
Length : 4
4.29175 -1.3688 5.6716 -3.69445
Length : 4
4.29175 -1.3688 5.6716 -3.69445
4.29175 -1.3688 5.6716 -3.69445
Values_copied : yes
Length : 4
4.29175 -1.3688 5.6716 -3.69445
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex4.exe ]
Max Iters = 1550
Preconditioner ->
Drop Tolerance = 0.001
Type = ILU [unused]
Solver = GMRES [unused]
Tolerance = 1e-10
WARNING: Parameter "Solver" GMRES [unused] is unused
[Test w/ 1 proc passed]
Max Iters = 1550
Max Iters = 1550
Max Iters = 1550
Max Iters = 1550
Preconditioner ->
Preconditioner ->
Preconditioner ->
Drop Tolerance = 0.001
Drop Tolerance = 0.001
Drop Tolerance = 0.001
Type = ILU [unused]
Type = ILU [unused]
Type = ILU [unused]
Solver = GMRES [unused]
Solver = GMRES [unused]
Solver = GMRES [unused]
Tolerance = 1e-10
Tolerance = 1e-10
Tolerance = 1e-10
WARNING: Parameter "Solver" GMRES [unused] is unused
WARNING: Parameter "Solver" GMRES [unused] is unused
WARNING: Parameter "Solver" GMRES [unused] is unused
Preconditioner ->
Drop Tolerance = 0.001
Type = ILU [unused]
Solver = GMRES [unused]
Tolerance = 1e-10
WARNING: Parameter "Solver" GMRES [unused] is unused
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex5.exe ]
[Test w/ 1 proc passed]
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex6.exe ]
Please configure Didasko with:
--enable-teuchos
[Test w/ 1 proc passed]
Please configure Didasko with:
--enable-teuchos
Please configure Didasko with:
--enable-teuchos
Please configure Didasko with:
--enable-teuchos
Please configure Didasko with:
--enable-teuchos
[Test w/ 4 procs passed]
[DIDASKO Test teuchos : ex7.exe ]
[Test w/ 1 proc passed]
[Test w/ 4 procs passed]
[DIDASKO Test triutils : ex1.exe ]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
Vector redistribute time (sec) = 1.99878e-05
Matrix redistribute time (sec) = 7.3e-05
Transform to Local time (sec) = 6.59878e-05
[Test w/ 1 proc passed]
Reading matrix info from ../HBMatrices/fidap005.rua...
***************************************************************
Matrix in file ../HBMatrices/fidap005.rua is 27 x 27,
with 279 nonzeros with type RUA;
***************************************************************
Title: FIDAP005
***************************************************************
1 right-hand-side(s) available.
Reading the matrix from ../HBMatrices/fidap005.rua...
Reading right-hand-side vector(s) from ../HBMatrices/fidap005.rua...
Reading exact solution vector(s) from ../HBMatrices/fidap005.rua...
Max norm of residual = 2.624e-09
Two norm of residual = 4.715e-09
Scaled two norm of residual = 7.219e-08
The residual using CSC format and exact solution is 7.219e-08
Norm of computed b = 0.0653197
Norm of given b = 0.0653197
Norm of difference between computed b and given b for xexact = 4.71238e-09
Vector redistribute time (sec) = 0.000638067
Matrix redistribute time (sec) = 0.00091
Transform to Local time (sec) = 0.00342407
[Test w/ 4 procs passed]
[DIDASKO Test triutils : ex2.exe ]
nx = 123
ny = 145 (default value)
tol = 1e-12
solver = KLU
[Test w/ 1 proc passed]
nx = 123
nx = 123
nx = 123
nx = 123
ny = 145 (default value)
ny = 145 (default value)
ny = 145 (default value)
tol = 1e-12
tol = 1e-12
tol = 1e-12
solver = KLU
solver = KLU
solver = KLU
ny = 145 (default value)
tol = 1e-12
solver = KLU
[Test w/ 4 procs passed]
-------------- next part --------------
.././configure --enable-mpi \
--with-mpi-compilers \
--enable-pliris \
CXXFLAGS=-O3 \
CFLAGS=-O3 \
FFLAGS=-O3 \
--enable-valgrind \
--with-libs="/common/TrilinosTestHarness/Trilinos3PL/UMFPACKv4.1/UMFPACK/Lib/libumfpack.a \
/common/TrilinosTestHarness/Trilinos3PL/UMFPACKv4.1/AMD/Lib/libamd.a" \
--with-incdirs="-I/common/TrilinosTestHarness/Trilinos3PL/UMFPACKv4.1/UMFPACK/Include \
-I/common/TrilinosTestHarness/Trilinos3PL/UMFPACKv4.1/AMD/Include" \
--enable-triutils \
--enable-teuchos \
--enable-teuchos-extended \
--enable-teuchos-abc \
--enable-teuchos-complex \
--with-ml-64bit-integer="long long" \
--enable-anasazi \
--enable-new_package \
--enable-new_swahili \
--enable-amesos \
--enable-amesos-umfpack \
--enable-epetraext \
--enable-loca \
--with-loca-anasazi \
--enable-epetraext-inout \
--enable-epetraext-coloring \
--enable-epetraext-transform \
--enable-kokkos \
--enable-nox-epetra-examples \
--enable-nox-tests \
--enable-nox-lapack-examples \
--enable-komplex \
--enable-epetra \
--enable-epetra-abc \
--enable-aztecoo \
--enable-ml \
--enable-nox \
--enable-ifpack \
--enable-didasko \
--enable-pliris \
--enable-pytrilinos \
--disable-default-packages
-------------- next part --------------
Host OS: Linux
Host Name: beowulf
Branch Tag: Ttrilinos-release-5-0-branch
Directory: /common/TrilinosTestHarness/TrilinosRelease5.0/Trilinos
Comm: mpi
Test Directory: ...packages/didasko/test...
Test Name: TestDidasko.exe
Frequency: daily
Result: test passed
------------------------------------------------------------
Attachments:
test_compile_log.txt
logLinux.txt
invoke-configure
------------------------------------------------------------
Notes:
logLinux.txt is the output from the test script listed
above. Please note that the -v option was not selected for
this log. While no errors occurred during this test, this
log can still be examined to see which tests were run.
More information about the Didasko-Regression
mailing list