|
458
|
1 // ColumnVector manipulations. -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
1882
|
4 Copyright (C) 1996 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 |
|
|
32 #include <iostream.h> |
|
|
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 { |
|
1253
|
44 int F77_FCN (zgemv, ZGEMV) (const char*, const int&, const int&, |
|
|
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 |
|
|
60 int |
|
|
61 ComplexColumnVector::operator == (const ComplexColumnVector& a) const |
|
|
62 { |
|
|
63 int len = length (); |
|
|
64 if (len != a.length ()) |
|
|
65 return 0; |
|
|
66 return equal (data (), a.data (), len); |
|
|
67 } |
|
|
68 |
|
|
69 int |
|
|
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 (); |
|
1699
|
81 if (r < 0 || r + a_len > length ()) |
|
458
|
82 { |
|
|
83 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
84 return *this; |
|
|
85 } |
|
|
86 |
|
|
87 for (int i = 0; i < a_len; i++) |
|
|
88 elem (r+i) = a.elem (i); |
|
|
89 |
|
|
90 return *this; |
|
|
91 } |
|
|
92 |
|
|
93 ComplexColumnVector& |
|
|
94 ComplexColumnVector::insert (const ComplexColumnVector& a, int r) |
|
|
95 { |
|
|
96 int a_len = a.length (); |
|
1699
|
97 if (r < 0 || r + a_len > length ()) |
|
458
|
98 { |
|
|
99 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
100 return *this; |
|
|
101 } |
|
|
102 |
|
|
103 for (int i = 0; i < a_len; i++) |
|
|
104 elem (r+i) = a.elem (i); |
|
|
105 |
|
|
106 return *this; |
|
|
107 } |
|
|
108 |
|
|
109 ComplexColumnVector& |
|
|
110 ComplexColumnVector::fill (double val) |
|
|
111 { |
|
|
112 int len = length (); |
|
|
113 if (len > 0) |
|
|
114 for (int i = 0; i < len; i++) |
|
|
115 elem (i) = val; |
|
|
116 return *this; |
|
|
117 } |
|
|
118 |
|
|
119 ComplexColumnVector& |
|
|
120 ComplexColumnVector::fill (const Complex& val) |
|
|
121 { |
|
|
122 int len = length (); |
|
|
123 if (len > 0) |
|
|
124 for (int i = 0; i < len; i++) |
|
|
125 elem (i) = val; |
|
|
126 return *this; |
|
|
127 } |
|
|
128 |
|
|
129 ComplexColumnVector& |
|
|
130 ComplexColumnVector::fill (double val, int r1, int r2) |
|
|
131 { |
|
|
132 int len = length (); |
|
|
133 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
134 { |
|
|
135 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
136 return *this; |
|
|
137 } |
|
|
138 |
|
|
139 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
140 |
|
|
141 for (int i = r1; i <= r2; i++) |
|
|
142 elem (i) = val; |
|
|
143 |
|
|
144 return *this; |
|
|
145 } |
|
|
146 |
|
|
147 ComplexColumnVector& |
|
|
148 ComplexColumnVector::fill (const Complex& val, int r1, int r2) |
|
|
149 { |
|
|
150 int len = length (); |
|
|
151 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
152 { |
|
|
153 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
154 return *this; |
|
|
155 } |
|
|
156 |
|
|
157 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
158 |
|
|
159 for (int i = r1; i <= r2; i++) |
|
|
160 elem (i) = val; |
|
|
161 |
|
|
162 return *this; |
|
|
163 } |
|
|
164 |
|
|
165 ComplexColumnVector |
|
|
166 ComplexColumnVector::stack (const ColumnVector& a) const |
|
|
167 { |
|
|
168 int len = length (); |
|
|
169 int nr_insert = len; |
|
|
170 ComplexColumnVector retval (len + a.length ()); |
|
|
171 retval.insert (*this, 0); |
|
|
172 retval.insert (a, nr_insert); |
|
|
173 return retval; |
|
|
174 } |
|
|
175 |
|
|
176 ComplexColumnVector |
|
|
177 ComplexColumnVector::stack (const ComplexColumnVector& a) const |
|
|
178 { |
|
|
179 int len = length (); |
|
|
180 int nr_insert = len; |
|
|
181 ComplexColumnVector retval (len + a.length ()); |
|
|
182 retval.insert (*this, 0); |
|
|
183 retval.insert (a, nr_insert); |
|
|
184 return retval; |
|
|
185 } |
|
|
186 |
|
|
187 ComplexRowVector |
|
|
188 ComplexColumnVector::hermitian (void) const |
|
|
189 { |
|
|
190 int len = length (); |
|
|
191 return ComplexRowVector (conj_dup (data (), len), len); |
|
|
192 } |
|
|
193 |
|
|
194 ComplexRowVector |
|
|
195 ComplexColumnVector::transpose (void) const |
|
|
196 { |
|
1858
|
197 return ComplexRowVector (*this); |
|
458
|
198 } |
|
|
199 |
|
|
200 ComplexColumnVector |
|
|
201 conj (const ComplexColumnVector& a) |
|
|
202 { |
|
|
203 int a_len = a.length (); |
|
|
204 ComplexColumnVector retval; |
|
|
205 if (a_len > 0) |
|
|
206 retval = ComplexColumnVector (conj_dup (a.data (), a_len), a_len); |
|
|
207 return retval; |
|
|
208 } |
|
|
209 |
|
|
210 // resize is the destructive equivalent for this one |
|
|
211 |
|
|
212 ComplexColumnVector |
|
|
213 ComplexColumnVector::extract (int r1, int r2) const |
|
|
214 { |
|
|
215 if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } |
|
|
216 |
|
|
217 int new_r = r2 - r1 + 1; |
|
|
218 |
|
|
219 ComplexColumnVector result (new_r); |
|
|
220 |
|
|
221 for (int i = 0; i < new_r; i++) |
|
|
222 result.elem (i) = elem (r1+i); |
|
|
223 |
|
|
224 return result; |
|
|
225 } |
|
|
226 |
|
|
227 // column vector by column vector -> column vector operations |
|
|
228 |
|
|
229 ComplexColumnVector& |
|
|
230 ComplexColumnVector::operator += (const ColumnVector& a) |
|
|
231 { |
|
|
232 int len = length (); |
|
|
233 if (len != a.length ()) |
|
|
234 { |
|
|
235 (*current_liboctave_error_handler) |
|
|
236 ("nonconformant vector += operation attempted"); |
|
|
237 return *this; |
|
|
238 } |
|
|
239 |
|
|
240 if (len == 0) |
|
|
241 return *this; |
|
|
242 |
|
|
243 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
244 |
|
|
245 add2 (d, a.data (), len); |
|
|
246 return *this; |
|
|
247 } |
|
|
248 |
|
|
249 ComplexColumnVector& |
|
|
250 ComplexColumnVector::operator -= (const ColumnVector& a) |
|
|
251 { |
|
|
252 int len = length (); |
|
|
253 if (len != a.length ()) |
|
|
254 { |
|
|
255 (*current_liboctave_error_handler) |
|
|
256 ("nonconformant vector -= operation attempted"); |
|
|
257 return *this; |
|
|
258 } |
|
|
259 |
|
|
260 if (len == 0) |
|
|
261 return *this; |
|
|
262 |
|
|
263 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
264 |
|
|
265 subtract2 (d, a.data (), len); |
|
|
266 return *this; |
|
|
267 } |
|
|
268 |
|
|
269 ComplexColumnVector& |
|
|
270 ComplexColumnVector::operator += (const ComplexColumnVector& a) |
|
|
271 { |
|
|
272 int len = length (); |
|
|
273 |
|
|
274 if (len != a.length ()) |
|
|
275 { |
|
|
276 (*current_liboctave_error_handler) |
|
|
277 ("nonconformant vector += operation attempted"); |
|
|
278 return *this; |
|
|
279 } |
|
|
280 |
|
|
281 if (len == 0) |
|
|
282 return *this; |
|
|
283 |
|
|
284 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
285 |
|
|
286 add2 (d, a.data (), len); |
|
|
287 return *this; |
|
|
288 } |
|
|
289 |
|
|
290 ComplexColumnVector& |
|
|
291 ComplexColumnVector::operator -= (const ComplexColumnVector& a) |
|
|
292 { |
|
|
293 int len = length (); |
|
|
294 if (len != a.length ()) |
|
|
295 { |
|
|
296 (*current_liboctave_error_handler) |
|
|
297 ("nonconformant vector -= operation attempted"); |
|
|
298 return *this; |
|
|
299 } |
|
|
300 |
|
|
301 if (len == 0) |
|
|
302 return *this; |
|
|
303 |
|
|
304 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
305 |
|
|
306 subtract2 (d, a.data (), len); |
|
|
307 return *this; |
|
|
308 } |
|
|
309 |
|
|
310 // column vector by scalar -> column vector operations |
|
|
311 |
|
|
312 ComplexColumnVector |
|
|
313 operator + (const ComplexColumnVector& v, double s) |
|
|
314 { |
|
|
315 int len = v.length (); |
|
|
316 return ComplexColumnVector (add (v.data (), len, s), len); |
|
|
317 } |
|
|
318 |
|
|
319 ComplexColumnVector |
|
|
320 operator - (const ComplexColumnVector& v, double s) |
|
|
321 { |
|
|
322 int len = v.length (); |
|
|
323 return ComplexColumnVector (subtract (v.data (), len, s), len); |
|
|
324 } |
|
|
325 |
|
|
326 ComplexColumnVector |
|
|
327 operator * (const ComplexColumnVector& v, double s) |
|
|
328 { |
|
|
329 int len = v.length (); |
|
|
330 return ComplexColumnVector (multiply (v.data (), len, s), len); |
|
|
331 } |
|
|
332 |
|
|
333 ComplexColumnVector |
|
|
334 operator / (const ComplexColumnVector& v, double s) |
|
|
335 { |
|
|
336 int len = v.length (); |
|
|
337 return ComplexColumnVector (divide (v.data (), len, s), len); |
|
|
338 } |
|
|
339 |
|
1205
|
340 ComplexColumnVector |
|
|
341 operator + (const ColumnVector& a, const Complex& s) |
|
|
342 { |
|
|
343 int len = a.length (); |
|
|
344 return ComplexColumnVector (add (a.data (), len, s), len); |
|
|
345 } |
|
|
346 |
|
|
347 ComplexColumnVector |
|
|
348 operator - (const ColumnVector& a, const Complex& s) |
|
|
349 { |
|
|
350 int len = a.length (); |
|
|
351 return ComplexColumnVector (subtract (a.data (), len, s), len); |
|
|
352 } |
|
|
353 |
|
|
354 ComplexColumnVector |
|
|
355 operator * (const ColumnVector& a, const Complex& s) |
|
|
356 { |
|
|
357 int len = a.length (); |
|
|
358 return ComplexColumnVector (multiply (a.data (), len, s), len); |
|
|
359 } |
|
|
360 |
|
|
361 ComplexColumnVector |
|
|
362 operator / (const ColumnVector& a, const Complex& s) |
|
|
363 { |
|
|
364 int len = a.length (); |
|
|
365 return ComplexColumnVector (divide (a.data (), len, s), len); |
|
|
366 } |
|
|
367 |
|
458
|
368 // scalar by column vector -> column vector operations |
|
|
369 |
|
|
370 ComplexColumnVector |
|
|
371 operator + (double s, const ComplexColumnVector& a) |
|
|
372 { |
|
|
373 int a_len = a.length (); |
|
|
374 return ComplexColumnVector (add (a.data (), a_len, s), a_len); |
|
|
375 } |
|
|
376 |
|
|
377 ComplexColumnVector |
|
|
378 operator - (double s, const ComplexColumnVector& a) |
|
|
379 { |
|
|
380 int a_len = a.length (); |
|
|
381 return ComplexColumnVector (subtract (s, a.data (), a_len), a_len); |
|
|
382 } |
|
|
383 |
|
|
384 ComplexColumnVector |
|
|
385 operator * (double s, const ComplexColumnVector& a) |
|
|
386 { |
|
|
387 int a_len = a.length (); |
|
|
388 return ComplexColumnVector (multiply (a.data (), a_len, s), a_len); |
|
|
389 } |
|
|
390 |
|
|
391 ComplexColumnVector |
|
|
392 operator / (double s, const ComplexColumnVector& a) |
|
|
393 { |
|
|
394 int a_len = a.length (); |
|
|
395 return ComplexColumnVector (divide (s, a.data (), a_len), a_len); |
|
|
396 } |
|
|
397 |
|
1205
|
398 ComplexColumnVector |
|
|
399 operator + (const Complex& s, const ColumnVector& a) |
|
|
400 { |
|
|
401 int a_len = a.length (); |
|
|
402 return ComplexColumnVector (add (a.data (), a_len, s), a_len); |
|
|
403 } |
|
|
404 |
|
|
405 ComplexColumnVector |
|
|
406 operator - (const Complex& s, const ColumnVector& a) |
|
|
407 { |
|
|
408 int a_len = a.length (); |
|
|
409 return ComplexColumnVector (subtract (s, a.data (), a_len), a_len); |
|
|
410 } |
|
|
411 |
|
|
412 ComplexColumnVector |
|
|
413 operator * (const Complex& s, const ColumnVector& a) |
|
|
414 { |
|
|
415 int a_len = a.length (); |
|
|
416 return ComplexColumnVector (multiply (a.data (), a_len, s), a_len); |
|
|
417 } |
|
458
|
418 |
|
1205
|
419 ComplexColumnVector |
|
|
420 operator / (const Complex& s, const ColumnVector& a) |
|
458
|
421 { |
|
|
422 int a_len = a.length (); |
|
1205
|
423 return ComplexColumnVector (divide (s, a.data (), a_len), a_len); |
|
|
424 } |
|
|
425 |
|
|
426 // matrix by column vector -> column vector operations |
|
|
427 |
|
|
428 ComplexColumnVector |
|
|
429 operator * (const ComplexMatrix& m, const ColumnVector& a) |
|
|
430 { |
|
|
431 ComplexColumnVector tmp (a); |
|
|
432 return m * tmp; |
|
|
433 } |
|
|
434 |
|
|
435 ComplexColumnVector |
|
|
436 operator * (const ComplexMatrix& m, const ComplexColumnVector& a) |
|
|
437 { |
|
1947
|
438 ComplexColumnVector retval; |
|
|
439 |
|
1205
|
440 int nr = m.rows (); |
|
|
441 int nc = m.cols (); |
|
1947
|
442 |
|
1205
|
443 if (nc != a.length ()) |
|
1947
|
444 (*current_liboctave_error_handler) |
|
|
445 ("nonconformant matrix multiplication attempted"); |
|
|
446 else |
|
458
|
447 { |
|
1947
|
448 if (nc == 0 || nr == 0) |
|
|
449 retval.resize (nr, 0.0); |
|
|
450 else |
|
|
451 { |
|
|
452 int ld = nr; |
|
|
453 |
|
|
454 retval.resize (nr); |
|
|
455 Complex *y = retval.fortran_vec (); |
|
|
456 |
|
|
457 F77_XFCN (zgemv, ZGEMV, ("N", nr, nc, 1.0, m.data (), ld, |
|
|
458 a.data (), 1, 0.0, y, 1, 1L)); |
|
|
459 |
|
|
460 if (f77_exception_encountered) |
|
|
461 (*current_liboctave_error_handler) |
|
|
462 ("unrecoverable error in zgemv"); |
|
|
463 } |
|
458
|
464 } |
|
|
465 |
|
1947
|
466 return retval; |
|
458
|
467 } |
|
|
468 |
|
|
469 // column vector by column vector -> column vector operations |
|
|
470 |
|
|
471 ComplexColumnVector |
|
|
472 operator + (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
473 { |
|
|
474 int len = v.length (); |
|
|
475 if (len != a.length ()) |
|
|
476 { |
|
|
477 (*current_liboctave_error_handler) |
|
|
478 ("nonconformant vector addition attempted"); |
|
|
479 return ComplexColumnVector (); |
|
|
480 } |
|
|
481 |
|
|
482 if (len == 0) |
|
|
483 return ComplexColumnVector (0); |
|
|
484 |
|
|
485 return ComplexColumnVector (add (v.data (), a.data (), len), len); |
|
|
486 } |
|
|
487 |
|
|
488 ComplexColumnVector |
|
|
489 operator - (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
490 { |
|
|
491 int len = v.length (); |
|
|
492 if (len != a.length ()) |
|
|
493 { |
|
|
494 (*current_liboctave_error_handler) |
|
|
495 ("nonconformant vector subtraction attempted"); |
|
|
496 return ComplexColumnVector (); |
|
|
497 } |
|
|
498 |
|
|
499 if (len == 0) |
|
|
500 return ComplexColumnVector (0); |
|
|
501 |
|
|
502 return ComplexColumnVector (subtract (v.data (), a.data (), len), len); |
|
|
503 } |
|
|
504 |
|
|
505 ComplexColumnVector |
|
1205
|
506 operator + (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
507 { |
|
|
508 int len = v.length (); |
|
|
509 if (len != a.length ()) |
|
|
510 { |
|
|
511 (*current_liboctave_error_handler) |
|
|
512 ("nonconformant vector subtraction attempted"); |
|
|
513 return ComplexColumnVector (); |
|
|
514 } |
|
|
515 |
|
|
516 if (len == 0) |
|
|
517 return ComplexColumnVector (0); |
|
|
518 |
|
|
519 return ComplexColumnVector (add (v.data (), a.data (), len), len); |
|
|
520 } |
|
|
521 |
|
|
522 ComplexColumnVector |
|
|
523 operator - (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
524 { |
|
|
525 int len = v.length (); |
|
|
526 if (len != a.length ()) |
|
|
527 { |
|
|
528 (*current_liboctave_error_handler) |
|
|
529 ("nonconformant vector subtraction attempted"); |
|
|
530 return ComplexColumnVector (); |
|
|
531 } |
|
|
532 |
|
|
533 if (len == 0) |
|
|
534 return ComplexColumnVector (0); |
|
|
535 |
|
|
536 return ComplexColumnVector (subtract (v.data (), a.data (), len), len); |
|
|
537 } |
|
|
538 |
|
|
539 ComplexColumnVector |
|
458
|
540 product (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
541 { |
|
|
542 int len = v.length (); |
|
|
543 if (len != a.length ()) |
|
|
544 { |
|
|
545 (*current_liboctave_error_handler) |
|
|
546 ("nonconformant vector product attempted"); |
|
|
547 return ComplexColumnVector (); |
|
|
548 } |
|
|
549 |
|
|
550 if (len == 0) |
|
|
551 return ComplexColumnVector (0); |
|
|
552 |
|
|
553 return ComplexColumnVector (multiply (v.data (), a.data (), len), len); |
|
|
554 } |
|
|
555 |
|
|
556 ComplexColumnVector |
|
|
557 quotient (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
558 { |
|
|
559 int len = v.length (); |
|
|
560 if (len != a.length ()) |
|
|
561 { |
|
|
562 (*current_liboctave_error_handler) |
|
|
563 ("nonconformant vector quotient attempted"); |
|
|
564 return ComplexColumnVector (); |
|
|
565 } |
|
|
566 |
|
|
567 if (len == 0) |
|
|
568 return ComplexColumnVector (0); |
|
|
569 |
|
|
570 return ComplexColumnVector (divide (v.data (), a.data (), len), len); |
|
|
571 } |
|
|
572 |
|
1205
|
573 ComplexColumnVector |
|
|
574 product (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
575 { |
|
|
576 int len = v.length (); |
|
|
577 if (len != a.length ()) |
|
|
578 { |
|
|
579 (*current_liboctave_error_handler) |
|
|
580 ("nonconformant vector product attempted"); |
|
|
581 return ColumnVector (); |
|
|
582 } |
|
|
583 |
|
|
584 if (len == 0) |
|
|
585 return ComplexColumnVector (0); |
|
|
586 |
|
|
587 return ComplexColumnVector (multiply (v.data (), a.data (), len), len); |
|
|
588 } |
|
|
589 |
|
|
590 ComplexColumnVector |
|
|
591 quotient (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
592 { |
|
|
593 int len = v.length (); |
|
|
594 if (len != a.length ()) |
|
|
595 { |
|
|
596 (*current_liboctave_error_handler) |
|
|
597 ("nonconformant vector quotient attempted"); |
|
|
598 return ColumnVector (); |
|
|
599 } |
|
|
600 |
|
|
601 if (len == 0) |
|
|
602 return ComplexColumnVector (0); |
|
|
603 |
|
|
604 return ComplexColumnVector (divide (v.data (), a.data (), len), len); |
|
|
605 } |
|
|
606 |
|
|
607 // matrix by column vector -> column vector operations |
|
|
608 |
|
|
609 ComplexColumnVector |
|
|
610 operator * (const Matrix& m, const ComplexColumnVector& a) |
|
|
611 { |
|
|
612 ComplexMatrix tmp (m); |
|
|
613 return tmp * a; |
|
|
614 } |
|
|
615 |
|
|
616 // diagonal matrix by column vector -> column vector operations |
|
|
617 |
|
|
618 ComplexColumnVector |
|
|
619 operator * (const DiagMatrix& m, const ComplexColumnVector& a) |
|
|
620 { |
|
|
621 int nr = m.rows (); |
|
|
622 int nc = m.cols (); |
|
|
623 int a_len = a.length (); |
|
|
624 if (nc != a_len) |
|
|
625 { |
|
|
626 (*current_liboctave_error_handler) |
|
|
627 ("nonconformant matrix multiplication attempted"); |
|
|
628 return ColumnVector (); |
|
|
629 } |
|
|
630 |
|
|
631 if (nc == 0 || nr == 0) |
|
|
632 return ComplexColumnVector (0); |
|
|
633 |
|
|
634 ComplexColumnVector result (nr); |
|
|
635 |
|
|
636 for (int i = 0; i < a_len; i++) |
|
|
637 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
638 |
|
1321
|
639 for (int i = a_len; i < nr; i++) |
|
1205
|
640 result.elem (i) = 0.0; |
|
|
641 |
|
|
642 return result; |
|
|
643 } |
|
|
644 |
|
|
645 ComplexColumnVector |
|
|
646 operator * (const ComplexDiagMatrix& m, const ColumnVector& a) |
|
|
647 { |
|
|
648 int nr = m.rows (); |
|
|
649 int nc = m.cols (); |
|
|
650 int a_len = a.length (); |
|
|
651 if (nc != a_len) |
|
|
652 { |
|
|
653 (*current_liboctave_error_handler) |
|
|
654 ("nonconformant matrix muliplication attempted"); |
|
|
655 return ComplexColumnVector (); |
|
|
656 } |
|
|
657 |
|
|
658 if (nc == 0 || nr == 0) |
|
|
659 return ComplexColumnVector (0); |
|
|
660 |
|
|
661 ComplexColumnVector result (nr); |
|
|
662 |
|
|
663 for (int i = 0; i < a_len; i++) |
|
|
664 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
665 |
|
1321
|
666 for (int i = a_len; i < nr; i++) |
|
1205
|
667 result.elem (i) = 0.0; |
|
|
668 |
|
|
669 return result; |
|
|
670 } |
|
|
671 |
|
|
672 ComplexColumnVector |
|
|
673 operator * (const ComplexDiagMatrix& m, const ComplexColumnVector& a) |
|
|
674 { |
|
|
675 int nr = m.rows (); |
|
|
676 int nc = m.cols (); |
|
|
677 int a_len = a.length (); |
|
|
678 if (nc != a_len) |
|
|
679 { |
|
|
680 (*current_liboctave_error_handler) |
|
|
681 ("nonconformant matrix muliplication attempted"); |
|
|
682 return ComplexColumnVector (); |
|
|
683 } |
|
|
684 |
|
|
685 if (nc == 0 || nr == 0) |
|
|
686 return ComplexColumnVector (0); |
|
|
687 |
|
|
688 ComplexColumnVector result (nr); |
|
|
689 |
|
|
690 for (int i = 0; i < a_len; i++) |
|
|
691 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
692 |
|
1321
|
693 for (int i = a_len; i < nr; i++) |
|
1205
|
694 result.elem (i) = 0.0; |
|
|
695 |
|
|
696 return result; |
|
|
697 } |
|
|
698 |
|
458
|
699 // other operations |
|
|
700 |
|
|
701 ComplexColumnVector |
|
|
702 map (c_c_Mapper f, const ComplexColumnVector& a) |
|
|
703 { |
|
|
704 ComplexColumnVector b (a); |
|
|
705 b.map (f); |
|
|
706 return b; |
|
|
707 } |
|
|
708 |
|
|
709 void |
|
|
710 ComplexColumnVector::map (c_c_Mapper f) |
|
|
711 { |
|
|
712 for (int i = 0; i < length (); i++) |
|
|
713 elem (i) = f (elem (i)); |
|
|
714 } |
|
|
715 |
|
|
716 Complex |
|
|
717 ComplexColumnVector::min (void) const |
|
|
718 { |
|
|
719 int len = length (); |
|
|
720 if (len == 0) |
|
|
721 return 0.0; |
|
|
722 |
|
|
723 Complex res = elem (0); |
|
|
724 double absres = abs (res); |
|
|
725 |
|
|
726 for (int i = 1; i < len; i++) |
|
|
727 if (abs (elem (i)) < absres) |
|
|
728 { |
|
|
729 res = elem (i); |
|
|
730 absres = abs (res); |
|
|
731 } |
|
|
732 |
|
|
733 return res; |
|
|
734 } |
|
|
735 |
|
|
736 Complex |
|
|
737 ComplexColumnVector::max (void) const |
|
|
738 { |
|
|
739 int len = length (); |
|
|
740 if (len == 0) |
|
|
741 return 0.0; |
|
|
742 |
|
|
743 Complex res = elem (0); |
|
|
744 double absres = abs (res); |
|
|
745 |
|
|
746 for (int i = 1; i < len; i++) |
|
|
747 if (abs (elem (i)) > absres) |
|
|
748 { |
|
|
749 res = elem (i); |
|
|
750 absres = abs (res); |
|
|
751 } |
|
|
752 |
|
|
753 return res; |
|
|
754 } |
|
|
755 |
|
|
756 // i/o |
|
|
757 |
|
|
758 ostream& |
|
|
759 operator << (ostream& os, const ComplexColumnVector& a) |
|
|
760 { |
|
|
761 // int field_width = os.precision () + 7; |
|
|
762 for (int i = 0; i < a.length (); i++) |
|
|
763 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
|
|
764 return os; |
|
|
765 } |
|
|
766 |
|
|
767 istream& |
|
|
768 operator >> (istream& is, ComplexColumnVector& a) |
|
|
769 { |
|
|
770 int len = a.length(); |
|
|
771 |
|
|
772 if (len < 1) |
|
|
773 is.clear (ios::badbit); |
|
|
774 else |
|
|
775 { |
|
|
776 double tmp; |
|
|
777 for (int i = 0; i < len; i++) |
|
|
778 { |
|
|
779 is >> tmp; |
|
|
780 if (is) |
|
|
781 a.elem (i) = tmp; |
|
|
782 else |
|
|
783 break; |
|
|
784 } |
|
|
785 } |
|
532
|
786 return is; |
|
458
|
787 } |
|
|
788 |
|
|
789 /* |
|
|
790 ;;; Local Variables: *** |
|
|
791 ;;; mode: C++ *** |
|
|
792 ;;; page-delimiter: "^/\\*" *** |
|
|
793 ;;; End: *** |
|
|
794 */ |
