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