|
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 |
|
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 |
|
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 { |
|
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 |
|
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 (); |
|
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 (); |
|
3769
|
191 return ComplexRowVector (mx_inline_conj_dup (data (), len), len); |
|
458
|
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) |
|
3769
|
206 retval = ComplexColumnVector (mx_inline_conj_dup (a.data (), a_len), a_len); |
|
458
|
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 (); |
|
2386
|
233 |
|
|
234 int a_len = a.length (); |
|
|
235 |
|
|
236 if (len != a_len) |
|
458
|
237 { |
|
2386
|
238 gripe_nonconformant ("operator +=", len, a_len); |
|
458
|
239 return *this; |
|
|
240 } |
|
|
241 |
|
|
242 if (len == 0) |
|
|
243 return *this; |
|
|
244 |
|
|
245 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
246 |
|
3769
|
247 mx_inline_add2 (d, a.data (), len); |
|
458
|
248 return *this; |
|
|
249 } |
|
|
250 |
|
|
251 ComplexColumnVector& |
|
|
252 ComplexColumnVector::operator -= (const ColumnVector& a) |
|
|
253 { |
|
|
254 int len = length (); |
|
2386
|
255 |
|
|
256 int a_len = a.length (); |
|
|
257 |
|
|
258 if (len != a_len) |
|
458
|
259 { |
|
2386
|
260 gripe_nonconformant ("operator -=", len, a_len); |
|
458
|
261 return *this; |
|
|
262 } |
|
|
263 |
|
|
264 if (len == 0) |
|
|
265 return *this; |
|
|
266 |
|
|
267 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
268 |
|
3769
|
269 mx_inline_subtract2 (d, a.data (), len); |
|
458
|
270 return *this; |
|
|
271 } |
|
|
272 |
|
1205
|
273 // matrix by column vector -> column vector operations |
|
|
274 |
|
|
275 ComplexColumnVector |
|
|
276 operator * (const ComplexMatrix& m, const ColumnVector& a) |
|
|
277 { |
|
|
278 ComplexColumnVector tmp (a); |
|
|
279 return m * tmp; |
|
|
280 } |
|
|
281 |
|
|
282 ComplexColumnVector |
|
|
283 operator * (const ComplexMatrix& m, const ComplexColumnVector& a) |
|
|
284 { |
|
1947
|
285 ComplexColumnVector retval; |
|
|
286 |
|
1205
|
287 int nr = m.rows (); |
|
|
288 int nc = m.cols (); |
|
1947
|
289 |
|
2386
|
290 int a_len = a.length (); |
|
|
291 |
|
|
292 if (nc != a_len) |
|
|
293 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1947
|
294 else |
|
458
|
295 { |
|
1947
|
296 if (nc == 0 || nr == 0) |
|
|
297 retval.resize (nr, 0.0); |
|
|
298 else |
|
|
299 { |
|
|
300 int ld = nr; |
|
|
301 |
|
|
302 retval.resize (nr); |
|
|
303 Complex *y = retval.fortran_vec (); |
|
|
304 |
|
|
305 F77_XFCN (zgemv, ZGEMV, ("N", nr, nc, 1.0, m.data (), ld, |
|
|
306 a.data (), 1, 0.0, y, 1, 1L)); |
|
|
307 |
|
|
308 if (f77_exception_encountered) |
|
|
309 (*current_liboctave_error_handler) |
|
|
310 ("unrecoverable error in zgemv"); |
|
|
311 } |
|
458
|
312 } |
|
|
313 |
|
1947
|
314 return retval; |
|
458
|
315 } |
|
|
316 |
|
1205
|
317 // matrix by column vector -> column vector operations |
|
|
318 |
|
|
319 ComplexColumnVector |
|
|
320 operator * (const Matrix& m, const ComplexColumnVector& a) |
|
|
321 { |
|
|
322 ComplexMatrix tmp (m); |
|
|
323 return tmp * a; |
|
|
324 } |
|
|
325 |
|
|
326 // diagonal matrix by column vector -> column vector operations |
|
|
327 |
|
|
328 ComplexColumnVector |
|
|
329 operator * (const DiagMatrix& m, const ComplexColumnVector& a) |
|
|
330 { |
|
|
331 int nr = m.rows (); |
|
|
332 int nc = m.cols (); |
|
2386
|
333 |
|
1205
|
334 int a_len = a.length (); |
|
2386
|
335 |
|
1205
|
336 if (nc != a_len) |
|
|
337 { |
|
2386
|
338 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
3585
|
339 return ComplexColumnVector (); |
|
1205
|
340 } |
|
|
341 |
|
|
342 if (nc == 0 || nr == 0) |
|
|
343 return ComplexColumnVector (0); |
|
|
344 |
|
|
345 ComplexColumnVector result (nr); |
|
|
346 |
|
|
347 for (int i = 0; i < a_len; i++) |
|
|
348 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
349 |
|
1321
|
350 for (int i = a_len; i < nr; i++) |
|
1205
|
351 result.elem (i) = 0.0; |
|
|
352 |
|
|
353 return result; |
|
|
354 } |
|
|
355 |
|
|
356 ComplexColumnVector |
|
|
357 operator * (const ComplexDiagMatrix& m, const ColumnVector& a) |
|
|
358 { |
|
|
359 int nr = m.rows (); |
|
|
360 int nc = m.cols (); |
|
2386
|
361 |
|
1205
|
362 int a_len = a.length (); |
|
2386
|
363 |
|
1205
|
364 if (nc != a_len) |
|
|
365 { |
|
2386
|
366 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
367 return ComplexColumnVector (); |
|
|
368 } |
|
|
369 |
|
|
370 if (nc == 0 || nr == 0) |
|
|
371 return ComplexColumnVector (0); |
|
|
372 |
|
|
373 ComplexColumnVector result (nr); |
|
|
374 |
|
|
375 for (int i = 0; i < a_len; i++) |
|
|
376 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
377 |
|
1321
|
378 for (int i = a_len; i < nr; i++) |
|
1205
|
379 result.elem (i) = 0.0; |
|
|
380 |
|
|
381 return result; |
|
|
382 } |
|
|
383 |
|
|
384 ComplexColumnVector |
|
|
385 operator * (const ComplexDiagMatrix& m, const ComplexColumnVector& a) |
|
|
386 { |
|
|
387 int nr = m.rows (); |
|
|
388 int nc = m.cols (); |
|
2386
|
389 |
|
1205
|
390 int a_len = a.length (); |
|
2386
|
391 |
|
1205
|
392 if (nc != a_len) |
|
|
393 { |
|
2386
|
394 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
395 return ComplexColumnVector (); |
|
|
396 } |
|
|
397 |
|
|
398 if (nc == 0 || nr == 0) |
|
|
399 return ComplexColumnVector (0); |
|
|
400 |
|
|
401 ComplexColumnVector result (nr); |
|
|
402 |
|
|
403 for (int i = 0; i < a_len; i++) |
|
|
404 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
405 |
|
1321
|
406 for (int i = a_len; i < nr; i++) |
|
1205
|
407 result.elem (i) = 0.0; |
|
|
408 |
|
|
409 return result; |
|
|
410 } |
|
|
411 |
|
458
|
412 // other operations |
|
|
413 |
|
|
414 ComplexColumnVector |
|
2676
|
415 ComplexColumnVector::map (c_c_Mapper f) const |
|
458
|
416 { |
|
2676
|
417 ComplexColumnVector b (*this); |
|
|
418 return b.apply (f); |
|
458
|
419 } |
|
|
420 |
|
2676
|
421 ColumnVector |
|
|
422 ComplexColumnVector::map (d_c_Mapper f) const |
|
458
|
423 { |
|
2676
|
424 const Complex *d = data (); |
|
|
425 |
|
|
426 int len = length (); |
|
|
427 |
|
|
428 ColumnVector retval (len); |
|
|
429 |
|
|
430 double *r = retval.fortran_vec (); |
|
|
431 |
|
|
432 for (int i = 0; i < len; i++) |
|
|
433 r[i] = f (d[i]); |
|
|
434 |
|
|
435 return retval; |
|
|
436 } |
|
|
437 |
|
|
438 ComplexColumnVector& |
|
|
439 ComplexColumnVector::apply (c_c_Mapper f) |
|
|
440 { |
|
|
441 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
442 |
|
458
|
443 for (int i = 0; i < length (); i++) |
|
2676
|
444 d[i] = f (d[i]); |
|
|
445 |
|
|
446 return *this; |
|
458
|
447 } |
|
|
448 |
|
|
449 Complex |
|
|
450 ComplexColumnVector::min (void) const |
|
|
451 { |
|
|
452 int len = length (); |
|
|
453 if (len == 0) |
|
|
454 return 0.0; |
|
|
455 |
|
|
456 Complex res = elem (0); |
|
|
457 double absres = abs (res); |
|
|
458 |
|
|
459 for (int i = 1; i < len; i++) |
|
|
460 if (abs (elem (i)) < absres) |
|
|
461 { |
|
|
462 res = elem (i); |
|
|
463 absres = abs (res); |
|
|
464 } |
|
|
465 |
|
|
466 return res; |
|
|
467 } |
|
|
468 |
|
|
469 Complex |
|
|
470 ComplexColumnVector::max (void) const |
|
|
471 { |
|
|
472 int len = length (); |
|
|
473 if (len == 0) |
|
|
474 return 0.0; |
|
|
475 |
|
|
476 Complex res = elem (0); |
|
|
477 double absres = abs (res); |
|
|
478 |
|
|
479 for (int i = 1; i < len; i++) |
|
|
480 if (abs (elem (i)) > absres) |
|
|
481 { |
|
|
482 res = elem (i); |
|
|
483 absres = abs (res); |
|
|
484 } |
|
|
485 |
|
|
486 return res; |
|
|
487 } |
|
|
488 |
|
|
489 // i/o |
|
|
490 |
|
3504
|
491 std::ostream& |
|
|
492 operator << (std::ostream& os, const ComplexColumnVector& a) |
|
458
|
493 { |
|
|
494 // int field_width = os.precision () + 7; |
|
|
495 for (int i = 0; i < a.length (); i++) |
|
|
496 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
|
|
497 return os; |
|
|
498 } |
|
|
499 |
|
3504
|
500 std::istream& |
|
|
501 operator >> (std::istream& is, ComplexColumnVector& a) |
|
458
|
502 { |
|
|
503 int len = a.length(); |
|
|
504 |
|
|
505 if (len < 1) |
|
3504
|
506 is.clear (std::ios::badbit); |
|
458
|
507 else |
|
|
508 { |
|
|
509 double tmp; |
|
|
510 for (int i = 0; i < len; i++) |
|
|
511 { |
|
|
512 is >> tmp; |
|
|
513 if (is) |
|
|
514 a.elem (i) = tmp; |
|
|
515 else |
|
|
516 break; |
|
|
517 } |
|
|
518 } |
|
532
|
519 return is; |
|
458
|
520 } |
|
|
521 |
|
|
522 /* |
|
|
523 ;;; Local Variables: *** |
|
|
524 ;;; mode: C++ *** |
|
|
525 ;;; End: *** |
|
|
526 */ |
