|
1993
|
1 // ColumnVector 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 |
|
4192
|
24 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
1296
|
25 #pragma implementation |
|
|
26 #endif |
|
|
27 |
|
458
|
28 #ifdef HAVE_CONFIG_H |
|
1192
|
29 #include <config.h> |
|
458
|
30 #endif |
|
|
31 |
|
3503
|
32 #include <iostream> |
|
458
|
33 |
|
1847
|
34 #include "f77-fcn.h" |
|
1368
|
35 #include "lo-error.h" |
|
458
|
36 #include "mx-base.h" |
|
|
37 #include "mx-inlines.cc" |
|
1650
|
38 #include "oct-cmplx.h" |
|
458
|
39 |
|
|
40 // Fortran functions we call. |
|
|
41 |
|
|
42 extern "C" |
|
|
43 { |
|
3887
|
44 int F77_FUNC (zgemv, ZGEMV) (const char*, const int&, const int&, |
|
1253
|
45 const Complex&, const Complex*, |
|
|
46 const int&, const Complex*, const int&, |
|
|
47 const Complex&, Complex*, const int&, |
|
|
48 long); |
|
458
|
49 } |
|
|
50 |
|
1360
|
51 // Complex Column Vector class |
|
458
|
52 |
|
|
53 ComplexColumnVector::ComplexColumnVector (const ColumnVector& a) |
|
1214
|
54 : MArray<Complex> (a.length ()) |
|
458
|
55 { |
|
|
56 for (int i = 0; i < length (); i++) |
|
|
57 elem (i) = a.elem (i); |
|
|
58 } |
|
|
59 |
|
2386
|
60 bool |
|
458
|
61 ComplexColumnVector::operator == (const ComplexColumnVector& a) const |
|
|
62 { |
|
|
63 int len = length (); |
|
|
64 if (len != a.length ()) |
|
|
65 return 0; |
|
3769
|
66 return mx_inline_equal (data (), a.data (), len); |
|
458
|
67 } |
|
|
68 |
|
2386
|
69 bool |
|
458
|
70 ComplexColumnVector::operator != (const ComplexColumnVector& a) const |
|
|
71 { |
|
|
72 return !(*this == a); |
|
|
73 } |
|
|
74 |
|
|
75 // destructive insert/delete/reorder operations |
|
|
76 |
|
|
77 ComplexColumnVector& |
|
|
78 ComplexColumnVector::insert (const ColumnVector& a, int r) |
|
|
79 { |
|
|
80 int a_len = a.length (); |
|
4316
|
81 |
|
1699
|
82 if (r < 0 || r + a_len > length ()) |
|
458
|
83 { |
|
|
84 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
85 return *this; |
|
|
86 } |
|
|
87 |
|
4316
|
88 if (a_len > 0) |
|
|
89 { |
|
|
90 make_unique (); |
|
|
91 |
|
|
92 for (int i = 0; i < a_len; i++) |
|
|
93 xelem (r+i) = a.elem (i); |
|
|
94 } |
|
458
|
95 |
|
|
96 return *this; |
|
|
97 } |
|
|
98 |
|
|
99 ComplexColumnVector& |
|
|
100 ComplexColumnVector::insert (const ComplexColumnVector& a, int r) |
|
|
101 { |
|
|
102 int a_len = a.length (); |
|
4316
|
103 |
|
1699
|
104 if (r < 0 || r + a_len > length ()) |
|
458
|
105 { |
|
|
106 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
107 return *this; |
|
|
108 } |
|
|
109 |
|
4316
|
110 if (a_len > 0) |
|
|
111 { |
|
|
112 make_unique (); |
|
|
113 |
|
|
114 for (int i = 0; i < a_len; i++) |
|
|
115 xelem (r+i) = a.elem (i); |
|
|
116 } |
|
458
|
117 |
|
|
118 return *this; |
|
|
119 } |
|
|
120 |
|
|
121 ComplexColumnVector& |
|
|
122 ComplexColumnVector::fill (double val) |
|
|
123 { |
|
|
124 int len = length (); |
|
4316
|
125 |
|
458
|
126 if (len > 0) |
|
4316
|
127 { |
|
|
128 make_unique (); |
|
|
129 |
|
|
130 for (int i = 0; i < len; i++) |
|
|
131 xelem (i) = val; |
|
|
132 } |
|
|
133 |
|
458
|
134 return *this; |
|
|
135 } |
|
|
136 |
|
|
137 ComplexColumnVector& |
|
|
138 ComplexColumnVector::fill (const Complex& val) |
|
|
139 { |
|
|
140 int len = length (); |
|
4316
|
141 |
|
458
|
142 if (len > 0) |
|
4316
|
143 { |
|
|
144 make_unique (); |
|
|
145 |
|
|
146 for (int i = 0; i < len; i++) |
|
|
147 xelem (i) = val; |
|
|
148 } |
|
|
149 |
|
|
150 |
|
458
|
151 return *this; |
|
|
152 } |
|
|
153 |
|
|
154 ComplexColumnVector& |
|
|
155 ComplexColumnVector::fill (double val, int r1, int r2) |
|
|
156 { |
|
|
157 int len = length (); |
|
4316
|
158 |
|
458
|
159 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
160 { |
|
|
161 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
162 return *this; |
|
|
163 } |
|
|
164 |
|
|
165 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
166 |
|
4316
|
167 if (r2 >= r1) |
|
|
168 { |
|
|
169 make_unique (); |
|
|
170 |
|
|
171 for (int i = r1; i <= r2; i++) |
|
|
172 xelem (i) = val; |
|
|
173 } |
|
458
|
174 |
|
|
175 return *this; |
|
|
176 } |
|
|
177 |
|
|
178 ComplexColumnVector& |
|
|
179 ComplexColumnVector::fill (const Complex& val, int r1, int r2) |
|
|
180 { |
|
|
181 int len = length (); |
|
4316
|
182 |
|
458
|
183 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
184 { |
|
|
185 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
186 return *this; |
|
|
187 } |
|
|
188 |
|
|
189 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
190 |
|
4316
|
191 if (r2 >= r1) |
|
|
192 { |
|
|
193 make_unique (); |
|
|
194 |
|
|
195 for (int i = r1; i <= r2; i++) |
|
|
196 xelem (i) = val; |
|
|
197 } |
|
458
|
198 |
|
|
199 return *this; |
|
|
200 } |
|
|
201 |
|
|
202 ComplexColumnVector |
|
|
203 ComplexColumnVector::stack (const ColumnVector& a) const |
|
|
204 { |
|
|
205 int len = length (); |
|
|
206 int nr_insert = len; |
|
|
207 ComplexColumnVector retval (len + a.length ()); |
|
|
208 retval.insert (*this, 0); |
|
|
209 retval.insert (a, nr_insert); |
|
|
210 return retval; |
|
|
211 } |
|
|
212 |
|
|
213 ComplexColumnVector |
|
|
214 ComplexColumnVector::stack (const ComplexColumnVector& a) const |
|
|
215 { |
|
|
216 int len = length (); |
|
|
217 int nr_insert = len; |
|
|
218 ComplexColumnVector retval (len + a.length ()); |
|
|
219 retval.insert (*this, 0); |
|
|
220 retval.insert (a, nr_insert); |
|
|
221 return retval; |
|
|
222 } |
|
|
223 |
|
|
224 ComplexRowVector |
|
|
225 ComplexColumnVector::hermitian (void) const |
|
|
226 { |
|
|
227 int len = length (); |
|
3769
|
228 return ComplexRowVector (mx_inline_conj_dup (data (), len), len); |
|
458
|
229 } |
|
|
230 |
|
|
231 ComplexRowVector |
|
|
232 ComplexColumnVector::transpose (void) const |
|
|
233 { |
|
1858
|
234 return ComplexRowVector (*this); |
|
458
|
235 } |
|
|
236 |
|
|
237 ComplexColumnVector |
|
|
238 conj (const ComplexColumnVector& a) |
|
|
239 { |
|
|
240 int a_len = a.length (); |
|
|
241 ComplexColumnVector retval; |
|
|
242 if (a_len > 0) |
|
3769
|
243 retval = ComplexColumnVector (mx_inline_conj_dup (a.data (), a_len), a_len); |
|
458
|
244 return retval; |
|
|
245 } |
|
|
246 |
|
|
247 // resize is the destructive equivalent for this one |
|
|
248 |
|
|
249 ComplexColumnVector |
|
|
250 ComplexColumnVector::extract (int r1, int r2) const |
|
|
251 { |
|
|
252 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
253 |
|
|
254 int new_r = r2 - r1 + 1; |
|
|
255 |
|
|
256 ComplexColumnVector result (new_r); |
|
|
257 |
|
|
258 for (int i = 0; i < new_r; i++) |
|
|
259 result.elem (i) = elem (r1+i); |
|
|
260 |
|
|
261 return result; |
|
|
262 } |
|
|
263 |
|
4316
|
264 ComplexColumnVector |
|
|
265 ComplexColumnVector::extract_n (int r1, int n) const |
|
|
266 { |
|
|
267 ComplexColumnVector result (n); |
|
|
268 |
|
|
269 for (int i = 0; i < n; i++) |
|
|
270 result.elem (i) = elem (r1+i); |
|
|
271 |
|
|
272 return result; |
|
|
273 } |
|
|
274 |
|
458
|
275 // column vector by column vector -> column vector operations |
|
|
276 |
|
|
277 ComplexColumnVector& |
|
|
278 ComplexColumnVector::operator += (const ColumnVector& a) |
|
|
279 { |
|
|
280 int len = length (); |
|
2386
|
281 |
|
|
282 int a_len = a.length (); |
|
|
283 |
|
|
284 if (len != a_len) |
|
458
|
285 { |
|
2386
|
286 gripe_nonconformant ("operator +=", len, a_len); |
|
458
|
287 return *this; |
|
|
288 } |
|
|
289 |
|
|
290 if (len == 0) |
|
|
291 return *this; |
|
|
292 |
|
|
293 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
294 |
|
3769
|
295 mx_inline_add2 (d, a.data (), len); |
|
458
|
296 return *this; |
|
|
297 } |
|
|
298 |
|
|
299 ComplexColumnVector& |
|
|
300 ComplexColumnVector::operator -= (const ColumnVector& a) |
|
|
301 { |
|
|
302 int len = length (); |
|
2386
|
303 |
|
|
304 int a_len = a.length (); |
|
|
305 |
|
|
306 if (len != a_len) |
|
458
|
307 { |
|
2386
|
308 gripe_nonconformant ("operator -=", len, a_len); |
|
458
|
309 return *this; |
|
|
310 } |
|
|
311 |
|
|
312 if (len == 0) |
|
|
313 return *this; |
|
|
314 |
|
|
315 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
316 |
|
3769
|
317 mx_inline_subtract2 (d, a.data (), len); |
|
458
|
318 return *this; |
|
|
319 } |
|
|
320 |
|
1205
|
321 // matrix by column vector -> column vector operations |
|
|
322 |
|
|
323 ComplexColumnVector |
|
|
324 operator * (const ComplexMatrix& m, const ColumnVector& a) |
|
|
325 { |
|
|
326 ComplexColumnVector tmp (a); |
|
|
327 return m * tmp; |
|
|
328 } |
|
|
329 |
|
|
330 ComplexColumnVector |
|
|
331 operator * (const ComplexMatrix& m, const ComplexColumnVector& a) |
|
|
332 { |
|
1947
|
333 ComplexColumnVector retval; |
|
|
334 |
|
1205
|
335 int nr = m.rows (); |
|
|
336 int nc = m.cols (); |
|
1947
|
337 |
|
2386
|
338 int a_len = a.length (); |
|
|
339 |
|
|
340 if (nc != a_len) |
|
|
341 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1947
|
342 else |
|
458
|
343 { |
|
1947
|
344 if (nc == 0 || nr == 0) |
|
|
345 retval.resize (nr, 0.0); |
|
|
346 else |
|
|
347 { |
|
|
348 int ld = nr; |
|
|
349 |
|
|
350 retval.resize (nr); |
|
|
351 Complex *y = retval.fortran_vec (); |
|
|
352 |
|
|
353 F77_XFCN (zgemv, ZGEMV, ("N", nr, nc, 1.0, m.data (), ld, |
|
|
354 a.data (), 1, 0.0, y, 1, 1L)); |
|
|
355 |
|
|
356 if (f77_exception_encountered) |
|
|
357 (*current_liboctave_error_handler) |
|
|
358 ("unrecoverable error in zgemv"); |
|
|
359 } |
|
458
|
360 } |
|
|
361 |
|
1947
|
362 return retval; |
|
458
|
363 } |
|
|
364 |
|
1205
|
365 // matrix by column vector -> column vector operations |
|
|
366 |
|
|
367 ComplexColumnVector |
|
|
368 operator * (const Matrix& m, const ComplexColumnVector& a) |
|
|
369 { |
|
|
370 ComplexMatrix tmp (m); |
|
|
371 return tmp * a; |
|
|
372 } |
|
|
373 |
|
|
374 // diagonal matrix by column vector -> column vector operations |
|
|
375 |
|
|
376 ComplexColumnVector |
|
|
377 operator * (const DiagMatrix& m, const ComplexColumnVector& a) |
|
|
378 { |
|
|
379 int nr = m.rows (); |
|
|
380 int nc = m.cols (); |
|
2386
|
381 |
|
1205
|
382 int a_len = a.length (); |
|
2386
|
383 |
|
1205
|
384 if (nc != a_len) |
|
|
385 { |
|
2386
|
386 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
3585
|
387 return ComplexColumnVector (); |
|
1205
|
388 } |
|
|
389 |
|
|
390 if (nc == 0 || nr == 0) |
|
|
391 return ComplexColumnVector (0); |
|
|
392 |
|
|
393 ComplexColumnVector result (nr); |
|
|
394 |
|
|
395 for (int i = 0; i < a_len; i++) |
|
|
396 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
397 |
|
1321
|
398 for (int i = a_len; i < nr; i++) |
|
1205
|
399 result.elem (i) = 0.0; |
|
|
400 |
|
|
401 return result; |
|
|
402 } |
|
|
403 |
|
|
404 ComplexColumnVector |
|
|
405 operator * (const ComplexDiagMatrix& m, const ColumnVector& a) |
|
|
406 { |
|
|
407 int nr = m.rows (); |
|
|
408 int nc = m.cols (); |
|
2386
|
409 |
|
1205
|
410 int a_len = a.length (); |
|
2386
|
411 |
|
1205
|
412 if (nc != a_len) |
|
|
413 { |
|
2386
|
414 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
415 return ComplexColumnVector (); |
|
|
416 } |
|
|
417 |
|
|
418 if (nc == 0 || nr == 0) |
|
|
419 return ComplexColumnVector (0); |
|
|
420 |
|
|
421 ComplexColumnVector result (nr); |
|
|
422 |
|
|
423 for (int i = 0; i < a_len; i++) |
|
|
424 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
425 |
|
1321
|
426 for (int i = a_len; i < nr; i++) |
|
1205
|
427 result.elem (i) = 0.0; |
|
|
428 |
|
|
429 return result; |
|
|
430 } |
|
|
431 |
|
|
432 ComplexColumnVector |
|
|
433 operator * (const ComplexDiagMatrix& m, const ComplexColumnVector& a) |
|
|
434 { |
|
|
435 int nr = m.rows (); |
|
|
436 int nc = m.cols (); |
|
2386
|
437 |
|
1205
|
438 int a_len = a.length (); |
|
2386
|
439 |
|
1205
|
440 if (nc != a_len) |
|
|
441 { |
|
2386
|
442 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
443 return ComplexColumnVector (); |
|
|
444 } |
|
|
445 |
|
|
446 if (nc == 0 || nr == 0) |
|
|
447 return ComplexColumnVector (0); |
|
|
448 |
|
|
449 ComplexColumnVector result (nr); |
|
|
450 |
|
|
451 for (int i = 0; i < a_len; i++) |
|
|
452 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
453 |
|
1321
|
454 for (int i = a_len; i < nr; i++) |
|
1205
|
455 result.elem (i) = 0.0; |
|
|
456 |
|
|
457 return result; |
|
|
458 } |
|
|
459 |
|
458
|
460 // other operations |
|
|
461 |
|
|
462 ComplexColumnVector |
|
2676
|
463 ComplexColumnVector::map (c_c_Mapper f) const |
|
458
|
464 { |
|
2676
|
465 ComplexColumnVector b (*this); |
|
|
466 return b.apply (f); |
|
458
|
467 } |
|
|
468 |
|
2676
|
469 ColumnVector |
|
|
470 ComplexColumnVector::map (d_c_Mapper f) const |
|
458
|
471 { |
|
2676
|
472 const Complex *d = data (); |
|
|
473 |
|
|
474 int len = length (); |
|
|
475 |
|
|
476 ColumnVector retval (len); |
|
|
477 |
|
|
478 double *r = retval.fortran_vec (); |
|
|
479 |
|
|
480 for (int i = 0; i < len; i++) |
|
|
481 r[i] = f (d[i]); |
|
|
482 |
|
|
483 return retval; |
|
|
484 } |
|
|
485 |
|
|
486 ComplexColumnVector& |
|
|
487 ComplexColumnVector::apply (c_c_Mapper f) |
|
|
488 { |
|
|
489 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
490 |
|
458
|
491 for (int i = 0; i < length (); i++) |
|
2676
|
492 d[i] = f (d[i]); |
|
|
493 |
|
|
494 return *this; |
|
458
|
495 } |
|
|
496 |
|
|
497 Complex |
|
|
498 ComplexColumnVector::min (void) const |
|
|
499 { |
|
|
500 int len = length (); |
|
|
501 if (len == 0) |
|
|
502 return 0.0; |
|
|
503 |
|
|
504 Complex res = elem (0); |
|
|
505 double absres = abs (res); |
|
|
506 |
|
|
507 for (int i = 1; i < len; i++) |
|
|
508 if (abs (elem (i)) < absres) |
|
|
509 { |
|
|
510 res = elem (i); |
|
|
511 absres = abs (res); |
|
|
512 } |
|
|
513 |
|
|
514 return res; |
|
|
515 } |
|
|
516 |
|
|
517 Complex |
|
|
518 ComplexColumnVector::max (void) const |
|
|
519 { |
|
|
520 int len = length (); |
|
|
521 if (len == 0) |
|
|
522 return 0.0; |
|
|
523 |
|
|
524 Complex res = elem (0); |
|
|
525 double absres = abs (res); |
|
|
526 |
|
|
527 for (int i = 1; i < len; i++) |
|
|
528 if (abs (elem (i)) > absres) |
|
|
529 { |
|
|
530 res = elem (i); |
|
|
531 absres = abs (res); |
|
|
532 } |
|
|
533 |
|
|
534 return res; |
|
|
535 } |
|
|
536 |
|
|
537 // i/o |
|
|
538 |
|
3504
|
539 std::ostream& |
|
|
540 operator << (std::ostream& os, const ComplexColumnVector& a) |
|
458
|
541 { |
|
|
542 // int field_width = os.precision () + 7; |
|
|
543 for (int i = 0; i < a.length (); i++) |
|
|
544 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
|
|
545 return os; |
|
|
546 } |
|
|
547 |
|
3504
|
548 std::istream& |
|
|
549 operator >> (std::istream& is, ComplexColumnVector& a) |
|
458
|
550 { |
|
|
551 int len = a.length(); |
|
|
552 |
|
|
553 if (len < 1) |
|
3504
|
554 is.clear (std::ios::badbit); |
|
458
|
555 else |
|
|
556 { |
|
|
557 double tmp; |
|
|
558 for (int i = 0; i < len; i++) |
|
|
559 { |
|
|
560 is >> tmp; |
|
|
561 if (is) |
|
|
562 a.elem (i) = tmp; |
|
|
563 else |
|
|
564 break; |
|
|
565 } |
|
|
566 } |
|
532
|
567 return is; |
|
458
|
568 } |
|
|
569 |
|
|
570 /* |
|
|
571 ;;; Local Variables: *** |
|
|
572 ;;; mode: C++ *** |
|
|
573 ;;; End: *** |
|
|
574 */ |
