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