|
538
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
538
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
7016
|
9 Free Software Foundation; either version 3 of the License, or (at your |
|
|
10 option) any later version. |
|
538
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
7016
|
18 along with Octave; see the file COPYING. If not, see |
|
|
19 <http://www.gnu.org/licenses/>. |
|
538
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #ifdef HAVE_CONFIG_H |
|
1192
|
24 #include <config.h> |
|
538
|
25 #endif |
|
|
26 |
|
1367
|
27 #include <cassert> |
|
538
|
28 |
|
|
29 #include "CmplxQRP.h" |
|
1847
|
30 #include "f77-fcn.h" |
|
538
|
31 #include "lo-error.h" |
|
|
32 |
|
|
33 extern "C" |
|
|
34 { |
|
4552
|
35 F77_RET_T |
|
5275
|
36 F77_FUNC (zgeqpf, ZGEQPF) (const octave_idx_type&, const octave_idx_type&, Complex*, |
|
|
37 const octave_idx_type&, octave_idx_type*, Complex*, Complex*, |
|
|
38 double*, octave_idx_type&); |
|
567
|
39 |
|
4552
|
40 F77_RET_T |
|
5275
|
41 F77_FUNC (zungqr, ZUNGQR) (const octave_idx_type&, const octave_idx_type&, const octave_idx_type&, |
|
|
42 Complex*, const octave_idx_type&, Complex*, |
|
|
43 Complex*, const octave_idx_type&, octave_idx_type&); |
|
538
|
44 } |
|
|
45 |
|
|
46 // It would be best to share some of this code with ComplexQR class... |
|
|
47 |
|
|
48 ComplexQRP::ComplexQRP (const ComplexMatrix& a, QR::type qr_type) |
|
2763
|
49 : ComplexQR (), p () |
|
|
50 { |
|
|
51 init (a, qr_type); |
|
|
52 } |
|
|
53 |
|
|
54 void |
|
|
55 ComplexQRP::init (const ComplexMatrix& a, QR::type qr_type) |
|
538
|
56 { |
|
|
57 assert (qr_type != QR::raw); |
|
|
58 |
|
5275
|
59 octave_idx_type m = a.rows (); |
|
|
60 octave_idx_type n = a.cols (); |
|
538
|
61 |
|
|
62 if (m == 0 || n == 0) |
|
|
63 { |
|
|
64 (*current_liboctave_error_handler) |
|
|
65 ("ComplexQR must have non-empty matrix"); |
|
|
66 return; |
|
|
67 } |
|
|
68 |
|
5275
|
69 octave_idx_type min_mn = m < n ? m : n; |
|
3883
|
70 Array<Complex> tau (min_mn); |
|
1928
|
71 Complex *ptau = tau.fortran_vec (); |
|
1922
|
72 |
|
5275
|
73 octave_idx_type lwork = 3*n > 32*m ? 3*n : 32*m; |
|
1928
|
74 Array<Complex> work (lwork); |
|
|
75 Complex *pwork = work.fortran_vec (); |
|
1922
|
76 |
|
5275
|
77 octave_idx_type info = 0; |
|
538
|
78 |
|
2763
|
79 ComplexMatrix A_fact = a; |
|
3883
|
80 if (m > n && qr_type != QR::economy) |
|
2763
|
81 A_fact.resize (m, m, 0.0); |
|
538
|
82 |
|
1928
|
83 Complex *tmp_data = A_fact.fortran_vec (); |
|
538
|
84 |
|
1928
|
85 Array<double> rwork (2*n); |
|
|
86 double *prwork = rwork.fortran_vec (); |
|
538
|
87 |
|
5275
|
88 Array<octave_idx_type> jpvt (n, 0); |
|
|
89 octave_idx_type *pjpvt = jpvt.fortran_vec (); |
|
538
|
90 |
|
1928
|
91 // Code to enforce a certain permutation could go here... |
|
538
|
92 |
|
1928
|
93 F77_XFCN (zgeqpf, ZGEQPF, (m, n, tmp_data, m, pjpvt, ptau, pwork, |
|
|
94 prwork, info)); |
|
1922
|
95 |
|
|
96 if (f77_exception_encountered) |
|
|
97 (*current_liboctave_error_handler) ("unrecoverable error in zgeqpf"); |
|
538
|
98 else |
|
|
99 { |
|
1922
|
100 // Form Permutation matrix (if economy is requested, return the |
|
|
101 // indices only!) |
|
|
102 |
|
2763
|
103 if (qr_type == QR::economy) |
|
1922
|
104 { |
|
|
105 p.resize (1, n, 0.0); |
|
5275
|
106 for (octave_idx_type j = 0; j < n; j++) |
|
1928
|
107 p.elem (0, j) = jpvt.elem (j); |
|
1922
|
108 } |
|
|
109 else |
|
|
110 { |
|
|
111 p.resize (n, n, 0.0); |
|
5275
|
112 for (octave_idx_type j = 0; j < n; j++) |
|
1928
|
113 p.elem (jpvt.elem (j) - 1, j) = 1.0; |
|
1922
|
114 } |
|
|
115 |
|
5275
|
116 octave_idx_type n2 = (qr_type == QR::economy) ? min_mn : m; |
|
3883
|
117 |
|
2763
|
118 if (qr_type == QR::economy && m > n) |
|
|
119 r.resize (n, n, 0.0); |
|
|
120 else |
|
|
121 r.resize (m, n, 0.0); |
|
1922
|
122 |
|
5275
|
123 for (octave_idx_type j = 0; j < n; j++) |
|
1922
|
124 { |
|
5275
|
125 octave_idx_type limit = j < min_mn-1 ? j : min_mn-1; |
|
|
126 for (octave_idx_type i = 0; i <= limit; i++) |
|
1928
|
127 r.elem (i, j) = A_fact.elem (i, j); |
|
1922
|
128 } |
|
|
129 |
|
2763
|
130 F77_XFCN (zungqr, ZUNGQR, (m, n2, min_mn, tmp_data, m, ptau, |
|
1928
|
131 pwork, lwork, info)); |
|
1922
|
132 |
|
|
133 if (f77_exception_encountered) |
|
|
134 (*current_liboctave_error_handler) ("unrecoverable error in zungqr"); |
|
|
135 else |
|
|
136 { |
|
2468
|
137 q = A_fact; |
|
1922
|
138 q.resize (m, n2); |
|
|
139 } |
|
538
|
140 } |
|
|
141 } |
|
|
142 |
|
|
143 /* |
|
|
144 ;;; Local Variables: *** |
|
|
145 ;;; mode: C++ *** |
|
|
146 ;;; End: *** |
|
|
147 */ |
