2
% test12(nmat): test etree2 and compare with etree
3
fprintf ('=================================================================\n');
4
fprintf ('test12: test etree2 and compare with etree\n') ;
8
% only test matrices with nrows = 109000 or less. large ones nearly always
9
% cause a MATLAB segfault.
10
% f = find (index.nrows < 109000) ;
11
f = 1:length (index.nrows) ;
13
% sort by row dimension
14
[ignore i] = sort (index.nrows (f)) ;
19
nmat = min (nmat, length (f)) ;
23
% MATLAB 7.0 (R14, sp2, linux) etree gives a segfault for these matrices:
24
s_skip = [ 803 374 1287 1311 1308 957 958 1257 955 761 1282 1230 1256 ...
25
924 1302 537 820 821 822 1258 ...
26
844 845 1238 804 939 1270 1305 1208 1209 290 879 928 1307 1244 ...
27
1275 1276 1296 885 1269 959 542 1290 ] ;
29
sym_skip = [ s_skip ] ;
31
p_sym_skip = [ 1296 ] ;
32
p_symt_skip = [ 1296 ] ;
34
symt_skip= [ s_skip 592 593 809 ] ;
36
rowcol_skip = [ 646 ...
37
1224 803 588 589 374 1287 562 563 801 1311 1246 951 1308 950 ...
38
957 958 800 1257 564 565 955 761 1282 590 591 1230 1256 952 566 ...
39
567 924 1302 1293 1294 537 820 821 822 1306 849 1258 592 593 ...
40
1225 844 845 1226 1238 1227 804 939 1270 752 753 1305 809 1228 ...
41
1208 1209 1291 1292 1300 856 1229 290 879 928 1307 857 1244 ...
42
1275 1276 1296 885 858 859 1269 1263 959 542 1290 ] ;
44
col_skip = [ rowcol_skip 647 612 610 648 799 651 652 750 751 640 ] ;
46
row_skip= [ rowcol_skip 903 373 ] ;
48
% f = f (find (f == 1290) : end) ;
50
fprintf ('Matrices to test: %d\n', length (f)) ;
58
A = spones (Problem.A) ;
60
fprintf ('\n%4d: %-20s nrow: %6d ncol: %6d nnz: %10d\n', ...
61
i, Problem.name, m, n, nnz(A)) ;
63
% if (max (m,n) < 500)
67
% warmup, for accurate timing
73
skip = any (i == col_skip) || m > 109000 ;
76
[parent post] = etree (A, 'col') ;
83
[my_parent my_post] = etree2 (A, 'col') ;
87
if (any (parent ~= my_parent))
88
error ('parent invalid!') ;
91
fprintf ('etree(A,''col''): %8.4f %8.4f speedup %8.2f ',...
94
if (any (post ~= my_post))
95
fprintf ('postorder differs') ;
101
skip = any (i == row_skip) || m > 109000 ;
104
[parent post] = etree (A', 'col') ;
111
[my_parent my_post] = etree2 (A, 'row') ;
115
if (any (parent ~= my_parent))
116
error ('parent invalid!') ;
119
fprintf ('etree(A,''row''): %8.4f %8.4f speedup %8.2f ',...
122
if (any (post ~= my_post))
123
fprintf ('postorder differs') ;
135
skip1 = any (i == sym_skip) || m > 109000 ;
136
skip2 = any (i == symt_skip) || m > 109000 ;
138
skip1 = any (i == p_sym_skip) || m > 109000 ;
139
skip2 = any (i == p_symt_skip) || m > 109000 ;
140
fprintf ('after amd:\n') ;
145
% test symmetric etree, using triu(A)
148
[parent post] = etree (A) ;
155
[my_parent my_post] = etree2 (A) ;
159
if (any (parent ~= my_parent))
160
error ('parent invalid!') ;
163
fprintf ('etree(A): %8.4f %8.4f speedup %8.2f ',...
166
if (any (post ~= my_post))
167
fprintf ('postorder differs') ;
172
% test symmetric etree, using tril(A)
175
[parent post] = etree (A') ;
182
[my_parent my_post] = etree2 (A, 'lo') ;
186
if (any (parent ~= my_parent))
187
error ('parent invalid!') ;
190
fprintf('etree(A''): %8.4f %8.4f speedup %8.2f ',...
193
if (any (post ~= my_post))
194
fprintf ('postorder differs') ;
204
% fprintf ('%d: failed\n', i) ;
208
fprintf ('test12 passed\n') ;