|
1993
|
1 // Matrix manipulations. |
|
458
|
2 /* |
|
|
3 |
|
2847
|
4 Copyright (C) 1996, 1997 John W. Eaton |
|
458
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
458
|
21 |
|
|
22 */ |
|
|
23 |
|
1296
|
24 #if defined (__GNUG__) |
|
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
458
|
28 #ifdef HAVE_CONFIG_H |
|
1192
|
29 #include <config.h> |
|
458
|
30 #endif |
|
|
31 |
|
1367
|
32 #include <cfloat> |
|
|
33 |
|
3503
|
34 #include <iostream> |
|
1367
|
35 |
|
2443
|
36 // XXX FIXME XXX |
|
|
37 #ifdef HAVE_SYS_TYPES_H |
|
|
38 #include <sys/types.h> |
|
|
39 #endif |
|
458
|
40 |
|
2828
|
41 #include "CMatrix.h" |
|
1819
|
42 #include "CmplxAEPBAL.h" |
|
458
|
43 #include "CmplxDET.h" |
|
1819
|
44 #include "CmplxSCHUR.h" |
|
740
|
45 #include "CmplxSVD.h" |
|
1847
|
46 #include "f77-fcn.h" |
|
458
|
47 #include "lo-error.h" |
|
2354
|
48 #include "lo-ieee.h" |
|
|
49 #include "lo-mappers.h" |
|
1968
|
50 #include "lo-utils.h" |
|
1367
|
51 #include "mx-base.h" |
|
2828
|
52 #include "mx-cm-dm.h" |
|
3176
|
53 #include "mx-dm-cm.h" |
|
2828
|
54 #include "mx-cm-s.h" |
|
1367
|
55 #include "mx-inlines.cc" |
|
1650
|
56 #include "oct-cmplx.h" |
|
458
|
57 |
|
|
58 // Fortran functions we call. |
|
|
59 |
|
|
60 extern "C" |
|
|
61 { |
|
3331
|
62 int F77_FCN (zgebal, ZGEBAL) (const char*, const int&, Complex*, |
|
|
63 const int&, int&, int&, double*, int&, |
|
|
64 long, long); |
|
|
65 |
|
|
66 int F77_FCN (dgebak, DGEBAK) (const char*, const char*, const int&, |
|
|
67 const int&, const int&, double*, |
|
|
68 const int&, double*, const int&, |
|
|
69 int&, long, long); |
|
|
70 |
|
1253
|
71 int F77_FCN (zgemm, ZGEMM) (const char*, const char*, const int&, |
|
|
72 const int&, const int&, const Complex&, |
|
|
73 const Complex*, const int&, |
|
|
74 const Complex*, const int&, |
|
|
75 const Complex&, Complex*, const int&, |
|
|
76 long, long); |
|
|
77 |
|
|
78 int F77_FCN (zgeco, ZGECO) (Complex*, const int&, const int&, int*, |
|
|
79 double&, Complex*); |
|
|
80 |
|
|
81 int F77_FCN (zgedi, ZGEDI) (Complex*, const int&, const int&, int*, |
|
|
82 Complex*, Complex*, const int&); |
|
|
83 |
|
|
84 int F77_FCN (zgesl, ZGESL) (Complex*, const int&, const int&, int*, |
|
|
85 Complex*, const int&); |
|
|
86 |
|
|
87 int F77_FCN (zgelss, ZGELSS) (const int&, const int&, const int&, |
|
|
88 Complex*, const int&, Complex*, |
|
|
89 const int&, double*, double&, int&, |
|
|
90 Complex*, const int&, double*, int&); |
|
458
|
91 |
|
1360
|
92 // Note that the original complex fft routines were not written for |
|
|
93 // double complex arguments. They have been modified by adding an |
|
|
94 // implicit double precision (a-h,o-z) statement at the beginning of |
|
|
95 // each subroutine. |
|
458
|
96 |
|
1253
|
97 int F77_FCN (cffti, CFFTI) (const int&, Complex*); |
|
|
98 |
|
|
99 int F77_FCN (cfftf, CFFTF) (const int&, Complex*, Complex*); |
|
|
100 |
|
|
101 int F77_FCN (cfftb, CFFTB) (const int&, Complex*, Complex*); |
|
1819
|
102 |
|
|
103 int F77_FCN (zlartg, ZLARTG) (const Complex&, const Complex&, |
|
|
104 double&, Complex&, Complex&); |
|
|
105 |
|
|
106 int F77_FCN (ztrsyl, ZTRSYL) (const char*, const char*, const int&, |
|
|
107 const int&, const int&, |
|
|
108 const Complex*, const int&, |
|
|
109 const Complex*, const int&, |
|
|
110 const Complex*, const int&, double&, |
|
|
111 int&, long, long); |
|
|
112 |
|
3130
|
113 int F77_FCN (xzlange, XZLANGE) (const char*, const int&, |
|
|
114 const int&, const Complex*, |
|
|
115 const int&, double*, double&); |
|
458
|
116 } |
|
|
117 |
|
2354
|
118 static const Complex Complex_NaN_result (octave_NaN, octave_NaN); |
|
|
119 |
|
1360
|
120 // Complex Matrix class |
|
458
|
121 |
|
|
122 ComplexMatrix::ComplexMatrix (const Matrix& a) |
|
1214
|
123 : MArray2<Complex> (a.rows (), a.cols ()) |
|
458
|
124 { |
|
|
125 for (int j = 0; j < cols (); j++) |
|
|
126 for (int i = 0; i < rows (); i++) |
|
|
127 elem (i, j) = a.elem (i, j); |
|
|
128 } |
|
|
129 |
|
2349
|
130 ComplexMatrix::ComplexMatrix (const RowVector& rv) |
|
|
131 : MArray2<Complex> (1, rv.length (), 0.0) |
|
|
132 { |
|
|
133 for (int i = 0; i < rv.length (); i++) |
|
|
134 elem (0, i) = rv.elem (i); |
|
|
135 } |
|
|
136 |
|
|
137 ComplexMatrix::ComplexMatrix (const ColumnVector& cv) |
|
|
138 : MArray2<Complex> (cv.length (), 1, 0.0) |
|
|
139 { |
|
|
140 for (int i = 0; i < cv.length (); i++) |
|
|
141 elem (i, 0) = cv.elem (i); |
|
|
142 } |
|
|
143 |
|
458
|
144 ComplexMatrix::ComplexMatrix (const DiagMatrix& a) |
|
1214
|
145 : MArray2<Complex> (a.rows (), a.cols (), 0.0) |
|
458
|
146 { |
|
|
147 for (int i = 0; i < a.length (); i++) |
|
|
148 elem (i, i) = a.elem (i, i); |
|
|
149 } |
|
|
150 |
|
2349
|
151 ComplexMatrix::ComplexMatrix (const ComplexRowVector& rv) |
|
|
152 : MArray2<Complex> (1, rv.length (), 0.0) |
|
|
153 { |
|
|
154 for (int i = 0; i < rv.length (); i++) |
|
|
155 elem (0, i) = rv.elem (i); |
|
|
156 } |
|
|
157 |
|
|
158 ComplexMatrix::ComplexMatrix (const ComplexColumnVector& cv) |
|
|
159 : MArray2<Complex> (cv.length (), 1, 0.0) |
|
|
160 { |
|
|
161 for (int i = 0; i < cv.length (); i++) |
|
|
162 elem (i, 0) = cv.elem (i); |
|
|
163 } |
|
|
164 |
|
458
|
165 ComplexMatrix::ComplexMatrix (const ComplexDiagMatrix& a) |
|
1214
|
166 : MArray2<Complex> (a.rows (), a.cols (), 0.0) |
|
458
|
167 { |
|
|
168 for (int i = 0; i < a.length (); i++) |
|
|
169 elem (i, i) = a.elem (i, i); |
|
|
170 } |
|
|
171 |
|
1574
|
172 // XXX FIXME XXX -- could we use a templated mixed-type copy function |
|
|
173 // here? |
|
|
174 |
|
2828
|
175 ComplexMatrix::ComplexMatrix (const boolMatrix& a) |
|
3180
|
176 : MArray2<Complex> (a.rows (), a.cols (), 0.0) |
|
2828
|
177 { |
|
|
178 for (int i = 0; i < a.cols (); i++) |
|
|
179 for (int j = 0; j < a.rows (); j++) |
|
|
180 elem (i, j) = a.elem (i, j); |
|
|
181 } |
|
|
182 |
|
1574
|
183 ComplexMatrix::ComplexMatrix (const charMatrix& a) |
|
3180
|
184 : MArray2<Complex> (a.rows (), a.cols (), 0.0) |
|
1574
|
185 { |
|
|
186 for (int i = 0; i < a.cols (); i++) |
|
|
187 for (int j = 0; j < a.rows (); j++) |
|
|
188 elem (i, j) = a.elem (i, j); |
|
|
189 } |
|
|
190 |
|
2384
|
191 bool |
|
458
|
192 ComplexMatrix::operator == (const ComplexMatrix& a) const |
|
|
193 { |
|
|
194 if (rows () != a.rows () || cols () != a.cols ()) |
|
2384
|
195 return false; |
|
458
|
196 |
|
|
197 return equal (data (), a.data (), length ()); |
|
|
198 } |
|
|
199 |
|
2384
|
200 bool |
|
458
|
201 ComplexMatrix::operator != (const ComplexMatrix& a) const |
|
|
202 { |
|
|
203 return !(*this == a); |
|
|
204 } |
|
|
205 |
|
2815
|
206 bool |
|
|
207 ComplexMatrix::is_hermitian (void) const |
|
|
208 { |
|
|
209 int nr = rows (); |
|
|
210 int nc = cols (); |
|
|
211 |
|
|
212 if (is_square () && nr > 0) |
|
|
213 { |
|
|
214 for (int i = 0; i < nr; i++) |
|
|
215 for (int j = i; j < nc; j++) |
|
|
216 if (elem (i, j) != conj (elem (j, i))) |
|
|
217 return false; |
|
|
218 |
|
|
219 return true; |
|
|
220 } |
|
|
221 |
|
|
222 return false; |
|
|
223 } |
|
|
224 |
|
458
|
225 // destructive insert/delete/reorder operations |
|
|
226 |
|
|
227 ComplexMatrix& |
|
|
228 ComplexMatrix::insert (const Matrix& a, int r, int c) |
|
|
229 { |
|
|
230 int a_nr = a.rows (); |
|
|
231 int a_nc = a.cols (); |
|
1699
|
232 |
|
|
233 if (r < 0 || r + a_nr > rows () || c < 0 || c + a_nc > cols ()) |
|
458
|
234 { |
|
|
235 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
236 return *this; |
|
|
237 } |
|
|
238 |
|
|
239 for (int j = 0; j < a_nc; j++) |
|
|
240 for (int i = 0; i < a_nr; i++) |
|
|
241 elem (r+i, c+j) = a.elem (i, j); |
|
|
242 |
|
|
243 return *this; |
|
|
244 } |
|
|
245 |
|
|
246 ComplexMatrix& |
|
|
247 ComplexMatrix::insert (const RowVector& a, int r, int c) |
|
|
248 { |
|
|
249 int a_len = a.length (); |
|
1699
|
250 if (r < 0 || r >= rows () || c < 0 || c + a_len > cols ()) |
|
458
|
251 { |
|
|
252 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
253 return *this; |
|
|
254 } |
|
|
255 |
|
|
256 for (int i = 0; i < a_len; i++) |
|
|
257 elem (r, c+i) = a.elem (i); |
|
|
258 |
|
|
259 return *this; |
|
|
260 } |
|
|
261 |
|
|
262 ComplexMatrix& |
|
|
263 ComplexMatrix::insert (const ColumnVector& a, int r, int c) |
|
|
264 { |
|
|
265 int a_len = a.length (); |
|
1699
|
266 if (r < 0 || r + a_len > rows () || c < 0 || c >= cols ()) |
|
458
|
267 { |
|
|
268 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
269 return *this; |
|
|
270 } |
|
|
271 |
|
|
272 for (int i = 0; i < a_len; i++) |
|
|
273 elem (r+i, c) = a.elem (i); |
|
|
274 |
|
|
275 return *this; |
|
|
276 } |
|
|
277 |
|
|
278 ComplexMatrix& |
|
|
279 ComplexMatrix::insert (const DiagMatrix& a, int r, int c) |
|
|
280 { |
|
1699
|
281 int a_nr = a.rows (); |
|
|
282 int a_nc = a.cols (); |
|
|
283 |
|
|
284 if (r < 0 || r + a_nr > rows () || c < 0 || c + a_nc > cols ()) |
|
458
|
285 { |
|
|
286 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
287 return *this; |
|
|
288 } |
|
|
289 |
|
1699
|
290 fill (0.0, r, c, r + a_nr - 1, c + a_nc - 1); |
|
|
291 |
|
458
|
292 for (int i = 0; i < a.length (); i++) |
|
|
293 elem (r+i, c+i) = a.elem (i, i); |
|
|
294 |
|
|
295 return *this; |
|
|
296 } |
|
|
297 |
|
|
298 ComplexMatrix& |
|
|
299 ComplexMatrix::insert (const ComplexMatrix& a, int r, int c) |
|
|
300 { |
|
1561
|
301 Array2<Complex>::insert (a, r, c); |
|
458
|
302 return *this; |
|
|
303 } |
|
|
304 |
|
|
305 ComplexMatrix& |
|
|
306 ComplexMatrix::insert (const ComplexRowVector& a, int r, int c) |
|
|
307 { |
|
|
308 int a_len = a.length (); |
|
1699
|
309 if (r < 0 || r >= rows () || c < 0 || c + a_len > cols ()) |
|
458
|
310 { |
|
|
311 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
312 return *this; |
|
|
313 } |
|
|
314 |
|
|
315 for (int i = 0; i < a_len; i++) |
|
|
316 elem (r, c+i) = a.elem (i); |
|
|
317 |
|
|
318 return *this; |
|
|
319 } |
|
|
320 |
|
|
321 ComplexMatrix& |
|
|
322 ComplexMatrix::insert (const ComplexColumnVector& a, int r, int c) |
|
|
323 { |
|
|
324 int a_len = a.length (); |
|
1699
|
325 if (r < 0 || r + a_len > rows () || c < 0 || c >= cols ()) |
|
458
|
326 { |
|
|
327 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
328 return *this; |
|
|
329 } |
|
|
330 |
|
|
331 for (int i = 0; i < a_len; i++) |
|
|
332 elem (r+i, c) = a.elem (i); |
|
|
333 |
|
|
334 return *this; |
|
|
335 } |
|
|
336 |
|
|
337 ComplexMatrix& |
|
|
338 ComplexMatrix::insert (const ComplexDiagMatrix& a, int r, int c) |
|
|
339 { |
|
1699
|
340 int a_nr = a.rows (); |
|
|
341 int a_nc = a.cols (); |
|
|
342 |
|
|
343 if (r < 0 || r + a_nr > rows () || c < 0 || c + a_nc > cols ()) |
|
458
|
344 { |
|
|
345 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
346 return *this; |
|
|
347 } |
|
|
348 |
|
1699
|
349 fill (0.0, r, c, r + a_nr - 1, c + a_nc - 1); |
|
|
350 |
|
458
|
351 for (int i = 0; i < a.length (); i++) |
|
|
352 elem (r+i, c+i) = a.elem (i, i); |
|
|
353 |
|
|
354 return *this; |
|
|
355 } |
|
|
356 |
|
|
357 ComplexMatrix& |
|
|
358 ComplexMatrix::fill (double val) |
|
|
359 { |
|
|
360 int nr = rows (); |
|
|
361 int nc = cols (); |
|
|
362 if (nr > 0 && nc > 0) |
|
|
363 for (int j = 0; j < nc; j++) |
|
|
364 for (int i = 0; i < nr; i++) |
|
|
365 elem (i, j) = val; |
|
|
366 |
|
|
367 return *this; |
|
|
368 } |
|
|
369 |
|
|
370 ComplexMatrix& |
|
|
371 ComplexMatrix::fill (const Complex& val) |
|
|
372 { |
|
|
373 int nr = rows (); |
|
|
374 int nc = cols (); |
|
|
375 if (nr > 0 && nc > 0) |
|
|
376 for (int j = 0; j < nc; j++) |
|
|
377 for (int i = 0; i < nr; i++) |
|
|
378 elem (i, j) = val; |
|
|
379 |
|
|
380 return *this; |
|
|
381 } |
|
|
382 |
|
|
383 ComplexMatrix& |
|
|
384 ComplexMatrix::fill (double val, int r1, int c1, int r2, int c2) |
|
|
385 { |
|
|
386 int nr = rows (); |
|
|
387 int nc = cols (); |
|
|
388 if (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0 |
|
|
389 || r1 >= nr || r2 >= nr || c1 >= nc || c2 >= nc) |
|
|
390 { |
|
|
391 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
392 return *this; |
|
|
393 } |
|
|
394 |
|
|
395 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
396 if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } |
|
|
397 |
|
|
398 for (int j = c1; j <= c2; j++) |
|
|
399 for (int i = r1; i <= r2; i++) |
|
|
400 elem (i, j) = val; |
|
|
401 |
|
|
402 return *this; |
|
|
403 } |
|
|
404 |
|
|
405 ComplexMatrix& |
|
|
406 ComplexMatrix::fill (const Complex& val, int r1, int c1, int r2, int c2) |
|
|
407 { |
|
|
408 int nr = rows (); |
|
|
409 int nc = cols (); |
|
|
410 if (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0 |
|
|
411 || r1 >= nr || r2 >= nr || c1 >= nc || c2 >= nc) |
|
|
412 { |
|
|
413 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
414 return *this; |
|
|
415 } |
|
|
416 |
|
|
417 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
418 if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } |
|
|
419 |
|
|
420 for (int j = c1; j <= c2; j++) |
|
|
421 for (int i = r1; i <= r2; i++) |
|
|
422 elem (i, j) = val; |
|
|
423 |
|
|
424 return *this; |
|
|
425 } |
|
|
426 |
|
|
427 ComplexMatrix |
|
|
428 ComplexMatrix::append (const Matrix& a) const |
|
|
429 { |
|
|
430 int nr = rows (); |
|
|
431 int nc = cols (); |
|
|
432 if (nr != a.rows ()) |
|
|
433 { |
|
|
434 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
435 return *this; |
|
|
436 } |
|
|
437 |
|
|
438 int nc_insert = nc; |
|
|
439 ComplexMatrix retval (nr, nc + a.cols ()); |
|
|
440 retval.insert (*this, 0, 0); |
|
|
441 retval.insert (a, 0, nc_insert); |
|
|
442 return retval; |
|
|
443 } |
|
|
444 |
|
|
445 ComplexMatrix |
|
|
446 ComplexMatrix::append (const RowVector& a) const |
|
|
447 { |
|
|
448 int nr = rows (); |
|
|
449 int nc = cols (); |
|
|
450 if (nr != 1) |
|
|
451 { |
|
|
452 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
453 return *this; |
|
|
454 } |
|
|
455 |
|
|
456 int nc_insert = nc; |
|
|
457 ComplexMatrix retval (nr, nc + a.length ()); |
|
|
458 retval.insert (*this, 0, 0); |
|
|
459 retval.insert (a, 0, nc_insert); |
|
|
460 return retval; |
|
|
461 } |
|
|
462 |
|
|
463 ComplexMatrix |
|
|
464 ComplexMatrix::append (const ColumnVector& a) const |
|
|
465 { |
|
|
466 int nr = rows (); |
|
|
467 int nc = cols (); |
|
|
468 if (nr != a.length ()) |
|
|
469 { |
|
|
470 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
471 return *this; |
|
|
472 } |
|
|
473 |
|
|
474 int nc_insert = nc; |
|
|
475 ComplexMatrix retval (nr, nc + 1); |
|
|
476 retval.insert (*this, 0, 0); |
|
|
477 retval.insert (a, 0, nc_insert); |
|
|
478 return retval; |
|
|
479 } |
|
|
480 |
|
|
481 ComplexMatrix |
|
|
482 ComplexMatrix::append (const DiagMatrix& a) const |
|
|
483 { |
|
|
484 int nr = rows (); |
|
|
485 int nc = cols (); |
|
|
486 if (nr != a.rows ()) |
|
|
487 { |
|
|
488 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
489 return *this; |
|
|
490 } |
|
|
491 |
|
|
492 int nc_insert = nc; |
|
|
493 ComplexMatrix retval (nr, nc + a.cols ()); |
|
|
494 retval.insert (*this, 0, 0); |
|
|
495 retval.insert (a, 0, nc_insert); |
|
|
496 return retval; |
|
|
497 } |
|
|
498 |
|
|
499 ComplexMatrix |
|
|
500 ComplexMatrix::append (const ComplexMatrix& a) const |
|
|
501 { |
|
|
502 int nr = rows (); |
|
|
503 int nc = cols (); |
|
|
504 if (nr != a.rows ()) |
|
|
505 { |
|
|
506 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
507 return *this; |
|
|
508 } |
|
|
509 |
|
|
510 int nc_insert = nc; |
|
|
511 ComplexMatrix retval (nr, nc + a.cols ()); |
|
|
512 retval.insert (*this, 0, 0); |
|
|
513 retval.insert (a, 0, nc_insert); |
|
|
514 return retval; |
|
|
515 } |
|
|
516 |
|
|
517 ComplexMatrix |
|
|
518 ComplexMatrix::append (const ComplexRowVector& a) const |
|
|
519 { |
|
|
520 int nr = rows (); |
|
|
521 int nc = cols (); |
|
|
522 if (nr != 1) |
|
|
523 { |
|
|
524 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
525 return *this; |
|
|
526 } |
|
|
527 |
|
|
528 int nc_insert = nc; |
|
|
529 ComplexMatrix retval (nr, nc + a.length ()); |
|
|
530 retval.insert (*this, 0, 0); |
|
|
531 retval.insert (a, 0, nc_insert); |
|
|
532 return retval; |
|
|
533 } |
|
|
534 |
|
|
535 ComplexMatrix |
|
|
536 ComplexMatrix::append (const ComplexColumnVector& a) const |
|
|
537 { |
|
|
538 int nr = rows (); |
|
|
539 int nc = cols (); |
|
|
540 if (nr != a.length ()) |
|
|
541 { |
|
|
542 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
543 return *this; |
|
|
544 } |
|
|
545 |
|
|
546 int nc_insert = nc; |
|
|
547 ComplexMatrix retval (nr, nc + 1); |
|
|
548 retval.insert (*this, 0, 0); |
|
|
549 retval.insert (a, 0, nc_insert); |
|
|
550 return retval; |
|
|
551 } |
|
|
552 |
|
|
553 ComplexMatrix |
|
|
554 ComplexMatrix::append (const ComplexDiagMatrix& a) const |
|
|
555 { |
|
|
556 int nr = rows (); |
|
|
557 int nc = cols (); |
|
|
558 if (nr != a.rows ()) |
|
|
559 { |
|
|
560 (*current_liboctave_error_handler) ("row dimension mismatch for append"); |
|
|
561 return *this; |
|
|
562 } |
|
|
563 |
|
|
564 int nc_insert = nc; |
|
|
565 ComplexMatrix retval (nr, nc + a.cols ()); |
|
|
566 retval.insert (*this, 0, 0); |
|
|
567 retval.insert (a, 0, nc_insert); |
|
|
568 return retval; |
|
|
569 } |
|
|
570 |
|
|
571 ComplexMatrix |
|
|
572 ComplexMatrix::stack (const Matrix& a) const |
|
|
573 { |
|
|
574 int nr = rows (); |
|
|
575 int nc = cols (); |
|
|
576 if (nc != a.cols ()) |
|
|
577 { |
|
|
578 (*current_liboctave_error_handler) |
|
|
579 ("column dimension mismatch for stack"); |
|
|
580 return *this; |
|
|
581 } |
|
|
582 |
|
|
583 int nr_insert = nr; |
|
|
584 ComplexMatrix retval (nr + a.rows (), nc); |
|
|
585 retval.insert (*this, 0, 0); |
|
|
586 retval.insert (a, nr_insert, 0); |
|
|
587 return retval; |
|
|
588 } |
|
|
589 |
|
|
590 ComplexMatrix |
|
|
591 ComplexMatrix::stack (const RowVector& a) const |
|
|
592 { |
|
|
593 int nr = rows (); |
|
|
594 int nc = cols (); |
|
|
595 if (nc != a.length ()) |
|
|
596 { |
|
|
597 (*current_liboctave_error_handler) |
|
|
598 ("column dimension mismatch for stack"); |
|
|
599 return *this; |
|
|
600 } |
|
|
601 |
|
|
602 int nr_insert = nr; |
|
|
603 ComplexMatrix retval (nr + 1, nc); |
|
|
604 retval.insert (*this, 0, 0); |
|
|
605 retval.insert (a, nr_insert, 0); |
|
|
606 return retval; |
|
|
607 } |
|
|
608 |
|
|
609 ComplexMatrix |
|
|
610 ComplexMatrix::stack (const ColumnVector& a) const |
|
|
611 { |
|
|
612 int nr = rows (); |
|
|
613 int nc = cols (); |
|
|
614 if (nc != 1) |
|
|
615 { |
|
|
616 (*current_liboctave_error_handler) |
|
|
617 ("column dimension mismatch for stack"); |
|
|
618 return *this; |
|
|
619 } |
|
|
620 |
|
|
621 int nr_insert = nr; |
|
|
622 ComplexMatrix retval (nr + a.length (), nc); |
|
|
623 retval.insert (*this, 0, 0); |
|
|
624 retval.insert (a, nr_insert, 0); |
|
|
625 return retval; |
|
|
626 } |
|
|
627 |
|
|
628 ComplexMatrix |
|
|
629 ComplexMatrix::stack (const DiagMatrix& a) const |
|
|
630 { |
|
|
631 int nr = rows (); |
|
|
632 int nc = cols (); |
|
|
633 if (nc != a.cols ()) |
|
|
634 { |
|
|
635 (*current_liboctave_error_handler) |
|
|
636 ("column dimension mismatch for stack"); |
|
|
637 return *this; |
|
|
638 } |
|
|
639 |
|
|
640 int nr_insert = nr; |
|
|
641 ComplexMatrix retval (nr + a.rows (), nc); |
|
|
642 retval.insert (*this, 0, 0); |
|
|
643 retval.insert (a, nr_insert, 0); |
|
|
644 return retval; |
|
|
645 } |
|
|
646 |
|
|
647 ComplexMatrix |
|
|
648 ComplexMatrix::stack (const ComplexMatrix& a) const |
|
|
649 { |
|
|
650 int nr = rows (); |
|
|
651 int nc = cols (); |
|
|
652 if (nc != a.cols ()) |
|
|
653 { |
|
|
654 (*current_liboctave_error_handler) |
|
|
655 ("column dimension mismatch for stack"); |
|
|
656 return *this; |
|
|
657 } |
|
|
658 |
|
|
659 int nr_insert = nr; |
|
|
660 ComplexMatrix retval (nr + a.rows (), nc); |
|
|
661 retval.insert (*this, 0, 0); |
|
|
662 retval.insert (a, nr_insert, 0); |
|
|
663 return retval; |
|
|
664 } |
|
|
665 |
|
|
666 ComplexMatrix |
|
|
667 ComplexMatrix::stack (const ComplexRowVector& a) const |
|
|
668 { |
|
|
669 int nr = rows (); |
|
|
670 int nc = cols (); |
|
|
671 if (nc != a.length ()) |
|
|
672 { |
|
|
673 (*current_liboctave_error_handler) |
|
|
674 ("column dimension mismatch for stack"); |
|
|
675 return *this; |
|
|
676 } |
|
|
677 |
|
|
678 int nr_insert = nr; |
|
|
679 ComplexMatrix retval (nr + 1, nc); |
|
|
680 retval.insert (*this, 0, 0); |
|
|
681 retval.insert (a, nr_insert, 0); |
|
|
682 return retval; |
|
|
683 } |
|
|
684 |
|
|
685 ComplexMatrix |
|
|
686 ComplexMatrix::stack (const ComplexColumnVector& a) const |
|
|
687 { |
|
|
688 int nr = rows (); |
|
|
689 int nc = cols (); |
|
|
690 if (nc != 1) |
|
|
691 { |
|
|
692 (*current_liboctave_error_handler) |
|
|
693 ("column dimension mismatch for stack"); |
|
|
694 return *this; |
|
|
695 } |
|
|
696 |
|
|
697 int nr_insert = nr; |
|
|
698 ComplexMatrix retval (nr + a.length (), nc); |
|
|
699 retval.insert (*this, 0, 0); |
|
|
700 retval.insert (a, nr_insert, 0); |
|
|
701 return retval; |
|
|
702 } |
|
|
703 |
|
|
704 ComplexMatrix |
|
|
705 ComplexMatrix::stack (const ComplexDiagMatrix& a) const |
|
|
706 { |
|
|
707 int nr = rows (); |
|
|
708 int nc = cols (); |
|
|
709 if (nc != a.cols ()) |
|
|
710 { |
|
|
711 (*current_liboctave_error_handler) |
|
|
712 ("column dimension mismatch for stack"); |
|
|
713 return *this; |
|
|
714 } |
|
|
715 |
|
|
716 int nr_insert = nr; |
|
|
717 ComplexMatrix retval (nr + a.rows (), nc); |
|
|
718 retval.insert (*this, 0, 0); |
|
|
719 retval.insert (a, nr_insert, 0); |
|
|
720 return retval; |
|
|
721 } |
|
|
722 |
|
|
723 ComplexMatrix |
|
|
724 ComplexMatrix::hermitian (void) const |
|
|
725 { |
|
|
726 int nr = rows (); |
|
|
727 int nc = cols (); |
|
|
728 ComplexMatrix result; |
|
|
729 if (length () > 0) |
|
|
730 { |
|
|
731 result.resize (nc, nr); |
|
|
732 for (int j = 0; j < nc; j++) |
|
|
733 for (int i = 0; i < nr; i++) |
|
|
734 result.elem (j, i) = conj (elem (i, j)); |
|
|
735 } |
|
|
736 return result; |
|
|
737 } |
|
|
738 |
|
|
739 ComplexMatrix |
|
|
740 conj (const ComplexMatrix& a) |
|
|
741 { |
|
|
742 int a_len = a.length (); |
|
|
743 ComplexMatrix retval; |
|
|
744 if (a_len > 0) |
|
|
745 retval = ComplexMatrix (conj_dup (a.data (), a_len), a.rows (), |
|
|
746 a.cols ()); |
|
|
747 return retval; |
|
|
748 } |
|
|
749 |
|
|
750 // resize is the destructive equivalent for this one |
|
|
751 |
|
|
752 ComplexMatrix |
|
|
753 ComplexMatrix::extract (int r1, int c1, int r2, int c2) const |
|
|
754 { |
|
|
755 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
756 if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } |
|
|
757 |
|
|
758 int new_r = r2 - r1 + 1; |
|
|
759 int new_c = c2 - c1 + 1; |
|
|
760 |
|
|
761 ComplexMatrix result (new_r, new_c); |
|
|
762 |
|
|
763 for (int j = 0; j < new_c; j++) |
|
|
764 for (int i = 0; i < new_r; i++) |
|
|
765 result.elem (i, j) = elem (r1+i, c1+j); |
|
|
766 |
|
|
767 return result; |
|
|
768 } |
|
|
769 |
|
|
770 // extract row or column i. |
|
|
771 |
|
|
772 ComplexRowVector |
|
|
773 ComplexMatrix::row (int i) const |
|
|
774 { |
|
|
775 int nc = cols (); |
|
|
776 if (i < 0 || i >= rows ()) |
|
|
777 { |
|
|
778 (*current_liboctave_error_handler) ("invalid row selection"); |
|
|
779 return ComplexRowVector (); |
|
|
780 } |
|
|
781 |
|
|
782 ComplexRowVector retval (nc); |
|
|
783 for (int j = 0; j < cols (); j++) |
|
|
784 retval.elem (j) = elem (i, j); |
|
|
785 |
|
|
786 return retval; |
|
|
787 } |
|
|
788 |
|
|
789 ComplexRowVector |
|
|
790 ComplexMatrix::row (char *s) const |
|
|
791 { |
|
533
|
792 if (! s) |
|
458
|
793 { |
|
|
794 (*current_liboctave_error_handler) ("invalid row selection"); |
|
|
795 return ComplexRowVector (); |
|
|
796 } |
|
|
797 |
|
|
798 char c = *s; |
|
|
799 if (c == 'f' || c == 'F') |
|
|
800 return row (0); |
|
|
801 else if (c == 'l' || c == 'L') |
|
|
802 return row (rows () - 1); |
|
|
803 else |
|
|
804 { |
|
|
805 (*current_liboctave_error_handler) ("invalid row selection"); |
|
|
806 return ComplexRowVector (); |
|
|
807 } |
|
|
808 } |
|
|
809 |
|
|
810 ComplexColumnVector |
|
|
811 ComplexMatrix::column (int i) const |
|
|
812 { |
|
|
813 int nr = rows (); |
|
|
814 if (i < 0 || i >= cols ()) |
|
|
815 { |
|
|
816 (*current_liboctave_error_handler) ("invalid column selection"); |
|
|
817 return ComplexColumnVector (); |
|
|
818 } |
|
|
819 |
|
|
820 ComplexColumnVector retval (nr); |
|
|
821 for (int j = 0; j < nr; j++) |
|
|
822 retval.elem (j) = elem (j, i); |
|
|
823 |
|
|
824 return retval; |
|
|
825 } |
|
|
826 |
|
|
827 ComplexColumnVector |
|
|
828 ComplexMatrix::column (char *s) const |
|
|
829 { |
|
533
|
830 if (! s) |
|
458
|
831 { |
|
|
832 (*current_liboctave_error_handler) ("invalid column selection"); |
|
|
833 return ComplexColumnVector (); |
|
|
834 } |
|
|
835 |
|
|
836 char c = *s; |
|
|
837 if (c == 'f' || c == 'F') |
|
|
838 return column (0); |
|
|
839 else if (c == 'l' || c == 'L') |
|
|
840 return column (cols () - 1); |
|
|
841 else |
|
|
842 { |
|
|
843 (*current_liboctave_error_handler) ("invalid column selection"); |
|
|
844 return ComplexColumnVector (); |
|
|
845 } |
|
|
846 } |
|
|
847 |
|
|
848 ComplexMatrix |
|
|
849 ComplexMatrix::inverse (void) const |
|
|
850 { |
|
|
851 int info; |
|
479
|
852 double rcond; |
|
|
853 return inverse (info, rcond); |
|
458
|
854 } |
|
|
855 |
|
|
856 ComplexMatrix |
|
|
857 ComplexMatrix::inverse (int& info) const |
|
|
858 { |
|
|
859 double rcond; |
|
|
860 return inverse (info, rcond); |
|
|
861 } |
|
|
862 |
|
|
863 ComplexMatrix |
|
1656
|
864 ComplexMatrix::inverse (int& info, double& rcond, int force) const |
|
458
|
865 { |
|
1948
|
866 ComplexMatrix retval; |
|
|
867 |
|
458
|
868 int nr = rows (); |
|
|
869 int nc = cols (); |
|
1948
|
870 |
|
458
|
871 if (nr != nc) |
|
1948
|
872 (*current_liboctave_error_handler) ("inverse requires square matrix"); |
|
458
|
873 else |
|
|
874 { |
|
1948
|
875 info = 0; |
|
|
876 |
|
|
877 Array<int> ipvt (nr); |
|
|
878 int *pipvt = ipvt.fortran_vec (); |
|
|
879 |
|
|
880 Array<Complex> z (nr); |
|
|
881 Complex *pz = z.fortran_vec (); |
|
|
882 |
|
|
883 retval = *this; |
|
|
884 Complex *tmp_data = retval.fortran_vec (); |
|
|
885 |
|
|
886 F77_XFCN (zgeco, ZGECO, (tmp_data, nr, nc, pipvt, rcond, pz)); |
|
|
887 |
|
|
888 if (f77_exception_encountered) |
|
|
889 (*current_liboctave_error_handler) ("unrecoverable error in zgeco"); |
|
|
890 else |
|
|
891 { |
|
|
892 volatile double rcond_plus_one = rcond + 1.0; |
|
|
893 |
|
|
894 if (rcond_plus_one == 1.0) |
|
|
895 info = -1; |
|
|
896 |
|
|
897 if (info == -1 && ! force) |
|
|
898 retval = *this; // Restore contents. |
|
|
899 else |
|
|
900 { |
|
|
901 Complex *dummy = 0; |
|
|
902 |
|
|
903 F77_XFCN (zgedi, ZGEDI, (tmp_data, nr, nc, pipvt, dummy, |
|
|
904 pz, 1)); |
|
|
905 |
|
|
906 if (f77_exception_encountered) |
|
|
907 (*current_liboctave_error_handler) |
|
|
908 ("unrecoverable error in zgedi"); |
|
|
909 } |
|
|
910 } |
|
458
|
911 } |
|
|
912 |
|
1948
|
913 return retval; |
|
458
|
914 } |
|
|
915 |
|
|
916 ComplexMatrix |
|
740
|
917 ComplexMatrix::pseudo_inverse (double tol) |
|
|
918 { |
|
1549
|
919 ComplexMatrix retval; |
|
|
920 |
|
3480
|
921 ComplexSVD result (*this, SVD::economy); |
|
740
|
922 |
|
|
923 DiagMatrix S = result.singular_values (); |
|
|
924 ComplexMatrix U = result.left_singular_matrix (); |
|
|
925 ComplexMatrix V = result.right_singular_matrix (); |
|
|
926 |
|
|
927 ColumnVector sigma = S.diag (); |
|
|
928 |
|
|
929 int r = sigma.length () - 1; |
|
|
930 int nr = rows (); |
|
|
931 int nc = cols (); |
|
|
932 |
|
|
933 if (tol <= 0.0) |
|
|
934 { |
|
|
935 if (nr > nc) |
|
|
936 tol = nr * sigma.elem (0) * DBL_EPSILON; |
|
|
937 else |
|
|
938 tol = nc * sigma.elem (0) * DBL_EPSILON; |
|
|
939 } |
|
|
940 |
|
|
941 while (r >= 0 && sigma.elem (r) < tol) |
|
|
942 r--; |
|
|
943 |
|
|
944 if (r < 0) |
|
1549
|
945 retval = ComplexMatrix (nc, nr, 0.0); |
|
740
|
946 else |
|
|
947 { |
|
|
948 ComplexMatrix Ur = U.extract (0, 0, nr-1, r); |
|
|
949 DiagMatrix D = DiagMatrix (sigma.extract (0, r)) . inverse (); |
|
|
950 ComplexMatrix Vr = V.extract (0, 0, nc-1, r); |
|
1549
|
951 retval = Vr * D * Ur.hermitian (); |
|
740
|
952 } |
|
1549
|
953 |
|
|
954 return retval; |
|
740
|
955 } |
|
|
956 |
|
|
957 ComplexMatrix |
|
458
|
958 ComplexMatrix::fourier (void) const |
|
|
959 { |
|
1948
|
960 ComplexMatrix retval; |
|
|
961 |
|
458
|
962 int nr = rows (); |
|
|
963 int nc = cols (); |
|
1948
|
964 |
|
458
|
965 int npts, nsamples; |
|
1948
|
966 |
|
458
|
967 if (nr == 1 || nc == 1) |
|
|
968 { |
|
|
969 npts = nr > nc ? nr : nc; |
|
|
970 nsamples = 1; |
|
|
971 } |
|
|
972 else |
|
|
973 { |
|
|
974 npts = nr; |
|
|
975 nsamples = nc; |
|
|
976 } |
|
|
977 |
|
|
978 int nn = 4*npts+15; |
|
1948
|
979 |
|
|
980 Array<Complex> wsave (nn); |
|
|
981 Complex *pwsave = wsave.fortran_vec (); |
|
|
982 |
|
|
983 retval = *this; |
|
|
984 Complex *tmp_data = retval.fortran_vec (); |
|
|
985 |
|
|
986 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
458
|
987 |
|
|
988 for (int j = 0; j < nsamples; j++) |
|
1948
|
989 F77_FCN (cfftf, CFFTF) (npts, &tmp_data[npts*j], pwsave); |
|
|
990 |
|
|
991 return retval; |
|
458
|
992 } |
|
|
993 |
|
|
994 ComplexMatrix |
|
|
995 ComplexMatrix::ifourier (void) const |
|
|
996 { |
|
1948
|
997 ComplexMatrix retval; |
|
|
998 |
|
458
|
999 int nr = rows (); |
|
|
1000 int nc = cols (); |
|
1948
|
1001 |
|
458
|
1002 int npts, nsamples; |
|
1948
|
1003 |
|
458
|
1004 if (nr == 1 || nc == 1) |
|
|
1005 { |
|
|
1006 npts = nr > nc ? nr : nc; |
|
|
1007 nsamples = 1; |
|
|
1008 } |
|
|
1009 else |
|
|
1010 { |
|
|
1011 npts = nr; |
|
|
1012 nsamples = nc; |
|
|
1013 } |
|
|
1014 |
|
|
1015 int nn = 4*npts+15; |
|
1948
|
1016 |
|
|
1017 Array<Complex> wsave (nn); |
|
|
1018 Complex *pwsave = wsave.fortran_vec (); |
|
|
1019 |
|
|
1020 retval = *this; |
|
|
1021 Complex *tmp_data = retval.fortran_vec (); |
|
|
1022 |
|
|
1023 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
458
|
1024 |
|
|
1025 for (int j = 0; j < nsamples; j++) |
|
1948
|
1026 F77_FCN (cfftb, CFFTB) (npts, &tmp_data[npts*j], pwsave); |
|
458
|
1027 |
|
1321
|
1028 for (int j = 0; j < npts*nsamples; j++) |
|
2800
|
1029 tmp_data[j] = tmp_data[j] / npts; |
|
458
|
1030 |
|
1948
|
1031 return retval; |
|
458
|
1032 } |
|
|
1033 |
|
677
|
1034 ComplexMatrix |
|
|
1035 ComplexMatrix::fourier2d (void) const |
|
|
1036 { |
|
1948
|
1037 ComplexMatrix retval; |
|
|
1038 |
|
677
|
1039 int nr = rows (); |
|
|
1040 int nc = cols (); |
|
1948
|
1041 |
|
677
|
1042 int npts, nsamples; |
|
1948
|
1043 |
|
677
|
1044 if (nr == 1 || nc == 1) |
|
|
1045 { |
|
|
1046 npts = nr > nc ? nr : nc; |
|
|
1047 nsamples = 1; |
|
|
1048 } |
|
|
1049 else |
|
|
1050 { |
|
|
1051 npts = nr; |
|
|
1052 nsamples = nc; |
|
|
1053 } |
|
|
1054 |
|
|
1055 int nn = 4*npts+15; |
|
1948
|
1056 |
|
|
1057 Array<Complex> wsave (nn); |
|
|
1058 Complex *pwsave = wsave.fortran_vec (); |
|
|
1059 |
|
|
1060 retval = *this; |
|
|
1061 Complex *tmp_data = retval.fortran_vec (); |
|
|
1062 |
|
|
1063 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
677
|
1064 |
|
|
1065 for (int j = 0; j < nsamples; j++) |
|
1948
|
1066 F77_FCN (cfftf, CFFTF) (npts, &tmp_data[npts*j], pwsave); |
|
677
|
1067 |
|
|
1068 npts = nc; |
|
|
1069 nsamples = nr; |
|
|
1070 nn = 4*npts+15; |
|
1948
|
1071 |
|
|
1072 wsave.resize (nn); |
|
|
1073 pwsave = wsave.fortran_vec (); |
|
|
1074 |
|
|
1075 Array<Complex> row (npts); |
|
|
1076 Complex *prow = row.fortran_vec (); |
|
|
1077 |
|
|
1078 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
677
|
1079 |
|
1321
|
1080 for (int j = 0; j < nsamples; j++) |
|
677
|
1081 { |
|
|
1082 for (int i = 0; i < npts; i++) |
|
1948
|
1083 prow[i] = tmp_data[i*nr + j]; |
|
|
1084 |
|
|
1085 F77_FCN (cfftf, CFFTF) (npts, prow, pwsave); |
|
677
|
1086 |
|
1321
|
1087 for (int i = 0; i < npts; i++) |
|
1948
|
1088 tmp_data[i*nr + j] = prow[i]; |
|
677
|
1089 } |
|
|
1090 |
|
1948
|
1091 return retval; |
|
677
|
1092 } |
|
|
1093 |
|
|
1094 ComplexMatrix |
|
|
1095 ComplexMatrix::ifourier2d (void) const |
|
|
1096 { |
|
1948
|
1097 ComplexMatrix retval; |
|
|
1098 |
|
677
|
1099 int nr = rows (); |
|
|
1100 int nc = cols (); |
|
1948
|
1101 |
|
677
|
1102 int npts, nsamples; |
|
1948
|
1103 |
|
677
|
1104 if (nr == 1 || nc == 1) |
|
|
1105 { |
|
|
1106 npts = nr > nc ? nr : nc; |
|
|
1107 nsamples = 1; |
|
|
1108 } |
|
|
1109 else |
|
|
1110 { |
|
|
1111 npts = nr; |
|
|
1112 nsamples = nc; |
|
|
1113 } |
|
|
1114 |
|
|
1115 int nn = 4*npts+15; |
|
1948
|
1116 |
|
|
1117 Array<Complex> wsave (nn); |
|
|
1118 Complex *pwsave = wsave.fortran_vec (); |
|
|
1119 |
|
|
1120 retval = *this; |
|
|
1121 Complex *tmp_data = retval.fortran_vec (); |
|
|
1122 |
|
|
1123 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
677
|
1124 |
|
|
1125 for (int j = 0; j < nsamples; j++) |
|
1948
|
1126 F77_FCN (cfftb, CFFTB) (npts, &tmp_data[npts*j], pwsave); |
|
677
|
1127 |
|
1321
|
1128 for (int j = 0; j < npts*nsamples; j++) |
|
2800
|
1129 tmp_data[j] = tmp_data[j] / npts; |
|
677
|
1130 |
|
|
1131 npts = nc; |
|
|
1132 nsamples = nr; |
|
|
1133 nn = 4*npts+15; |
|
1948
|
1134 |
|
|
1135 wsave.resize (nn); |
|
|
1136 pwsave = wsave.fortran_vec (); |
|
|
1137 |
|
|
1138 Array<Complex> row (npts); |
|
|
1139 Complex *prow = row.fortran_vec (); |
|
|
1140 |
|
|
1141 F77_FCN (cffti, CFFTI) (npts, pwsave); |
|
677
|
1142 |
|
1321
|
1143 for (int j = 0; j < nsamples; j++) |
|
677
|
1144 { |
|
|
1145 for (int i = 0; i < npts; i++) |
|
1948
|
1146 prow[i] = tmp_data[i*nr + j]; |
|
|
1147 |
|
|
1148 F77_FCN (cfftb, CFFTB) (npts, prow, pwsave); |
|
677
|
1149 |
|
1321
|
1150 for (int i = 0; i < npts; i++) |
|
2800
|
1151 tmp_data[i*nr + j] = prow[i] / npts; |
|
677
|
1152 } |
|
|
1153 |
|
1948
|
1154 return retval; |
|
677
|
1155 } |
|
|
1156 |
|
458
|
1157 ComplexDET |
|
|
1158 ComplexMatrix::determinant (void) const |
|
|
1159 { |
|
|
1160 int info; |
|
|
1161 double rcond; |
|
|
1162 return determinant (info, rcond); |
|
|
1163 } |
|
|
1164 |
|
|
1165 ComplexDET |
|
|
1166 ComplexMatrix::determinant (int& info) const |
|
|
1167 { |
|
|
1168 double rcond; |
|
|
1169 return determinant (info, rcond); |
|
|
1170 } |
|
|
1171 |
|
|
1172 ComplexDET |
|
532
|
1173 ComplexMatrix::determinant (int& info, double& rcond) const |
|
458
|
1174 { |
|
|
1175 ComplexDET retval; |
|
|
1176 |
|
|
1177 int nr = rows (); |
|
|
1178 int nc = cols (); |
|
|
1179 |
|
|
1180 if (nr == 0 || nc == 0) |
|
|
1181 { |
|
|
1182 Complex d[2]; |
|
|
1183 d[0] = 1.0; |
|
|
1184 d[1] = 0.0; |
|
|
1185 retval = ComplexDET (d); |
|
|
1186 } |
|
|
1187 else |
|
|
1188 { |
|
|
1189 info = 0; |
|
1948
|
1190 |
|
|
1191 Array<int> ipvt (nr); |
|
|
1192 int *pipvt = ipvt.fortran_vec (); |
|
|
1193 |
|
|
1194 Array<Complex> z (nr); |
|
|
1195 Complex *pz = z.fortran_vec (); |
|
|
1196 |
|
|
1197 ComplexMatrix atmp = *this; |
|
|
1198 Complex *tmp_data = atmp.fortran_vec (); |
|
|
1199 |
|
|
1200 F77_XFCN (zgeco, ZGECO, (tmp_data, nr, nr, pipvt, rcond, pz)); |
|
|
1201 |
|
|
1202 if (f77_exception_encountered) |
|
|
1203 (*current_liboctave_error_handler) ("unrecoverable error in zgeco"); |
|
458
|
1204 else |
|
|
1205 { |
|
1948
|
1206 volatile double rcond_plus_one = rcond + 1.0; |
|
|
1207 |
|
|
1208 if (rcond_plus_one == 1.0) |
|
|
1209 { |
|
|
1210 info = -1; |
|
|
1211 retval = ComplexDET (); |
|
|
1212 } |
|
|
1213 else |
|
|
1214 { |
|
|
1215 Complex d[2]; |
|
|
1216 |
|
|
1217 F77_XFCN (zgedi, ZGEDI, (tmp_data, nr, nr, pipvt, d, pz, 10)); |
|
|
1218 |
|
|
1219 if (f77_exception_encountered) |
|
|
1220 (*current_liboctave_error_handler) |
|
|
1221 ("unrecoverable error in dgedi"); |
|
|
1222 else |
|
|
1223 retval = ComplexDET (d); |
|
|
1224 } |
|
458
|
1225 } |
|
|
1226 } |
|
|
1227 |
|
|
1228 return retval; |
|
|
1229 } |
|
|
1230 |
|
|
1231 ComplexMatrix |
|
|
1232 ComplexMatrix::solve (const Matrix& b) const |
|
|
1233 { |
|
|
1234 int info; |
|
|
1235 double rcond; |
|
3480
|
1236 return solve (b, info, rcond, 0); |
|
458
|
1237 } |
|
|
1238 |
|
|
1239 ComplexMatrix |
|
|
1240 ComplexMatrix::solve (const Matrix& b, int& info) const |
|
|
1241 { |
|
|
1242 double rcond; |
|
3480
|
1243 return solve (b, info, rcond, 0); |
|
458
|
1244 } |
|
|
1245 |
|
|
1246 ComplexMatrix |
|
|
1247 ComplexMatrix::solve (const Matrix& b, int& info, double& rcond) const |
|
|
1248 { |
|
3480
|
1249 return solve (b, info, rcond, 0); |
|
|
1250 } |
|
|
1251 |
|
|
1252 ComplexMatrix |
|
|
1253 ComplexMatrix::solve (const Matrix& b, int& info, double& rcond, |
|
|
1254 solve_singularity_handler sing_handler) const |
|
|
1255 { |
|
458
|
1256 ComplexMatrix tmp (b); |
|
3480
|
1257 return solve (tmp, info, rcond, sing_handler); |
|
458
|
1258 } |
|
|
1259 |
|
|
1260 ComplexMatrix |
|
|
1261 ComplexMatrix::solve (const ComplexMatrix& b) const |
|
|
1262 { |
|
|
1263 int info; |
|
|
1264 double rcond; |
|
3480
|
1265 return solve (b, info, rcond, 0); |
|
458
|
1266 } |
|
|
1267 |
|
|
1268 ComplexMatrix |
|
|
1269 ComplexMatrix::solve (const ComplexMatrix& b, int& info) const |
|
|
1270 { |
|
|
1271 double rcond; |
|
3480
|
1272 return solve (b, info, rcond, 0); |
|
458
|
1273 } |
|
3480
|
1274 |
|
458
|
1275 ComplexMatrix |
|
532
|
1276 ComplexMatrix::solve (const ComplexMatrix& b, int& info, double& rcond) const |
|
458
|
1277 { |
|
3480
|
1278 return solve (b, info, rcond, 0); |
|
|
1279 } |
|
|
1280 |
|
|
1281 ComplexMatrix |
|
|
1282 ComplexMatrix::solve (const ComplexMatrix& b, int& info, double& rcond, |
|
|
1283 solve_singularity_handler sing_handler) const |
|
|
1284 { |
|
458
|
1285 ComplexMatrix retval; |
|
|
1286 |
|
|
1287 int nr = rows (); |
|
|
1288 int nc = cols (); |
|
1948
|
1289 |
|
|
1290 if (nr == 0 || nc == 0 || nr != nc || nr != b.rows ()) |
|
|
1291 (*current_liboctave_error_handler) |
|
|
1292 ("matrix dimension mismatch in solution of linear equations"); |
|
458
|
1293 else |
|
|
1294 { |
|
1948
|
1295 info = 0; |
|
|
1296 |
|
|
1297 Array<int> ipvt (nr); |
|
|
1298 int *pipvt = ipvt.fortran_vec (); |
|
|
1299 |
|
|
1300 Array<Complex> z (nr); |
|
|
1301 Complex *pz = z.fortran_vec (); |
|
|
1302 |
|
|
1303 ComplexMatrix atmp = *this; |
|
|
1304 Complex *tmp_data = atmp.fortran_vec (); |
|
|
1305 |
|
|
1306 F77_XFCN (zgeco, ZGECO, (tmp_data, nr, nr, pipvt, rcond, pz)); |
|
|
1307 |
|
|
1308 if (f77_exception_encountered) |
|
|
1309 (*current_liboctave_error_handler) ("unrecoverable error in zgeco"); |
|
|
1310 else |
|
|
1311 { |
|
|
1312 volatile double rcond_plus_one = rcond + 1.0; |
|
|
1313 |
|
|
1314 if (rcond_plus_one == 1.0) |
|
|
1315 { |
|
|
1316 info = -2; |
|
3480
|
1317 |
|
|
1318 if (sing_handler) |
|
|
1319 sing_handler (rcond); |
|
|
1320 else |
|
|
1321 (*current_liboctave_error_handler) |
|
|
1322 ("matrix singular to machine precision, rcond = %g", |
|
|
1323 rcond); |
|
1948
|
1324 } |
|
|
1325 else |
|
|
1326 { |
|
|
1327 retval = b; |
|
|
1328 Complex *result = retval.fortran_vec (); |
|
|
1329 |
|
|
1330 int b_nc = b.cols (); |
|
|
1331 |
|
|
1332 for (volatile int j = 0; j < b_nc; j++) |
|
|
1333 { |
|
|
1334 F77_XFCN (zgesl, ZGESL, (tmp_data, nr, nr, pipvt, |
|
|
1335 &result[nr*j], 0)); |
|
|
1336 |
|
|
1337 if (f77_exception_encountered) |
|
|
1338 { |
|
|
1339 (*current_liboctave_error_handler) |
|
|
1340 ("unrecoverable error in dgesl"); |
|
|
1341 |
|
|
1342 break; |
|
|
1343 } |
|
|
1344 } |
|
|
1345 } |
|
|
1346 } |
|
458
|
1347 } |
|
|
1348 |
|
|
1349 return retval; |
|
|
1350 } |
|
|
1351 |
|
|
1352 ComplexColumnVector |
|
|
1353 ComplexMatrix::solve (const ComplexColumnVector& b) const |
|
|
1354 { |
|
|
1355 int info; |
|
|
1356 double rcond; |
|
3480
|
1357 return solve (b, info, rcond, 0); |
|
458
|
1358 } |
|
|
1359 |
|
|
1360 ComplexColumnVector |
|
|
1361 ComplexMatrix::solve (const ComplexColumnVector& b, int& info) const |
|
|
1362 { |
|
|
1363 double rcond; |
|
3480
|
1364 return solve (b, info, rcond, 0); |
|
458
|
1365 } |
|
|
1366 |
|
|
1367 ComplexColumnVector |
|
|
1368 ComplexMatrix::solve (const ComplexColumnVector& b, int& info, |
|
532
|
1369 double& rcond) const |
|
458
|
1370 { |
|
3480
|
1371 return solve (b, info, rcond, 0); |
|
|
1372 } |
|
|
1373 |
|
|
1374 ComplexColumnVector |
|
|
1375 ComplexMatrix::solve (const ComplexColumnVector& b, int& info, |
|
|
1376 double& rcond, |
|
|
1377 solve_singularity_handler sing_handler) const |
|
|
1378 { |
|
458
|
1379 ComplexColumnVector retval; |
|
|
1380 |
|
|
1381 int nr = rows (); |
|
|
1382 int nc = cols (); |
|
1948
|
1383 |
|
|
1384 if (nr == 0 || nc == 0 || nr != nc || nr != b.length ()) |
|
|
1385 (*current_liboctave_error_handler) |
|
|
1386 ("matrix dimension mismatch in solution of linear equations"); |
|
458
|
1387 else |
|
|
1388 { |
|
1948
|
1389 info = 0; |
|
|
1390 |
|
|
1391 Array<int> ipvt (nr); |
|
|
1392 int *pipvt = ipvt.fortran_vec (); |
|
|
1393 |
|
|
1394 Array<Complex> z (nr); |
|
|
1395 Complex *pz = z.fortran_vec (); |
|
|
1396 |
|
|
1397 ComplexMatrix atmp = *this; |
|
|
1398 Complex *tmp_data = atmp.fortran_vec (); |
|
|
1399 |
|
|
1400 F77_XFCN (zgeco, ZGECO, (tmp_data, nr, nr, pipvt, rcond, pz)); |
|
|
1401 |
|
|
1402 if (f77_exception_encountered) |
|
|
1403 (*current_liboctave_error_handler) |
|
|
1404 ("unrecoverable error in dgeco"); |
|
|
1405 else |
|
|
1406 { |
|
|
1407 volatile double rcond_plus_one = rcond + 1.0; |
|
|
1408 |
|
|
1409 if (rcond_plus_one == 1.0) |
|
|
1410 { |
|
|
1411 info = -2; |
|
3480
|
1412 |
|
|
1413 if (sing_handler) |
|
|
1414 sing_handler (rcond); |
|
|
1415 else |
|
|
1416 (*current_liboctave_error_handler) |
|
|
1417 ("matrix singular to machine precision, rcond = %g", |
|
|
1418 rcond); |
|
1948
|
1419 } |
|
|
1420 else |
|
|
1421 { |
|
|
1422 retval = b; |
|
|
1423 Complex *result = retval.fortran_vec (); |
|
|
1424 |
|
|
1425 F77_XFCN (zgesl, ZGESL, (tmp_data, nr, nr, pipvt, result, 0)); |
|
|
1426 |
|
|
1427 if (f77_exception_encountered) |
|
|
1428 (*current_liboctave_error_handler) |
|
|
1429 ("unrecoverable error in dgesl"); |
|
|
1430 } |
|
|
1431 } |
|
458
|
1432 } |
|
|
1433 |
|
|
1434 return retval; |
|
|
1435 } |
|
|
1436 |
|
|
1437 ComplexMatrix |
|
|
1438 ComplexMatrix::lssolve (const ComplexMatrix& b) const |
|
|
1439 { |
|
|
1440 int info; |
|
|
1441 int rank; |
|
|
1442 return lssolve (b, info, rank); |
|
|
1443 } |
|
|
1444 |
|
|
1445 ComplexMatrix |
|
|
1446 ComplexMatrix::lssolve (const ComplexMatrix& b, int& info) const |
|
|
1447 { |
|
|
1448 int rank; |
|
|
1449 return lssolve (b, info, rank); |
|
|
1450 } |
|
|
1451 |
|
|
1452 ComplexMatrix |
|
|
1453 ComplexMatrix::lssolve (const ComplexMatrix& b, int& info, int& rank) const |
|
|
1454 { |
|
1948
|
1455 ComplexMatrix retval; |
|
|
1456 |
|
458
|
1457 int nrhs = b.cols (); |
|
|
1458 |
|
|
1459 int m = rows (); |
|
|
1460 int n = cols (); |
|
|
1461 |
|
|
1462 if (m == 0 || n == 0 || m != b.rows ()) |
|
1948
|
1463 (*current_liboctave_error_handler) |
|
|
1464 ("matrix dimension mismatch solution of linear equations"); |
|
|
1465 else |
|
458
|
1466 { |
|
1948
|
1467 ComplexMatrix atmp = *this; |
|
|
1468 Complex *tmp_data = atmp.fortran_vec (); |
|
|
1469 |
|
|
1470 int nrr = m > n ? m : n; |
|
|
1471 ComplexMatrix result (nrr, nrhs); |
|
|
1472 |
|
|
1473 for (int j = 0; j < nrhs; j++) |
|
|
1474 for (int i = 0; i < m; i++) |
|
|
1475 result.elem (i, j) = b.elem (i, j); |
|
|
1476 |
|
|
1477 Complex *presult = result.fortran_vec (); |
|
|
1478 |
|
|
1479 int len_s = m < n ? m : n; |
|
|
1480 Array<double> s (len_s); |
|
|
1481 double *ps = s.fortran_vec (); |
|
2563
|
1482 |
|
1948
|
1483 double rcond = -1.0; |
|
2563
|
1484 |
|
1948
|
1485 int lwork; |
|
|
1486 if (m < n) |
|
|
1487 lwork = 2*m + (nrhs > n ? nrhs : n); |
|
|
1488 else |
|
|
1489 lwork = 2*n + (nrhs > m ? nrhs : m); |
|
|
1490 |
|
3075
|
1491 lwork *= 16; |
|
|
1492 |
|
1948
|
1493 Array<Complex> work (lwork); |
|
|
1494 Complex *pwork = work.fortran_vec (); |
|
|
1495 |
|
|
1496 int lrwork = (5 * (m < n ? m : n)) - 4; |
|
|
1497 lrwork = lrwork > 1 ? lrwork : 1; |
|
|
1498 Array<double> rwork (lrwork); |
|
|
1499 double *prwork = rwork.fortran_vec (); |
|
|
1500 |
|
|
1501 F77_XFCN (zgelss, ZGELSS, (m, n, nrhs, tmp_data, m, presult, |
|
|
1502 nrr, ps, rcond, rank, pwork, lwork, |
|
|
1503 prwork, info)); |
|
|
1504 |
|
|
1505 if (f77_exception_encountered) |
|
|
1506 (*current_liboctave_error_handler) ("unrecoverable error in zgelss"); |
|
|
1507 else |
|
|
1508 { |
|
2563
|
1509 retval.resize (n, nrhs); |
|
1948
|
1510 for (int j = 0; j < nrhs; j++) |
|
|
1511 for (int i = 0; i < n; i++) |
|
|
1512 retval.elem (i, j) = result.elem (i, j); |
|
|
1513 } |
|
458
|
1514 } |
|
|
1515 |
|
|
1516 return retval; |
|
|
1517 } |
|
|
1518 |
|
|
1519 ComplexColumnVector |
|
|
1520 ComplexMatrix::lssolve (const ComplexColumnVector& b) const |
|
|
1521 { |
|
|
1522 int info; |
|
|
1523 int rank; |
|
|
1524 return lssolve (b, info, rank); |
|
|
1525 } |
|
|
1526 |
|
|
1527 ComplexColumnVector |
|
|
1528 ComplexMatrix::lssolve (const ComplexColumnVector& b, int& info) const |
|
|
1529 { |
|
|
1530 int rank; |
|
|
1531 return lssolve (b, info, rank); |
|
|
1532 } |
|
|
1533 |
|
|
1534 ComplexColumnVector |
|
|
1535 ComplexMatrix::lssolve (const ComplexColumnVector& b, int& info, |
|
|
1536 int& rank) const |
|
|
1537 { |
|
1948
|
1538 ComplexColumnVector retval; |
|
|
1539 |
|
458
|
1540 int nrhs = 1; |
|
|
1541 |
|
|
1542 int m = rows (); |
|
|
1543 int n = cols (); |
|
|
1544 |
|
|
1545 if (m == 0 || n == 0 || m != b.length ()) |
|
1948
|
1546 (*current_liboctave_error_handler) |
|
|
1547 ("matrix dimension mismatch solution of least squares problem"); |
|
|
1548 else |
|
458
|
1549 { |
|
1948
|
1550 ComplexMatrix atmp = *this; |
|
|
1551 Complex *tmp_data = atmp.fortran_vec (); |
|
|
1552 |
|
|
1553 int nrr = m > n ? m : n; |
|
|
1554 ComplexColumnVector result (nrr); |
|
|
1555 |
|
|
1556 for (int i = 0; i < m; i++) |
|
|
1557 result.elem (i) = b.elem (i); |
|
|
1558 |
|
|
1559 Complex *presult = result.fortran_vec (); |
|
|
1560 |
|
|
1561 int len_s = m < n ? m : n; |
|
|
1562 Array<double> s (len_s); |
|
|
1563 double *ps = s.fortran_vec (); |
|
|
1564 |
|
|
1565 double rcond = -1.0; |
|
|
1566 |
|
|
1567 int lwork; |
|
|
1568 if (m < n) |
|
|
1569 lwork = 2*m + (nrhs > n ? nrhs : n); |
|
|
1570 else |
|
|
1571 lwork = 2*n + (nrhs > m ? nrhs : m); |
|
|
1572 |
|
3075
|
1573 lwork *= 16; |
|
|
1574 |
|
1948
|
1575 Array<Complex> work (lwork); |
|
|
1576 Complex *pwork = work.fortran_vec (); |
|
|
1577 |
|
|
1578 int lrwork = (5 * (m < n ? m : n)) - 4; |
|
|
1579 lrwork = lrwork > 1 ? lrwork : 1; |
|
|
1580 Array<double> rwork (lrwork); |
|
|
1581 double *prwork = rwork.fortran_vec (); |
|
|
1582 |
|
|
1583 F77_XFCN (zgelss, ZGELSS, (m, n, nrhs, tmp_data, m, presult, |
|
|
1584 nrr, ps, rcond, rank, pwork, lwork, |
|
|
1585 prwork, info)); |
|
|
1586 |
|
|
1587 if (f77_exception_encountered) |
|
|
1588 (*current_liboctave_error_handler) ("unrecoverable error in zgelss"); |
|
|
1589 else |
|
|
1590 { |
|
2563
|
1591 retval.resize (n); |
|
1948
|
1592 for (int i = 0; i < n; i++) |
|
|
1593 retval.elem (i) = result.elem (i); |
|
|
1594 } |
|
458
|
1595 } |
|
|
1596 |
|
|
1597 return retval; |
|
|
1598 } |
|
|
1599 |
|
1819
|
1600 // Constants for matrix exponential calculation. |
|
|
1601 |
|
|
1602 static double padec [] = |
|
|
1603 { |
|
|
1604 5.0000000000000000e-1, |
|
|
1605 1.1666666666666667e-1, |
|
|
1606 1.6666666666666667e-2, |
|
|
1607 1.6025641025641026e-3, |
|
|
1608 1.0683760683760684e-4, |
|
|
1609 4.8562548562548563e-6, |
|
|
1610 1.3875013875013875e-7, |
|
|
1611 1.9270852604185938e-9, |
|
|
1612 }; |
|
|
1613 |
|
|
1614 ComplexMatrix |
|
|
1615 ComplexMatrix::expm (void) const |
|
|
1616 { |
|
|
1617 ComplexMatrix retval; |
|
|
1618 |
|
|
1619 ComplexMatrix m = *this; |
|
|
1620 |
|
|
1621 int nc = columns (); |
|
|
1622 |
|
3130
|
1623 // Preconditioning step 1: trace normalization to reduce dynamic |
|
|
1624 // range of poles, but avoid making stable eigenvalues unstable. |
|
|
1625 |
|
1819
|
1626 // trace shift value |
|
|
1627 Complex trshift = 0.0; |
|
|
1628 |
|
|
1629 for (int i = 0; i < nc; i++) |
|
|
1630 trshift += m.elem (i, i); |
|
|
1631 |
|
|
1632 trshift /= nc; |
|
|
1633 |
|
3130
|
1634 if (trshift.real () < 0.0) |
|
|
1635 trshift = trshift.imag (); |
|
|
1636 |
|
1819
|
1637 for (int i = 0; i < nc; i++) |
|
|
1638 m.elem (i, i) -= trshift; |
|
|
1639 |
|
|
1640 // Preconditioning step 2: eigenvalue balancing. |
|
3331
|
1641 // code follows development in AEPBAL |
|
|
1642 |
|
|
1643 Complex *mp = m.fortran_vec (); |
|
3467
|
1644 |
|
|
1645 int info, ilo, ihi,ilos,ihis; |
|
3468
|
1646 Array<double> dpermute (nc); |
|
|
1647 Array<double> dscale (nc); |
|
|
1648 |
|
|
1649 // XXX FIXME XXX -- should pass job as a parameter in expm |
|
|
1650 |
|
|
1651 // Permute first |
|
|
1652 char job = 'P'; |
|
3467
|
1653 F77_XFCN (zgebal, ZGEBAL, (&job, nc, mp, nc, ilo, ihi, |
|
3469
|
1654 dpermute.fortran_vec (), info, 1L, 1L)); |
|
3331
|
1655 |
|
|
1656 if (f77_exception_encountered) |
|
|
1657 { |
|
|
1658 (*current_liboctave_error_handler) ("unrecoverable error in zgebal"); |
|
|
1659 return retval; |
|
|
1660 } |
|
|
1661 |
|
3468
|
1662 // then scale |
|
|
1663 job = 'S'; |
|
3467
|
1664 F77_XFCN (zgebal, ZGEBAL, (&job, nc, mp, nc, ilos, ihis, |
|
3469
|
1665 dscale.fortran_vec (), info, 1L, 1L)); |
|
3331
|
1666 |
|
|
1667 if (f77_exception_encountered) |
|
|
1668 { |
|
3467
|
1669 (*current_liboctave_error_handler) ("unrecoverable error in zgebal"); |
|
3331
|
1670 return retval; |
|
|
1671 } |
|
1819
|
1672 |
|
|
1673 // Preconditioning step 3: scaling. |
|
|
1674 |
|
|
1675 ColumnVector work (nc); |
|
3130
|
1676 double inf_norm; |
|
|
1677 |
|
3331
|
1678 F77_XFCN (xzlange, XZLANGE, ("I", nc, nc, m.fortran_vec (), nc, |
|
|
1679 work.fortran_vec (), inf_norm)); |
|
|
1680 |
|
|
1681 if (f77_exception_encountered) |
|
|
1682 { |
|
|
1683 (*current_liboctave_error_handler) ("unrecoverable error in zlange"); |
|
|
1684 return retval; |
|
|
1685 } |
|
1819
|
1686 |
|
2800
|
1687 int sqpow = (inf_norm > 0.0 |
|
|
1688 ? static_cast<int> (1.0 + log (inf_norm) / log (2.0)) : 0); |
|
1819
|
1689 |
|
|
1690 // Check whether we need to square at all. |
|
|
1691 |
|
|
1692 if (sqpow < 0) |
|
|
1693 sqpow = 0; |
|
|
1694 |
|
|
1695 if (sqpow > 0) |
|
|
1696 { |
|
|
1697 double scale_factor = 1.0; |
|
|
1698 for (int i = 0; i < sqpow; i++) |
|
|
1699 scale_factor *= 2.0; |
|
|
1700 |
|
|
1701 m = m / scale_factor; |
|
|
1702 } |
|
|
1703 |
|
|
1704 // npp, dpp: pade' approx polynomial matrices. |
|
|
1705 |
|
|
1706 ComplexMatrix npp (nc, nc, 0.0); |
|
|
1707 ComplexMatrix dpp = npp; |
|
|
1708 |
|
|
1709 // Now powers a^8 ... a^1. |
|
|
1710 |
|
|
1711 int minus_one_j = -1; |
|
|
1712 for (int j = 7; j >= 0; j--) |
|
|
1713 { |
|
|
1714 npp = m * npp + m * padec[j]; |
|
|
1715 dpp = m * dpp + m * (minus_one_j * padec[j]); |
|
|
1716 minus_one_j *= -1; |
|
|
1717 } |
|
|
1718 |
|
|
1719 // Zero power. |
|
|
1720 |
|
|
1721 dpp = -dpp; |
|
|
1722 for (int j = 0; j < nc; j++) |
|
|
1723 { |
|
|
1724 npp.elem (j, j) += 1.0; |
|
|
1725 dpp.elem (j, j) += 1.0; |
|
|
1726 } |
|
|
1727 |
|
|
1728 // Compute pade approximation = inverse (dpp) * npp. |
|
|
1729 |
|
|
1730 retval = dpp.solve (npp); |
|
|
1731 |
|
|
1732 // Reverse preconditioning step 3: repeated squaring. |
|
|
1733 |
|
|
1734 while (sqpow) |
|
|
1735 { |
|
|
1736 retval = retval * retval; |
|
|
1737 sqpow--; |
|
|
1738 } |
|
|
1739 |
|
|
1740 // Reverse preconditioning step 2: inverse balancing. |
|
3467
|
1741 // Done in two steps: inverse scaling, then inverse permutation |
|
|
1742 |
|
|
1743 // inverse scaling (diagonal transformation) |
|
3468
|
1744 for (int i = 0; i < nc; i++) |
|
|
1745 for (int j = 0; j < nc; j++) |
|
|
1746 retval(i,j) *= dscale(i) / dscale(j); |
|
3467
|
1747 |
|
|
1748 // construct balancing permutation vector |
|
3468
|
1749 Array<int> ipermute (nc); |
|
|
1750 for (int i = 0; i < nc; i++) |
|
|
1751 ipermute(i) = i; // initialize to identity permutation |
|
3467
|
1752 |
|
|
1753 // leading permutations in forward order |
|
3468
|
1754 for (int i = 0; i < (ilo-1); i++) |
|
|
1755 { |
|
|
1756 int swapidx = static_cast<int> (dpermute(i)) - 1; |
|
|
1757 int tmp = ipermute(i); |
|
|
1758 ipermute(i) = ipermute(swapidx); |
|
|
1759 ipermute(swapidx) = tmp; |
|
|
1760 } |
|
3467
|
1761 |
|
|
1762 // trailing permutations must be done in reverse order |
|
3468
|
1763 for (int i = nc - 1; i >= ihi; i--) |
|
|
1764 { |
|
|
1765 int swapidx = static_cast<int> (dpermute(i)) - 1; |
|
|
1766 int tmp = ipermute(i); |
|
|
1767 ipermute(i) = ipermute(swapidx); |
|
|
1768 ipermute(swapidx) = tmp; |
|
|
1769 } |
|
3467
|
1770 |
|
|
1771 // construct inverse balancing permutation vector |
|
3468
|
1772 Array<int> invpvec (nc); |
|
|
1773 for (int i = 0; i < nc; i++) |
|
|
1774 invpvec(ipermute(i)) = i; // Thanks to R. A. Lippert for this method |
|
3467
|
1775 |
|
|
1776 ComplexMatrix tmpMat = retval; |
|
3468
|
1777 for (int i = 0; i < nc; i++) |
|
|
1778 for (int j = 0; j < nc; j++) |
|
|
1779 retval(i,j) = tmpMat(invpvec(i),invpvec(j)); |
|
1819
|
1780 |
|
|
1781 // Reverse preconditioning step 1: fix trace normalization. |
|
|
1782 |
|
3130
|
1783 return exp (trshift) * retval; |
|
1819
|
1784 } |
|
|
1785 |
|
1205
|
1786 // column vector by row vector -> matrix operations |
|
|
1787 |
|
|
1788 ComplexMatrix |
|
|
1789 operator * (const ColumnVector& v, const ComplexRowVector& a) |
|
|
1790 { |
|
|
1791 ComplexColumnVector tmp (v); |
|
|
1792 return tmp * a; |
|
|
1793 } |
|
|
1794 |
|
|
1795 ComplexMatrix |
|
|
1796 operator * (const ComplexColumnVector& a, const RowVector& b) |
|
|
1797 { |
|
|
1798 ComplexRowVector tmp (b); |
|
|
1799 return a * tmp; |
|
|
1800 } |
|
|
1801 |
|
|
1802 ComplexMatrix |
|
|
1803 operator * (const ComplexColumnVector& v, const ComplexRowVector& a) |
|
|
1804 { |
|
1948
|
1805 ComplexMatrix retval; |
|
|
1806 |
|
1205
|
1807 int len = v.length (); |
|
3233
|
1808 |
|
|
1809 if (len != 0) |
|
1205
|
1810 { |
|
3233
|
1811 int a_len = a.length (); |
|
|
1812 |
|
|
1813 retval.resize (len, a_len); |
|
|
1814 Complex *c = retval.fortran_vec (); |
|
|
1815 |
|
|
1816 F77_XFCN (zgemm, ZGEMM, ("N", "N", len, a_len, 1, 1.0, |
|
|
1817 v.data (), len, a.data (), 1, 0.0, |
|
|
1818 c, len, 1L, 1L)); |
|
|
1819 |
|
|
1820 if (f77_exception_encountered) |
|
|
1821 (*current_liboctave_error_handler) |
|
|
1822 ("unrecoverable error in zgemm"); |
|
1205
|
1823 } |
|
|
1824 |
|
1948
|
1825 return retval; |
|
1205
|
1826 } |
|
|
1827 |
|
458
|
1828 // matrix by diagonal matrix -> matrix operations |
|
|
1829 |
|
|
1830 ComplexMatrix& |
|
|
1831 ComplexMatrix::operator += (const DiagMatrix& a) |
|
|
1832 { |
|
|
1833 int nr = rows (); |
|
|
1834 int nc = cols (); |
|
2384
|
1835 |
|
|
1836 int a_nr = rows (); |
|
|
1837 int a_nc = cols (); |
|
|
1838 |
|
|
1839 if (nr != a_nr || nc != a_nc) |
|
458
|
1840 { |
|
2384
|
1841 gripe_nonconformant ("operator +=", nr, nc, a_nr, a_nc); |
|
889
|
1842 return *this; |
|
458
|
1843 } |
|
|
1844 |
|
|
1845 for (int i = 0; i < a.length (); i++) |
|
|
1846 elem (i, i) += a.elem (i, i); |
|
|
1847 |
|
|
1848 return *this; |
|
|
1849 } |
|
|
1850 |
|
|
1851 ComplexMatrix& |
|
|
1852 ComplexMatrix::operator -= (const DiagMatrix& a) |
|
|
1853 { |
|
|
1854 int nr = rows (); |
|
|
1855 int nc = cols (); |
|
2384
|
1856 |
|
|
1857 int a_nr = rows (); |
|
|
1858 int a_nc = cols (); |
|
|
1859 |
|
|
1860 if (nr != a_nr || nc != a_nc) |
|
458
|
1861 { |
|
2384
|
1862 gripe_nonconformant ("operator -=", nr, nc, a_nr, a_nc); |
|
889
|
1863 return *this; |
|
458
|
1864 } |
|
|
1865 |
|
|
1866 for (int i = 0; i < a.length (); i++) |
|
|
1867 elem (i, i) -= a.elem (i, i); |
|
|
1868 |
|
|
1869 return *this; |
|
|
1870 } |
|
|
1871 |
|
|
1872 ComplexMatrix& |
|
|
1873 ComplexMatrix::operator += (const ComplexDiagMatrix& a) |
|
|
1874 { |
|
|
1875 int nr = rows (); |
|
|
1876 int nc = cols (); |
|
2384
|
1877 |
|
|
1878 int a_nr = rows (); |
|
|
1879 int a_nc = cols (); |
|
|
1880 |
|
|
1881 if (nr != a_nr || nc != a_nc) |
|
458
|
1882 { |
|
2384
|
1883 gripe_nonconformant ("operator +=", nr, nc, a_nr, a_nc); |
|
889
|
1884 return *this; |
|
458
|
1885 } |
|
|
1886 |
|
|
1887 for (int i = 0; i < a.length (); i++) |
|
|
1888 elem (i, i) += a.elem (i, i); |
|
|
1889 |
|
|
1890 return *this; |
|
|
1891 } |
|
|
1892 |
|
|
1893 ComplexMatrix& |
|
|
1894 ComplexMatrix::operator -= (const ComplexDiagMatrix& a) |
|
|
1895 { |
|
|
1896 int nr = rows (); |
|
|
1897 int nc = cols (); |
|
2384
|
1898 |
|
|
1899 int a_nr = rows (); |
|
|
1900 int a_nc = cols (); |
|
|
1901 |
|
|
1902 if (nr != a_nr || nc != a_nc) |
|
458
|
1903 { |
|
2384
|
1904 gripe_nonconformant ("operator -=", nr, nc, a_nr, a_nc); |
|
889
|
1905 return *this; |
|
458
|
1906 } |
|
|
1907 |
|
|
1908 for (int i = 0; i < a.length (); i++) |
|
|
1909 elem (i, i) -= a.elem (i, i); |
|
|
1910 |
|
|
1911 return *this; |
|
|
1912 } |
|
|
1913 |
|
|
1914 // matrix by matrix -> matrix operations |
|
|
1915 |
|
|
1916 ComplexMatrix& |
|
|
1917 ComplexMatrix::operator += (const Matrix& a) |
|
|
1918 { |
|
|
1919 int nr = rows (); |
|
|
1920 int nc = cols (); |
|
2384
|
1921 |
|
|
1922 int a_nr = a.rows (); |
|
|
1923 int a_nc = a.cols (); |
|
|
1924 |
|
|
1925 if (nr != a_nr || nc != a_nc) |
|
458
|
1926 { |
|
2384
|
1927 gripe_nonconformant ("operator +=", nr, nc, a_nr, a_nc); |
|
458
|
1928 return *this; |
|
|
1929 } |
|
|
1930 |
|
|
1931 if (nr == 0 || nc == 0) |
|
|
1932 return *this; |
|
|
1933 |
|
|
1934 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
1935 |
|
|
1936 add2 (d, a.data (), length ()); |
|
|
1937 return *this; |
|
|
1938 } |
|
|
1939 |
|
|
1940 ComplexMatrix& |
|
|
1941 ComplexMatrix::operator -= (const Matrix& a) |
|
|
1942 { |
|
|
1943 int nr = rows (); |
|
|
1944 int nc = cols (); |
|
2384
|
1945 |
|
|
1946 int a_nr = a.rows (); |
|
|
1947 int a_nc = a.cols (); |
|
|
1948 |
|
|
1949 if (nr != a_nr || nc != a_nc) |
|
458
|
1950 { |
|
2384
|
1951 gripe_nonconformant ("operator -=", nr, nc, a_nr, a_nc); |
|
458
|
1952 return *this; |
|
|
1953 } |
|
|
1954 |
|
|
1955 if (nr == 0 || nc == 0) |
|
|
1956 return *this; |
|
|
1957 |
|
|
1958 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
1959 |
|
|
1960 subtract2 (d, a.data (), length ()); |
|
|
1961 return *this; |
|
|
1962 } |
|
|
1963 |
|
|
1964 ComplexMatrix& |
|
|
1965 ComplexMatrix::operator += (const ComplexMatrix& a) |
|
|
1966 { |
|
|
1967 int nr = rows (); |
|
|
1968 int nc = cols (); |
|
2384
|
1969 |
|
|
1970 int a_nr = a.rows (); |
|
|
1971 int a_nc = a.cols (); |
|
|
1972 |
|
|
1973 if (nr != a_nr || nc != a_nc) |
|
458
|
1974 { |
|
2384
|
1975 gripe_nonconformant ("operator +=", nr, nc, a_nr, a_nc); |
|
458
|
1976 return *this; |
|
|
1977 } |
|
|
1978 |
|
|
1979 if (nr == 0 || nc == 0) |
|
|
1980 return *this; |
|
|
1981 |
|
|
1982 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
1983 |
|
|
1984 add2 (d, a.data (), length ()); |
|
|
1985 return *this; |
|
|
1986 } |
|
|
1987 |
|
|
1988 ComplexMatrix& |
|
|
1989 ComplexMatrix::operator -= (const ComplexMatrix& a) |
|
|
1990 { |
|
|
1991 int nr = rows (); |
|
|
1992 int nc = cols (); |
|
2384
|
1993 |
|
|
1994 int a_nr = a.rows (); |
|
|
1995 int a_nc = a.cols (); |
|
|
1996 |
|
|
1997 if (nr != a_nr || nc != a_nc) |
|
458
|
1998 { |
|
2384
|
1999 gripe_nonconformant ("operator -=", nr, nc, a_nr, a_nc); |
|
458
|
2000 return *this; |
|
|
2001 } |
|
|
2002 |
|
|
2003 if (nr == 0 || nc == 0) |
|
|
2004 return *this; |
|
|
2005 |
|
|
2006 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
2007 |
|
|
2008 subtract2 (d, a.data (), length ()); |
|
|
2009 return *this; |
|
|
2010 } |
|
|
2011 |
|
|
2012 // unary operations |
|
|
2013 |
|
2964
|
2014 boolMatrix |
|
458
|
2015 ComplexMatrix::operator ! (void) const |
|
|
2016 { |
|
2964
|
2017 int nr = rows (); |
|
|
2018 int nc = cols (); |
|
|
2019 |
|
|
2020 boolMatrix b (nr, nc); |
|
|
2021 |
|
|
2022 for (int j = 0; j < nc; j++) |
|
|
2023 for (int i = 0; i < nr; i++) |
|
|
2024 b.elem (i, j) = elem (i, j) != 0.0; |
|
|
2025 |
|
|
2026 return b; |
|
458
|
2027 } |
|
|
2028 |
|
|
2029 // other operations |
|
|
2030 |
|
|
2031 ComplexMatrix |
|
2676
|
2032 ComplexMatrix::map (c_c_Mapper f) const |
|
458
|
2033 { |
|
2676
|
2034 ComplexMatrix b (*this); |
|
|
2035 return b.apply (f); |
|
458
|
2036 } |
|
|
2037 |
|
2676
|
2038 Matrix |
|
|
2039 ComplexMatrix::map (d_c_Mapper f) const |
|
458
|
2040 { |
|
3248
|
2041 int nr = rows (); |
|
|
2042 int nc = cols (); |
|
|
2043 |
|
|
2044 Matrix retval (nr, nc); |
|
|
2045 |
|
|
2046 for (int j = 0; j < nc; j++) |
|
|
2047 for (int i = 0; i < nr; i++) |
|
|
2048 retval(i,j) = f (elem(i,j)); |
|
|
2049 |
|
|
2050 return retval; |
|
|
2051 } |
|
|
2052 |
|
|
2053 boolMatrix |
|
|
2054 ComplexMatrix::map (b_c_Mapper f) const |
|
|
2055 { |
|
|
2056 int nr = rows (); |
|
|
2057 int nc = cols (); |
|
|
2058 |
|
|
2059 boolMatrix retval (nr, nc); |
|
|
2060 |
|
|
2061 for (int j = 0; j < nc; j++) |
|
|
2062 for (int i = 0; i < nr; i++) |
|
|
2063 retval(i,j) = f (elem(i,j)); |
|
2676
|
2064 |
|
|
2065 return retval; |
|
|
2066 } |
|
|
2067 |
|
|
2068 ComplexMatrix& |
|
|
2069 ComplexMatrix::apply (c_c_Mapper f) |
|
|
2070 { |
|
|
2071 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
2072 |
|
|
2073 for (int i = 0; i < length (); i++) |
|
|
2074 d[i] = f (d[i]); |
|
|
2075 |
|
|
2076 return *this; |
|
458
|
2077 } |
|
|
2078 |
|
2384
|
2079 bool |
|
|
2080 ComplexMatrix::any_element_is_inf_or_nan (void) const |
|
|
2081 { |
|
|
2082 int nr = rows (); |
|
|
2083 int nc = cols (); |
|
|
2084 |
|
|
2085 for (int j = 0; j < nc; j++) |
|
|
2086 for (int i = 0; i < nr; i++) |
|
|
2087 { |
|
|
2088 Complex val = elem (i, j); |
|
|
2089 if (xisinf (val) || xisnan (val)) |
|
|
2090 return true; |
|
|
2091 } |
|
|
2092 |
|
|
2093 return false; |
|
|
2094 } |
|
|
2095 |
|
2408
|
2096 // Return true if no elements have imaginary components. |
|
|
2097 |
|
|
2098 bool |
|
|
2099 ComplexMatrix::all_elements_are_real (void) const |
|
|
2100 { |
|
|
2101 int nr = rows (); |
|
|
2102 int nc = cols (); |
|
|
2103 |
|
|
2104 for (int j = 0; j < nc; j++) |
|
|
2105 for (int i = 0; i < nr; i++) |
|
|
2106 if (imag (elem (i, j)) != 0.0) |
|
|
2107 return false; |
|
|
2108 |
|
|
2109 return true; |
|
|
2110 } |
|
|
2111 |
|
1968
|
2112 // Return nonzero if any element of CM has a non-integer real or |
|
|
2113 // imaginary part. Also extract the largest and smallest (real or |
|
|
2114 // imaginary) values and return them in MAX_VAL and MIN_VAL. |
|
|
2115 |
|
2384
|
2116 bool |
|
1968
|
2117 ComplexMatrix::all_integers (double& max_val, double& min_val) const |
|
|
2118 { |
|
|
2119 int nr = rows (); |
|
2384
|
2120 int nc = cols (); |
|
1968
|
2121 |
|
|
2122 if (nr > 0 && nc > 0) |
|
|
2123 { |
|
|
2124 Complex val = elem (0, 0); |
|
|
2125 |
|
|
2126 double r_val = real (val); |
|
|
2127 double i_val = imag (val); |
|
|
2128 |
|
|
2129 max_val = r_val; |
|
|
2130 min_val = r_val; |
|
|
2131 |
|
|
2132 if (i_val > max_val) |
|
|
2133 max_val = i_val; |
|
|
2134 |
|
|
2135 if (i_val < max_val) |
|
|
2136 min_val = i_val; |
|
|
2137 } |
|
|
2138 else |
|
2384
|
2139 return false; |
|
1968
|
2140 |
|
|
2141 for (int j = 0; j < nc; j++) |
|
|
2142 for (int i = 0; i < nr; i++) |
|
|
2143 { |
|
|
2144 Complex val = elem (i, j); |
|
|
2145 |
|
|
2146 double r_val = real (val); |
|
|
2147 double i_val = imag (val); |
|
|
2148 |
|
|
2149 if (r_val > max_val) |
|
|
2150 max_val = r_val; |
|
|
2151 |
|
|
2152 if (i_val > max_val) |
|
|
2153 max_val = i_val; |
|
|
2154 |
|
|
2155 if (r_val < min_val) |
|
|
2156 min_val = r_val; |
|
|
2157 |
|
|
2158 if (i_val < min_val) |
|
|
2159 min_val = i_val; |
|
|
2160 |
|
|
2161 if (D_NINT (r_val) != r_val || D_NINT (i_val) != i_val) |
|
2384
|
2162 return false; |
|
1968
|
2163 } |
|
2384
|
2164 |
|
|
2165 return true; |
|
1968
|
2166 } |
|
|
2167 |
|
2384
|
2168 bool |
|
1968
|
2169 ComplexMatrix::too_large_for_float (void) const |
|
|
2170 { |
|
|
2171 int nr = rows (); |
|
2384
|
2172 int nc = cols (); |
|
1968
|
2173 |
|
|
2174 for (int j = 0; j < nc; j++) |
|
|
2175 for (int i = 0; i < nr; i++) |
|
|
2176 { |
|
|
2177 Complex val = elem (i, j); |
|
|
2178 |
|
|
2179 double r_val = real (val); |
|
|
2180 double i_val = imag (val); |
|
|
2181 |
|
|
2182 if (r_val > FLT_MAX |
|
|
2183 || i_val > FLT_MAX |
|
|
2184 || r_val < FLT_MIN |
|
|
2185 || i_val < FLT_MIN) |
|
2384
|
2186 return true; |
|
1968
|
2187 } |
|
|
2188 |
|
2384
|
2189 return false; |
|
1968
|
2190 } |
|
|
2191 |
|
2832
|
2192 boolMatrix |
|
458
|
2193 ComplexMatrix::all (void) const |
|
|
2194 { |
|
|
2195 int nr = rows (); |
|
|
2196 int nc = cols (); |
|
2832
|
2197 boolMatrix retval; |
|
458
|
2198 if (nr > 0 && nc > 0) |
|
|
2199 { |
|
|
2200 if (nr == 1) |
|
|
2201 { |
|
|
2202 retval.resize (1, 1); |
|
2832
|
2203 retval.elem (0, 0) = true; |
|
458
|
2204 for (int j = 0; j < nc; j++) |
|
|
2205 { |
|
|
2206 if (elem (0, j) == 0.0) |
|
|
2207 { |
|
2832
|
2208 retval.elem (0, 0) = false; |
|
458
|
2209 break; |
|
|
2210 } |
|
|
2211 } |
|
|
2212 } |
|
|
2213 else if (nc == 1) |
|
|
2214 { |
|
|
2215 retval.resize (1, 1); |
|
2832
|
2216 retval.elem (0, 0) = true; |
|
458
|
2217 for (int i = 0; i < nr; i++) |
|
|
2218 { |
|
|
2219 if (elem (i, 0) == 0.0) |
|
|
2220 { |
|
2832
|
2221 retval.elem (0, 0) = false; |
|
458
|
2222 break; |
|
|
2223 } |
|
|
2224 } |
|
|
2225 } |
|
|
2226 else |
|
|
2227 { |
|
|
2228 retval.resize (1, nc); |
|
|
2229 for (int j = 0; j < nc; j++) |
|
|
2230 { |
|
2832
|
2231 retval.elem (0, j) = true; |
|
458
|
2232 for (int i = 0; i < nr; i++) |
|
|
2233 { |
|
|
2234 if (elem (i, j) == 0.0) |
|
|
2235 { |
|
2832
|
2236 retval.elem (0, j) = false; |
|
458
|
2237 break; |
|
|
2238 } |
|
|
2239 } |
|
|
2240 } |
|
|
2241 } |
|
|
2242 } |
|
|
2243 return retval; |
|
|
2244 } |
|
|
2245 |
|
2832
|
2246 boolMatrix |
|
458
|
2247 ComplexMatrix::any (void) const |
|
|
2248 { |
|
|
2249 int nr = rows (); |
|
|
2250 int nc = cols (); |
|
2832
|
2251 boolMatrix retval; |
|
458
|
2252 if (nr > 0 && nc > 0) |
|
|
2253 { |
|
|
2254 if (nr == 1) |
|
|
2255 { |
|
|
2256 retval.resize (1, 1); |
|
2832
|
2257 retval.elem (0, 0) = false; |
|
458
|
2258 for (int j = 0; j < nc; j++) |
|
|
2259 { |
|
|
2260 if (elem (0, j) != 0.0) |
|
|
2261 { |
|
2832
|
2262 retval.elem (0, 0) = true; |
|
458
|
2263 break; |
|
|
2264 } |
|
|
2265 } |
|
|
2266 } |
|
|
2267 else if (nc == 1) |
|
|
2268 { |
|
|
2269 retval.resize (1, 1); |
|
2832
|
2270 retval.elem (0, 0) = false; |
|
458
|
2271 for (int i = 0; i < nr; i++) |
|
|
2272 { |
|
|
2273 if (elem (i, 0) != 0.0) |
|
|
2274 { |
|
2832
|
2275 retval.elem (0, 0) = true; |
|
458
|
2276 break; |
|
|
2277 } |
|
|
2278 } |
|
|
2279 } |
|
|
2280 else |
|
|
2281 { |
|
|
2282 retval.resize (1, nc); |
|
|
2283 for (int j = 0; j < nc; j++) |
|
|
2284 { |
|
2832
|
2285 retval.elem (0, j) = false; |
|
458
|
2286 for (int i = 0; i < nr; i++) |
|
|
2287 { |
|
|
2288 if (elem (i, j) != 0.0) |
|
|
2289 { |
|
2832
|
2290 retval.elem (0, j) = true; |
|
458
|
2291 break; |
|
|
2292 } |
|
|
2293 } |
|
|
2294 } |
|
|
2295 } |
|
|
2296 } |
|
|
2297 return retval; |
|
|
2298 } |
|
|
2299 |
|
|
2300 ComplexMatrix |
|
|
2301 ComplexMatrix::cumprod (void) const |
|
|
2302 { |
|
|
2303 int nr = rows (); |
|
|
2304 int nc = cols (); |
|
|
2305 ComplexMatrix retval; |
|
|
2306 if (nr > 0 && nc > 0) |
|
|
2307 { |
|
|
2308 if (nr == 1) |
|
|
2309 { |
|
|
2310 retval.resize (1, nc); |
|
|
2311 Complex prod = elem (0, 0); |
|
|
2312 for (int j = 0; j < nc; j++) |
|
|
2313 { |
|
|
2314 retval.elem (0, j) = prod; |
|
|
2315 if (j < nc - 1) |
|
|
2316 prod *= elem (0, j+1); |
|
|
2317 } |
|
|
2318 } |
|
|
2319 else if (nc == 1) |
|
|
2320 { |
|
|
2321 retval.resize (nr, 1); |
|
|
2322 Complex prod = elem (0, 0); |
|
|
2323 for (int i = 0; i < nr; i++) |
|
|
2324 { |
|
|
2325 retval.elem (i, 0) = prod; |
|
|
2326 if (i < nr - 1) |
|
|
2327 prod *= elem (i+1, 0); |
|
|
2328 } |
|
|
2329 } |
|
|
2330 else |
|
|
2331 { |
|
|
2332 retval.resize (nr, nc); |
|
|
2333 for (int j = 0; j < nc; j++) |
|
|
2334 { |
|
|
2335 Complex prod = elem (0, j); |
|
|
2336 for (int i = 0; i < nr; i++) |
|
|
2337 { |
|
|
2338 retval.elem (i, j) = prod; |
|
|
2339 if (i < nr - 1) |
|
|
2340 prod *= elem (i+1, j); |
|
|
2341 } |
|
|
2342 } |
|
|
2343 } |
|
|
2344 } |
|
|
2345 return retval; |
|
|
2346 } |
|
|
2347 |
|
|
2348 ComplexMatrix |
|
|
2349 ComplexMatrix::cumsum (void) const |
|
|
2350 { |
|
|
2351 int nr = rows (); |
|
|
2352 int nc = cols (); |
|
|
2353 ComplexMatrix retval; |
|
|
2354 if (nr > 0 && nc > 0) |
|
|
2355 { |
|
|
2356 if (nr == 1) |
|
|
2357 { |
|
|
2358 retval.resize (1, nc); |
|
|
2359 Complex sum = elem (0, 0); |
|
|
2360 for (int j = 0; j < nc; j++) |
|
|
2361 { |
|
|
2362 retval.elem (0, j) = sum; |
|
|
2363 if (j < nc - 1) |
|
|
2364 sum += elem (0, j+1); |
|
|
2365 } |
|
|
2366 } |
|
|
2367 else if (nc == 1) |
|
|
2368 { |
|
|
2369 retval.resize (nr, 1); |
|
|
2370 Complex sum = elem (0, 0); |
|
|
2371 for (int i = 0; i < nr; i++) |
|
|
2372 { |
|
|
2373 retval.elem (i, 0) = sum; |
|
|
2374 if (i < nr - 1) |
|
|
2375 sum += elem (i+1, 0); |
|
|
2376 } |
|
|
2377 } |
|
|
2378 else |
|
|
2379 { |
|
|
2380 retval.resize (nr, nc); |
|
|
2381 for (int j = 0; j < nc; j++) |
|
|
2382 { |
|
|
2383 Complex sum = elem (0, j); |
|
|
2384 for (int i = 0; i < nr; i++) |
|
|
2385 { |
|
|
2386 retval.elem (i, j) = sum; |
|
|
2387 if (i < nr - 1) |
|
|
2388 sum += elem (i+1, j); |
|
|
2389 } |
|
|
2390 } |
|
|
2391 } |
|
|
2392 } |
|
|
2393 return retval; |
|
|
2394 } |
|
|
2395 |
|
|
2396 ComplexMatrix |
|
|
2397 ComplexMatrix::prod (void) const |
|
|
2398 { |
|
|
2399 int nr = rows (); |
|
|
2400 int nc = cols (); |
|
|
2401 ComplexMatrix retval; |
|
|
2402 if (nr > 0 && nc > 0) |
|
|
2403 { |
|
|
2404 if (nr == 1) |
|
|
2405 { |
|
|
2406 retval.resize (1, 1); |
|
|
2407 retval.elem (0, 0) = 1.0; |
|
|
2408 for (int j = 0; j < nc; j++) |
|
|
2409 retval.elem (0, 0) *= elem (0, j); |
|
|
2410 } |
|
|
2411 else if (nc == 1) |
|
|
2412 { |
|
|
2413 retval.resize (1, 1); |
|
|
2414 retval.elem (0, 0) = 1.0; |
|
|
2415 for (int i = 0; i < nr; i++) |
|
|
2416 retval.elem (0, 0) *= elem (i, 0); |
|
|
2417 } |
|
|
2418 else |
|
|
2419 { |
|
|
2420 retval.resize (1, nc); |
|
|
2421 for (int j = 0; j < nc; j++) |
|
|
2422 { |
|
|
2423 retval.elem (0, j) = 1.0; |
|
|
2424 for (int i = 0; i < nr; i++) |
|
|
2425 retval.elem (0, j) *= elem (i, j); |
|
|
2426 } |
|
|
2427 } |
|
|
2428 } |
|
|
2429 return retval; |
|
|
2430 } |
|
|
2431 |
|
|
2432 ComplexMatrix |
|
|
2433 ComplexMatrix::sum (void) const |
|
|
2434 { |
|
|
2435 int nr = rows (); |
|
|
2436 int nc = cols (); |
|
|
2437 ComplexMatrix retval; |
|
|
2438 if (nr > 0 && nc > 0) |
|
|
2439 { |
|
|
2440 if (nr == 1) |
|
|
2441 { |
|
|
2442 retval.resize (1, 1); |
|
|
2443 retval.elem (0, 0) = 0.0; |
|
|
2444 for (int j = 0; j < nc; j++) |
|
|
2445 retval.elem (0, 0) += elem (0, j); |
|
|
2446 } |
|
|
2447 else if (nc == 1) |
|
|
2448 { |
|
|
2449 retval.resize (1, 1); |
|
|
2450 retval.elem (0, 0) = 0.0; |
|
|
2451 for (int i = 0; i < nr; i++) |
|
|
2452 retval.elem (0, 0) += elem (i, 0); |
|
|
2453 } |
|
|
2454 else |
|
|
2455 { |
|
|
2456 retval.resize (1, nc); |
|
|
2457 for (int j = 0; j < nc; j++) |
|
|
2458 { |
|
|
2459 retval.elem (0, j) = 0.0; |
|
|
2460 for (int i = 0; i < nr; i++) |
|
|
2461 retval.elem (0, j) += elem (i, j); |
|
|
2462 } |
|
|
2463 } |
|
|
2464 } |
|
|
2465 return retval; |
|
|
2466 } |
|
|
2467 |
|
|
2468 ComplexMatrix |
|
|
2469 ComplexMatrix::sumsq (void) const |
|
|
2470 { |
|
|
2471 int nr = rows (); |
|
|
2472 int nc = cols (); |
|
|
2473 ComplexMatrix retval; |
|
|
2474 if (nr > 0 && nc > 0) |
|
|
2475 { |
|
|
2476 if (nr == 1) |
|
|
2477 { |
|
|
2478 retval.resize (1, 1); |
|
|
2479 retval.elem (0, 0) = 0.0; |
|
|
2480 for (int j = 0; j < nc; j++) |
|
|
2481 { |
|
|
2482 Complex d = elem (0, j); |
|
3095
|
2483 retval.elem (0, 0) += d * conj (d); |
|
458
|
2484 } |
|
|
2485 } |
|
|
2486 else if (nc == 1) |
|
|
2487 { |
|
|
2488 retval.resize (1, 1); |
|
|
2489 retval.elem (0, 0) = 0.0; |
|
|
2490 for (int i = 0; i < nr; i++) |
|
|
2491 { |
|
|
2492 Complex d = elem (i, 0); |
|
3095
|
2493 retval.elem (0, 0) += d * conj (d); |
|
458
|
2494 } |
|
|
2495 } |
|
|
2496 else |
|
|
2497 { |
|
|
2498 retval.resize (1, nc); |
|
|
2499 for (int j = 0; j < nc; j++) |
|
|
2500 { |
|
|
2501 retval.elem (0, j) = 0.0; |
|
|
2502 for (int i = 0; i < nr; i++) |
|
|
2503 { |
|
|
2504 Complex d = elem (i, j); |
|
3095
|
2505 retval.elem (0, j) += d * conj (d); |
|
458
|
2506 } |
|
|
2507 } |
|
|
2508 } |
|
|
2509 } |
|
|
2510 return retval; |
|
|
2511 } |
|
|
2512 |
|
|
2513 ComplexColumnVector |
|
|
2514 ComplexMatrix::diag (void) const |
|
|
2515 { |
|
|
2516 return diag (0); |
|
|
2517 } |
|
|
2518 |
|
|
2519 ComplexColumnVector |
|
|
2520 ComplexMatrix::diag (int k) const |
|
|
2521 { |
|
|
2522 int nnr = rows (); |
|
|
2523 int nnc = cols (); |
|
|
2524 if (k > 0) |
|
|
2525 nnc -= k; |
|
|
2526 else if (k < 0) |
|
|
2527 nnr += k; |
|
|
2528 |
|
|
2529 ComplexColumnVector d; |
|
|
2530 |
|
|
2531 if (nnr > 0 && nnc > 0) |
|
|
2532 { |
|
|
2533 int ndiag = (nnr < nnc) ? nnr : nnc; |
|
|
2534 |
|
|
2535 d.resize (ndiag); |
|
|
2536 |
|
|
2537 if (k > 0) |
|
|
2538 { |
|
|
2539 for (int i = 0; i < ndiag; i++) |
|
|
2540 d.elem (i) = elem (i, i+k); |
|
|
2541 } |
|
|
2542 else if ( k < 0) |
|
|
2543 { |
|
|
2544 for (int i = 0; i < ndiag; i++) |
|
|
2545 d.elem (i) = elem (i-k, i); |
|
|
2546 } |
|
|
2547 else |
|
|
2548 { |
|
|
2549 for (int i = 0; i < ndiag; i++) |
|
|
2550 d.elem (i) = elem (i, i); |
|
|
2551 } |
|
|
2552 } |
|
|
2553 else |
|
3504
|
2554 std::cerr << "diag: requested diagonal out of range\n"; |
|
458
|
2555 |
|
|
2556 return d; |
|
|
2557 } |
|
|
2558 |
|
2354
|
2559 bool |
|
|
2560 ComplexMatrix::row_is_real_only (int i) const |
|
|
2561 { |
|
|
2562 bool retval = true; |
|
|
2563 |
|
|
2564 int nc = columns (); |
|
|
2565 |
|
|
2566 for (int j = 0; j < nc; j++) |
|
|
2567 { |
|
|
2568 if (imag (elem (i, j)) != 0.0) |
|
|
2569 { |
|
|
2570 retval = false; |
|
|
2571 break; |
|
|
2572 } |
|
|
2573 } |
|
|
2574 |
|
|
2575 return retval; |
|
|
2576 } |
|
|
2577 |
|
|
2578 bool |
|
|
2579 ComplexMatrix::column_is_real_only (int j) const |
|
|
2580 { |
|
|
2581 bool retval = true; |
|
|
2582 |
|
|
2583 int nr = rows (); |
|
|
2584 |
|
|
2585 for (int i = 0; i < nr; i++) |
|
|
2586 { |
|
|
2587 if (imag (elem (i, j)) != 0.0) |
|
|
2588 { |
|
|
2589 retval = false; |
|
|
2590 break; |
|
|
2591 } |
|
|
2592 } |
|
|
2593 |
|
|
2594 return retval; |
|
|
2595 } |
|
891
|
2596 |
|
458
|
2597 ComplexColumnVector |
|
|
2598 ComplexMatrix::row_min (void) const |
|
|
2599 { |
|
2354
|
2600 Array<int> index; |
|
|
2601 return row_min (index); |
|
458
|
2602 } |
|
|
2603 |
|
|
2604 ComplexColumnVector |
|
2354
|
2605 ComplexMatrix::row_min (Array<int>& index) const |
|
458
|
2606 { |
|
|
2607 ComplexColumnVector result; |
|
|
2608 |
|
|
2609 int nr = rows (); |
|
|
2610 int nc = cols (); |
|
|
2611 |
|
|
2612 if (nr > 0 && nc > 0) |
|
|
2613 { |
|
|
2614 result.resize (nr); |
|
2354
|
2615 index.resize (nr); |
|
458
|
2616 |
|
|
2617 for (int i = 0; i < nr; i++) |
|
|
2618 { |
|
3504
|
2619 int idx_j = 0; |
|
|
2620 |
|
|
2621 Complex tmp_min = elem (i, idx_j); |
|
2354
|
2622 |
|
|
2623 bool real_only = row_is_real_only (i); |
|
|
2624 |
|
|
2625 double abs_min = real_only ? real (tmp_min) : abs (tmp_min); |
|
|
2626 |
|
|
2627 if (xisnan (tmp_min)) |
|
3504
|
2628 idx_j = -1; |
|
891
|
2629 else |
|
|
2630 { |
|
|
2631 for (int j = 1; j < nc; j++) |
|
2354
|
2632 { |
|
|
2633 Complex tmp = elem (i, j); |
|
|
2634 |
|
|
2635 double abs_tmp = real_only ? real (tmp) : abs (tmp); |
|
|
2636 |
|
|
2637 if (xisnan (tmp)) |
|
|
2638 { |
|
3504
|
2639 idx_j = -1; |
|
2354
|
2640 break; |
|
|
2641 } |
|
|
2642 else if (abs_tmp < abs_min) |
|
|
2643 { |
|
3504
|
2644 idx_j = j; |
|
2354
|
2645 tmp_min = tmp; |
|
|
2646 abs_min = abs_tmp; |
|
|
2647 } |
|
|
2648 } |
|
|
2649 |
|
3504
|
2650 result.elem (i) = (idx_j < 0) ? Complex_NaN_result : tmp_min; |
|
|
2651 index.elem (i) = idx_j; |
|
891
|
2652 } |
|
458
|
2653 } |
|
|
2654 } |
|
|
2655 |
|
|
2656 return result; |
|
|
2657 } |
|
|
2658 |
|
|
2659 ComplexColumnVector |
|
|
2660 ComplexMatrix::row_max (void) const |
|
|
2661 { |
|
2354
|
2662 Array<int> index; |
|
|
2663 return row_max (index); |
|
458
|
2664 } |
|
|
2665 |
|
|
2666 ComplexColumnVector |
|
2354
|
2667 ComplexMatrix::row_max (Array<int>& index) const |
|
458
|
2668 { |
|
|
2669 ComplexColumnVector result; |
|
|
2670 |
|
|
2671 int nr = rows (); |
|
|
2672 int nc = cols (); |
|
|
2673 |
|
|
2674 if (nr > 0 && nc > 0) |
|
|
2675 { |
|
|
2676 result.resize (nr); |
|
2354
|
2677 index.resize (nr); |
|
458
|
2678 |
|
|
2679 for (int i = 0; i < nr; i++) |
|
|
2680 { |
|
3504
|
2681 int idx_j = 0; |
|
|
2682 |
|
|
2683 Complex tmp_max = elem (i, idx_j); |
|
2354
|
2684 |
|
|
2685 bool real_only = row_is_real_only (i); |
|
|
2686 |
|
|
2687 double abs_max = real_only ? real (tmp_max) : abs (tmp_max); |
|
|
2688 |
|
|
2689 if (xisnan (tmp_max)) |
|
3504
|
2690 idx_j = -1; |
|
891
|
2691 else |
|
|
2692 { |
|
|
2693 for (int j = 1; j < nc; j++) |
|
2354
|
2694 { |
|
|
2695 Complex tmp = elem (i, j); |
|
|
2696 |
|
|
2697 double abs_tmp = real_only ? real (tmp) : abs (tmp); |
|
|
2698 |
|
|
2699 if (xisnan (tmp)) |
|
|
2700 { |
|
3504
|
2701 idx_j = -1; |
|
2354
|
2702 break; |
|
|
2703 } |
|
|
2704 else if (abs_tmp > abs_max) |
|
|
2705 { |
|
3504
|
2706 idx_j = j; |
|
2354
|
2707 tmp_max = tmp; |
|
|
2708 abs_max = abs_tmp; |
|
|
2709 } |
|
|
2710 } |
|
|
2711 |
|
3504
|
2712 result.elem (i) = (idx_j < 0) ? Complex_NaN_result : tmp_max; |
|
|
2713 index.elem (i) = idx_j; |
|
891
|
2714 } |
|
458
|
2715 } |
|
|
2716 } |
|
|
2717 |
|
|
2718 return result; |
|
|
2719 } |
|
|
2720 |
|
|
2721 ComplexRowVector |
|
|
2722 ComplexMatrix::column_min (void) const |
|
|
2723 { |
|
2354
|
2724 Array<int> index; |
|
|
2725 return column_min (index); |
|
458
|
2726 } |
|
|
2727 |
|
|
2728 ComplexRowVector |
|
2354
|
2729 ComplexMatrix::column_min (Array<int>& index) const |
|
458
|
2730 { |
|
|
2731 ComplexRowVector result; |
|
|
2732 |
|
|
2733 int nr = rows (); |
|
|
2734 int nc = cols (); |
|
|
2735 |
|
|
2736 if (nr > 0 && nc > 0) |
|
|
2737 { |
|
|
2738 result.resize (nc); |
|
2354
|
2739 index.resize (nc); |
|
458
|
2740 |
|
|
2741 for (int j = 0; j < nc; j++) |
|
|
2742 { |
|
3504
|
2743 int idx_i = 0; |
|
|
2744 |
|
|
2745 Complex tmp_min = elem (idx_i, j); |
|
2354
|
2746 |
|
|
2747 bool real_only = column_is_real_only (j); |
|
|
2748 |
|
|
2749 double abs_min = real_only ? real (tmp_min) : abs (tmp_min); |
|
|
2750 |
|
|
2751 if (xisnan (tmp_min)) |
|
3504
|
2752 idx_i = -1; |
|
891
|
2753 else |
|
|
2754 { |
|
|
2755 for (int i = 1; i < nr; i++) |
|
2354
|
2756 { |
|
|
2757 Complex tmp = elem (i, j); |
|
|
2758 |
|
|
2759 double abs_tmp = real_only ? real (tmp) : abs (tmp); |
|
|
2760 |
|
|
2761 if (xisnan (tmp)) |
|
|
2762 { |
|
3504
|
2763 idx_i = -1; |
|
2354
|
2764 break; |
|
|
2765 } |
|
|
2766 else if (abs_tmp < abs_min) |
|
|
2767 { |
|
3504
|
2768 idx_i = i; |
|
2354
|
2769 tmp_min = tmp; |
|
|
2770 abs_min = abs_tmp; |
|
|
2771 } |
|
|
2772 } |
|
|
2773 |
|
3504
|
2774 result.elem (j) = (idx_i < 0) ? Complex_NaN_result : tmp_min; |
|
|
2775 index.elem (j) = idx_i; |
|
891
|
2776 } |
|
458
|
2777 } |
|
|
2778 } |
|
|
2779 |
|
|
2780 return result; |
|
|
2781 } |
|
|
2782 |
|
|
2783 ComplexRowVector |
|
|
2784 ComplexMatrix::column_max (void) const |
|
|
2785 { |
|
2354
|
2786 Array<int> index; |
|
|
2787 return column_max (index); |
|
458
|
2788 } |
|
|
2789 |
|
|
2790 ComplexRowVector |
|
2354
|
2791 ComplexMatrix::column_max (Array<int>& index) const |
|
458
|
2792 { |
|
|
2793 ComplexRowVector result; |
|
|
2794 |
|
|
2795 int nr = rows (); |
|
|
2796 int nc = cols (); |
|
|
2797 |
|
|
2798 if (nr > 0 && nc > 0) |
|
|
2799 { |
|
|
2800 result.resize (nc); |
|
2354
|
2801 index.resize (nc); |
|
458
|
2802 |
|
|
2803 for (int j = 0; j < nc; j++) |
|
|
2804 { |
|
3504
|
2805 int idx_i = 0; |
|
|
2806 |
|
|
2807 Complex tmp_max = elem (idx_i, j); |
|
2354
|
2808 |
|
|
2809 bool real_only = column_is_real_only (j); |
|
|
2810 |
|
|
2811 double abs_max = real_only ? real (tmp_max) : abs (tmp_max); |
|
|
2812 |
|
|
2813 if (xisnan (tmp_max)) |
|
3504
|
2814 idx_i = -1; |
|
891
|
2815 else |
|
|
2816 { |
|
|
2817 for (int i = 1; i < nr; i++) |
|
2354
|
2818 { |
|
|
2819 Complex tmp = elem (i, j); |
|
|
2820 |
|
|
2821 double abs_tmp = real_only ? real (tmp) : abs (tmp); |
|
|
2822 |
|
|
2823 if (xisnan (tmp)) |
|
|
2824 { |
|
3504
|
2825 idx_i = -1; |
|
2354
|
2826 break; |
|
|
2827 } |
|
|
2828 else if (abs_tmp > abs_max) |
|
|
2829 { |
|
3504
|
2830 idx_i = i; |
|
2354
|
2831 tmp_max = tmp; |
|
|
2832 abs_max = abs_tmp; |
|
|
2833 } |
|
|
2834 } |
|
|
2835 |
|
3504
|
2836 result.elem (j) = (idx_i < 0) ? Complex_NaN_result : tmp_max; |
|
|
2837 index.elem (j) = idx_i; |
|
891
|
2838 } |
|
458
|
2839 } |
|
|
2840 } |
|
|
2841 |
|
|
2842 return result; |
|
|
2843 } |
|
|
2844 |
|
|
2845 // i/o |
|
|
2846 |
|
3504
|
2847 std::ostream& |
|
|
2848 operator << (std::ostream& os, const ComplexMatrix& a) |
|
458
|
2849 { |
|
|
2850 // int field_width = os.precision () + 7; |
|
|
2851 for (int i = 0; i < a.rows (); i++) |
|
|
2852 { |
|
|
2853 for (int j = 0; j < a.cols (); j++) |
|
|
2854 os << " " /* setw (field_width) */ << a.elem (i, j); |
|
|
2855 os << "\n"; |
|
|
2856 } |
|
|
2857 return os; |
|
|
2858 } |
|
|
2859 |
|
3504
|
2860 std::istream& |
|
|
2861 operator >> (std::istream& is, ComplexMatrix& a) |
|
458
|
2862 { |
|
|
2863 int nr = a.rows (); |
|
|
2864 int nc = a.cols (); |
|
|
2865 |
|
|
2866 if (nr < 1 || nc < 1) |
|
3504
|
2867 is.clear (std::ios::badbit); |
|
458
|
2868 else |
|
|
2869 { |
|
|
2870 Complex tmp; |
|
|
2871 for (int i = 0; i < nr; i++) |
|
|
2872 for (int j = 0; j < nc; j++) |
|
|
2873 { |
|
|
2874 is >> tmp; |
|
|
2875 if (is) |
|
|
2876 a.elem (i, j) = tmp; |
|
|
2877 else |
|
2993
|
2878 goto done; |
|
458
|
2879 } |
|
|
2880 } |
|
|
2881 |
|
2993
|
2882 done: |
|
|
2883 |
|
458
|
2884 return is; |
|
|
2885 } |
|
|
2886 |
|
1819
|
2887 ComplexMatrix |
|
|
2888 Givens (const Complex& x, const Complex& y) |
|
|
2889 { |
|
|
2890 double cc; |
|
|
2891 Complex cs, temp_r; |
|
|
2892 |
|
|
2893 F77_FCN (zlartg, ZLARTG) (x, y, cc, cs, temp_r); |
|
|
2894 |
|
|
2895 ComplexMatrix g (2, 2); |
|
|
2896 |
|
|
2897 g.elem (0, 0) = cc; |
|
|
2898 g.elem (1, 1) = cc; |
|
|
2899 g.elem (0, 1) = cs; |
|
|
2900 g.elem (1, 0) = -conj (cs); |
|
|
2901 |
|
|
2902 return g; |
|
|
2903 } |
|
|
2904 |
|
|
2905 ComplexMatrix |
|
|
2906 Sylvester (const ComplexMatrix& a, const ComplexMatrix& b, |
|
|
2907 const ComplexMatrix& c) |
|
|
2908 { |
|
|
2909 ComplexMatrix retval; |
|
|
2910 |
|
|
2911 // XXX FIXME XXX -- need to check that a, b, and c are all the same |
|
|
2912 // size. |
|
|
2913 |
|
|
2914 // Compute Schur decompositions |
|
|
2915 |
|
|
2916 ComplexSCHUR as (a, "U"); |
|
|
2917 ComplexSCHUR bs (b, "U"); |
|
|
2918 |
|
|
2919 // Transform c to new coordinates. |
|
|
2920 |
|
|
2921 ComplexMatrix ua = as.unitary_matrix (); |
|
|
2922 ComplexMatrix sch_a = as.schur_matrix (); |
|
|
2923 |
|
|
2924 ComplexMatrix ub = bs.unitary_matrix (); |
|
|
2925 ComplexMatrix sch_b = bs.schur_matrix (); |
|
|
2926 |
|
|
2927 ComplexMatrix cx = ua.hermitian () * c * ub; |
|
|
2928 |
|
|
2929 // Solve the sylvester equation, back-transform, and return the |
|
|
2930 // solution. |
|
|
2931 |
|
|
2932 int a_nr = a.rows (); |
|
|
2933 int b_nr = b.rows (); |
|
|
2934 |
|
|
2935 double scale; |
|
|
2936 int info; |
|
1950
|
2937 |
|
|
2938 Complex *pa = sch_a.fortran_vec (); |
|
|
2939 Complex *pb = sch_b.fortran_vec (); |
|
|
2940 Complex *px = cx.fortran_vec (); |
|
1819
|
2941 |
|
1950
|
2942 F77_XFCN (ztrsyl, ZTRSYL, ("N", "N", 1, a_nr, b_nr, pa, a_nr, pb, |
|
|
2943 b_nr, px, a_nr, scale, |
|
|
2944 info, 1L, 1L)); |
|
|
2945 |
|
|
2946 if (f77_exception_encountered) |
|
|
2947 (*current_liboctave_error_handler) ("unrecoverable error in ztrsyl"); |
|
|
2948 else |
|
|
2949 { |
|
|
2950 // XXX FIXME XXX -- check info? |
|
|
2951 |
|
|
2952 retval = -ua * cx * ub.hermitian (); |
|
|
2953 } |
|
1819
|
2954 |
|
|
2955 return retval; |
|
|
2956 } |
|
|
2957 |
|
2828
|
2958 ComplexMatrix |
|
|
2959 operator * (const ComplexMatrix& m, const Matrix& a) |
|
|
2960 { |
|
|
2961 ComplexMatrix tmp (a); |
|
|
2962 return m * tmp; |
|
|
2963 } |
|
|
2964 |
|
|
2965 ComplexMatrix |
|
|
2966 operator * (const Matrix& m, const ComplexMatrix& a) |
|
|
2967 { |
|
|
2968 ComplexMatrix tmp (m); |
|
|
2969 return tmp * a; |
|
|
2970 } |
|
|
2971 |
|
|
2972 ComplexMatrix |
|
|
2973 operator * (const ComplexMatrix& m, const ComplexMatrix& a) |
|
|
2974 { |
|
|
2975 ComplexMatrix retval; |
|
|
2976 |
|
|
2977 int nr = m.rows (); |
|
|
2978 int nc = m.cols (); |
|
|
2979 |
|
|
2980 int a_nr = a.rows (); |
|
|
2981 int a_nc = a.cols (); |
|
|
2982 |
|
|
2983 if (nc != a_nr) |
|
|
2984 gripe_nonconformant ("operator *", nr, nc, a_nr, a_nc); |
|
|
2985 else |
|
|
2986 { |
|
|
2987 if (nr == 0 || nc == 0 || a_nc == 0) |
|
|
2988 retval.resize (nr, nc, 0.0); |
|
|
2989 else |
|
|
2990 { |
|
|
2991 int ld = nr; |
|
|
2992 int lda = a.rows (); |
|
|
2993 |
|
|
2994 retval.resize (nr, a_nc); |
|
|
2995 Complex *c = retval.fortran_vec (); |
|
|
2996 |
|
|
2997 F77_XFCN (zgemm, ZGEMM, ("N", "N", nr, a_nc, nc, 1.0, |
|
|
2998 m.data (), ld, a.data (), lda, 0.0, |
|
|
2999 c, nr, 1L, 1L)); |
|
|
3000 |
|
|
3001 if (f77_exception_encountered) |
|
|
3002 (*current_liboctave_error_handler) |
|
|
3003 ("unrecoverable error in zgemm"); |
|
|
3004 } |
|
|
3005 } |
|
|
3006 |
|
|
3007 return retval; |
|
|
3008 } |
|
|
3009 |
|
2870
|
3010 MS_CMP_OPS(ComplexMatrix, real, Complex, real) |
|
3504
|
3011 MS_BOOL_OPS(ComplexMatrix, Complex, 0.0) |
|
2870
|
3012 |
|
|
3013 SM_CMP_OPS(Complex, real, ComplexMatrix, real) |
|
3504
|
3014 SM_BOOL_OPS(Complex, ComplexMatrix, 0.0) |
|
2870
|
3015 |
|
|
3016 MM_CMP_OPS(ComplexMatrix, real, ComplexMatrix, real) |
|
3504
|
3017 MM_BOOL_OPS(ComplexMatrix, ComplexMatrix, 0.0) |
|
2870
|
3018 |
|
458
|
3019 /* |
|
|
3020 ;;; Local Variables: *** |
|
|
3021 ;;; mode: C++ *** |
|
|
3022 ;;; End: *** |
|
|
3023 */ |
