Mercurial > octave

comparison scripts/statistics/distributions/f_inv.m @ 3426:f8dde1807dee

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 2000-01-13 08:40:00 by jwe]
author jwe
date Thu, 13 Jan 2000 08:40:53 +0000
parents e4f4b2d26ee9
children 434790acb067
comparison
equal deleted inserted replaced
3425:8625164a0a39 3426:f8dde1807dee
1 ## Copyright (C) 1995, 1996, 1997 Kurt Hornik 1 ## Copyright (C) 1995, 1996, 1997 Kurt Hornik
2 ## 2 ##
3 ## This program is free software; you can redistribute it and/or modify 3 ## This program is free software; you can redistribute it and/or modify
4 ## it under the terms of the GNU General Public License as published by 4 ## it under the terms of the GNU General Public License as published by
5 ## the Free Software Foundation; either version 2, or (at your option) 5 ## the Free Software Foundation; either version 2, or (at your option)
6 ## any later version. 6 ## any later version.
7 ## 7 ##
8 ## This program is distributed in the hope that it will be useful, but 8 ## This program is distributed in the hope that it will be useful, but
9 ## WITHOUT ANY WARRANTY; without even the implied warranty of 9 ## WITHOUT ANY WARRANTY; without even the implied warranty of
10 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 10 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 ## General Public License for more details. 11 ## General Public License for more details.
12 ## 12 ##
13 ## You should have received a copy of the GNU General Public License 13 ## You should have received a copy of the GNU General Public License
14 ## along with this file. If not, write to the Free Software Foundation, 14 ## along with this file. If not, write to the Free Software Foundation,
15 ## 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 15 ## 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
16 16
17 ## usage: f_inv (x, m, n) 17 ## usage: f_inv (x, m, n)
30 30
31 [retval, x, m, n] = common_size (x, m, n); 31 [retval, x, m, n] = common_size (x, m, n);
32 if (retval > 0) 32 if (retval > 0)
33 error ("f_inv: x, m and n must be of common size or scalar"); 33 error ("f_inv: x, m and n must be of common size or scalar");
34 endif 34 endif
35 35
36 [r, c] = size (x); 36 [r, c] = size (x);
37 s = r * c; 37 s = r * c;
38 x = reshape (x, 1, s); 38 x = reshape (x, 1, s);
39 m = reshape (m, 1, s); 39 m = reshape (m, 1, s);
40 n = reshape (n, 1, s); 40 n = reshape (n, 1, s);
42 42
43 k = find ((x < 0) | (x > 1) | isnan (x) | !(m > 0) | !(n > 0)); 43 k = find ((x < 0) | (x > 1) | isnan (x) | !(m > 0) | !(n > 0));
44 if any (k) 44 if any (k)
45 inv(k) = NaN * ones (1, length (k)); 45 inv(k) = NaN * ones (1, length (k));
46 endif 46 endif
47 47
48 k = find ((x == 1) & (m > 0) & (n > 0)); 48 k = find ((x == 1) & (m > 0) & (n > 0));
49 if any (k) 49 if any (k)
50 inv(k) = Inf * ones (1, length (k)); 50 inv(k) = Inf * ones (1, length (k));
51 endif 51 endif
52 52
53 k = find ((x > 0) & (x < 1) & (m > 0) & (n > 0)); 53 k = find ((x > 0) & (x < 1) & (m > 0) & (n > 0));
54 if any (k) 54 if any (k)
55 inv(k) = (1 ./ beta_inv (1 - x(k), n(k) / 2, m(k) / 2) - 1) ... 55 inv(k) = (1 ./ beta_inv (1 - x(k), n(k) / 2, m(k) / 2) - 1) ...
56 .* n(k) ./ m(k); 56 .* n(k) ./ m(k);
57 endif 57 endif
58 58
59 ## should we really only allow for positive integer m, n? 59 ## should we really only allow for positive integer m, n?
60 k = find ((m != round (m)) | (n != round (n))); 60 k = find ((m != round (m)) | (n != round (n)));
61 if any (k) 61 if any (k)
62 fprintf (stderr, ... 62 fprintf (stderr, ...
63 "WARNING: m and n should be positive integers\n"); 63 "WARNING: m and n should be positive integers\n");
64 inv(k) = NaN * ones (1, length (k)); 64 inv(k) = NaN * ones (1, length (k));
65 endif 65 endif
66 66
67 inv = reshape (inv, r, c); 67 inv = reshape (inv, r, c);
68 68
69 endfunction 69 endfunction