File: test1.m

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (70 lines) | stat: -rw-r--r-- 1,301 bytes parent folder | download | duplicates (2)
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
function test1
%TEST1 test cs_transpose
%
% Example:
%   test1
% See also: testall

% CSparse, Copyright (c) 2006-2022, Timothy A. Davis. All Rights Reserved.
% SPDX-License-Identifier: LGPL-2.1+

index = ssget ;
[ignore f] = sort (max (index.nrows, index.ncols)) ;
f = f (1:100) ;

for ii = f
    Prob = ssget (ii) ;
    disp (Prob) ;
    A = Prob.A ;
    if (~isreal (A))
        continue
    end
    B = A' ;

    C = cs_transpose (A) ;
    if (nnz (B-C) ~= 0)
        error ('!')
    end

    [m n] = size (A) ;
    % if (m == n)
        x = rand (n,1) ;
        y = rand (m,1) ;
        z = y+A*x ;
        q = cs_gaxpy (A,x,y) ;
        err = norm (z-q,1) / norm (z,1) ;
        disp (err) ;
        if (err > 1e-14)
            error ('!')
        end
    % end


    [i j x] = find (A) ;
    p = randperm (length (i)) ;
    i = i (p) ;
    j = j (p) ;
    x = x (p) ;
    if (m == 1)
        % find returns rows vectors if A is 1-by-n,
        % but cs_sparse requires column vectors
        i = i (:) ;
        j = j (:) ;
        x = x (:) ;
    end
    D = sparse (i,j,x) ;
    E = cs_sparse (i,j,x) ;
    % [i j x]
    F = cs_sparse2 (i,j,x) ;
    if (nnz (D-E) ~= 0)
        error ('!')
    end
    if (nnz (F-E) ~= 0)
        error ('!')
    end

    clear A B C D E F
    % pause

end