2540
|
1 ## Copyright (C) 1995, 1996 Kurt Hornik |
3426
|
2 ## |
3922
|
3 ## This file is part of Octave. |
|
4 ## |
|
5 ## Octave is free software; you can redistribute it and/or modify it |
|
6 ## under the terms of the GNU General Public License as published by |
2540
|
7 ## the Free Software Foundation; either version 2, or (at your option) |
|
8 ## any later version. |
3426
|
9 ## |
3922
|
10 ## Octave is distributed in the hope that it will be useful, but |
2540
|
11 ## WITHOUT ANY WARRANTY; without even the implied warranty of |
|
12 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
3426
|
13 ## General Public License for more details. |
|
14 ## |
2540
|
15 ## You should have received a copy of the GNU General Public License |
3922
|
16 ## along with Octave; see the file COPYING. If not, write to the Free |
5307
|
17 ## Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
18 ## 02110-1301, USA. |
2540
|
19 |
3369
|
20 ## -*- texinfo -*- |
|
21 ## @deftypefn {Function File} {} vech (@var{x}) |
|
22 ## Return the vector obtained by eliminating all supradiagonal elements of |
|
23 ## the square matrix @var{x} and stacking the result one column above the |
|
24 ## other. |
|
25 ## @end deftypefn |
|
26 |
2540
|
27 ## See Magnus and Neudecker (1988), Matrix differential calculus with |
|
28 ## applications in statistics and econometrics. |
|
29 |
5428
|
30 ## Author KH <Kurt.Hornik@wu-wien.ac.at> |
2540
|
31 ## Created: 8 May 1995 |
|
32 ## Adapted-By: jwe |
|
33 |
|
34 function v = vech (x) |
3426
|
35 |
2540
|
36 if (nargin != 1) |
6046
|
37 print_usage (); |
2540
|
38 endif |
3426
|
39 |
4030
|
40 if (! issquare (x)) |
3458
|
41 error ("vech: x must be square"); |
2540
|
42 endif |
3426
|
43 |
2540
|
44 ## This should be quicker than having an inner `for' loop as well. |
|
45 ## Ideally, vech should be written in C++. |
|
46 n = rows (x); |
2745
|
47 v = zeros ((n+1)*n/2, 1); |
2540
|
48 count = 0; |
|
49 for j = 1 : n |
3426
|
50 i = j : n; |
2540
|
51 v (count + i) = x (i, j); |
|
52 count = count + n - j; |
|
53 endfor |
|
54 |
|
55 endfunction |