|
5164
|
1 ## Copyright (C) 2004 Paul Kienzle |
|
|
2 ## |
|
|
3 ## This program is free software and is in the public domain |
|
|
4 |
|
|
5 ## -*- texinfo -*- |
|
|
6 ## @deftypefn {Function File} {} sprand (@var{m}, @var{n}, @var{d}) |
|
|
7 ## @deftypefnx {Function File} {} sprand (@var{s}) |
|
|
8 ## Generate a random sparse matrix. The size of the matrix will be |
|
|
9 ## @var{m} by @var{n}, with a density of values given by @var{d}. |
|
|
10 ## @var{d} should be between 0 and 1. Values will be normally |
|
|
11 ## distributed with mean of zero and variance 1. |
|
|
12 ## |
|
|
13 ## Note: sometimes the actual density may be a bit smaller than @var{d}. |
|
|
14 ## This is unlikely to happen for large really sparse matrices. |
|
|
15 ## |
|
|
16 ## If called with a single matrix argument, a random sparse matrix is |
|
|
17 ## generated wherever the matrix @var{S} is non-zero. |
|
|
18 ## @end deftypefn |
|
|
19 ## @seealso{sprandn} |
|
|
20 |
|
|
21 |
|
|
22 ## This program is public domain |
|
|
23 ## Author: Paul Kienzle <pkienzle@users.sf.net> |
|
|
24 ## |
|
|
25 ## Changelog: |
|
|
26 ## |
|
|
27 ## Piotr Krzyzanowski <przykry2004@users.sf.net> |
|
|
28 ## 2004-09-27 use Paul's hint to allow larger random matrices |
|
|
29 ## at the price of sometimes lower density than desired |
|
|
30 ## David Bateman |
|
|
31 ## 2004-10-20 Texinfo help and copyright message |
|
|
32 |
|
|
33 function S = sprand (m, n, d) |
|
|
34 if nargin == 1 |
|
|
35 [i,j,v,nr,nc] = spfind(m); |
|
|
36 S = sparse (i,j,rand(size(v)),nr,nc); |
|
|
37 elseif nargin == 3 |
|
|
38 mn = n*m; |
|
|
39 k = round(d*mn); # how many entries in S would be satisfactory? |
|
|
40 idx=unique(fix(rand(min(k*1.01,k+10),1)*mn))+1; |
|
|
41 # idx contains random numbers in [1,mn] |
|
|
42 # generate 1% or 10 more random values than necessary |
|
|
43 # in order to reduce the probability that there are less than k |
|
|
44 # distinct values; |
|
|
45 # maybe a better strategy could be used |
|
|
46 # but I don't think it's worth the price |
|
|
47 k = min(length(idx),k); # actual number of entries in S |
|
|
48 j = floor((idx(1:k)-1)/m); |
|
|
49 i = idx(1:k) - j*m; |
|
|
50 if isempty(i) |
|
|
51 S = sparse(m,n); |
|
|
52 else |
|
|
53 S = sparse(i,j+1,rand(k,1),m,n); |
|
|
54 endif |
|
|
55 else |
|
|
56 usage("sprand(m,n,density) OR sprand(S)"); |
|
|
57 endif |
|
|
58 endfunction |
