File: test223.m

package info (click to toggle)
suitesparse 1%3A5.12.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 176,720 kB
  • sloc: ansic: 1,193,914; cpp: 31,704; makefile: 6,638; fortran: 1,927; java: 1,826; csh: 765; ruby: 725; sh: 529; python: 333; perl: 225; sed: 164; awk: 35
file content (52 lines) | stat: -rw-r--r-- 1,041 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
function test223
%TEST223 test matrix multiply, C<!M>=A*B

% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0

% tests the Coarse Gustavson method for C<!M>=A*B, for the case when
% C(:,j) is very sparse compared with the # of rows of C.

rng ('default') ;

GrB.burble (1) ;
n = 100 ;
m = 10000 ;

clear desc
desc.axb = 'gustavson' ;
desc.mask = 'complement' ;

[save1, save2] = nthreads_get ;
nthreads_set (2,1) ;

A = sprand (n, n, 0.9) ;
B = sprand (n, n, 0.9) ;
A (m,m) = 1 ;
B (m,m) = 1 ;
M = sparse (m,m) ;
M (1,1) = 1 ;

Ain.matrix = A ;
Ain.sparsity = 2 ;  % sparse

Bin.matrix = B ;
Bin.sparsity = 2 ;  % sparse

Cin = sparse (m,m) ;

semiring.add = 'plus' ;
semiring.multiply = 'times' ;
semiring.class = 'double' ;

% C<!M> = A*B
C1 = GB_mex_mxm (Cin, M, [ ], semiring, Ain, Bin, desc) ;
C1.matrix (1,1) = 0 ;
C2 = A*B ;
C2 (1,1) = 0 ;
assert (isequal (C1.matrix, C2)) ;

GrB.burble (0) ;
nthreads_set (save1, save2) ;
fprintf ('\ntest223: all tests passed\n') ;