|
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 |
|
7016
|
10 Free Software Foundation; either version 3 of the License, or (at your |
|
|
11 option) any later version. |
|
458
|
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 |
|
7016
|
19 along with Octave; see the file COPYING. If not, see |
|
|
20 <http://www.gnu.org/licenses/>. |
|
458
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
1192
|
25 #include <config.h> |
|
458
|
26 #endif |
|
|
27 |
|
3503
|
28 #include <iostream> |
|
458
|
29 |
|
4669
|
30 #include "Array-util.h" |
|
1847
|
31 #include "f77-fcn.h" |
|
1368
|
32 #include "lo-error.h" |
|
458
|
33 #include "mx-base.h" |
|
|
34 #include "mx-inlines.cc" |
|
1650
|
35 #include "oct-cmplx.h" |
|
458
|
36 |
|
|
37 // Fortran functions we call. |
|
|
38 |
|
|
39 extern "C" |
|
|
40 { |
|
4552
|
41 F77_RET_T |
|
|
42 F77_FUNC (zgemv, ZGEMV) (F77_CONST_CHAR_ARG_DECL, |
|
5275
|
43 const octave_idx_type&, const octave_idx_type&, const Complex&, |
|
|
44 const Complex*, const octave_idx_type&, const Complex*, |
|
|
45 const octave_idx_type&, const Complex&, Complex*, const octave_idx_type& |
|
4552
|
46 F77_CHAR_ARG_LEN_DECL); |
|
458
|
47 } |
|
|
48 |
|
1360
|
49 // Complex Column Vector class |
|
458
|
50 |
|
|
51 ComplexColumnVector::ComplexColumnVector (const ColumnVector& a) |
|
1214
|
52 : MArray<Complex> (a.length ()) |
|
458
|
53 { |
|
5275
|
54 for (octave_idx_type i = 0; i < length (); i++) |
|
458
|
55 elem (i) = a.elem (i); |
|
|
56 } |
|
|
57 |
|
2386
|
58 bool |
|
458
|
59 ComplexColumnVector::operator == (const ComplexColumnVector& a) const |
|
|
60 { |
|
5275
|
61 octave_idx_type len = length (); |
|
458
|
62 if (len != a.length ()) |
|
|
63 return 0; |
|
3769
|
64 return mx_inline_equal (data (), a.data (), len); |
|
458
|
65 } |
|
|
66 |
|
2386
|
67 bool |
|
458
|
68 ComplexColumnVector::operator != (const ComplexColumnVector& a) const |
|
|
69 { |
|
|
70 return !(*this == a); |
|
|
71 } |
|
|
72 |
|
|
73 // destructive insert/delete/reorder operations |
|
|
74 |
|
|
75 ComplexColumnVector& |
|
5275
|
76 ComplexColumnVector::insert (const ColumnVector& a, octave_idx_type r) |
|
458
|
77 { |
|
5275
|
78 octave_idx_type a_len = a.length (); |
|
4316
|
79 |
|
1699
|
80 if (r < 0 || r + a_len > length ()) |
|
458
|
81 { |
|
|
82 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
83 return *this; |
|
|
84 } |
|
|
85 |
|
4316
|
86 if (a_len > 0) |
|
|
87 { |
|
|
88 make_unique (); |
|
|
89 |
|
5275
|
90 for (octave_idx_type i = 0; i < a_len; i++) |
|
4316
|
91 xelem (r+i) = a.elem (i); |
|
|
92 } |
|
458
|
93 |
|
|
94 return *this; |
|
|
95 } |
|
|
96 |
|
|
97 ComplexColumnVector& |
|
5275
|
98 ComplexColumnVector::insert (const ComplexColumnVector& a, octave_idx_type r) |
|
458
|
99 { |
|
5275
|
100 octave_idx_type a_len = a.length (); |
|
4316
|
101 |
|
1699
|
102 if (r < 0 || r + a_len > length ()) |
|
458
|
103 { |
|
|
104 (*current_liboctave_error_handler) ("range error for insert"); |
|
|
105 return *this; |
|
|
106 } |
|
|
107 |
|
4316
|
108 if (a_len > 0) |
|
|
109 { |
|
|
110 make_unique (); |
|
|
111 |
|
5275
|
112 for (octave_idx_type i = 0; i < a_len; i++) |
|
4316
|
113 xelem (r+i) = a.elem (i); |
|
|
114 } |
|
458
|
115 |
|
|
116 return *this; |
|
|
117 } |
|
|
118 |
|
|
119 ComplexColumnVector& |
|
|
120 ComplexColumnVector::fill (double val) |
|
|
121 { |
|
5275
|
122 octave_idx_type len = length (); |
|
4316
|
123 |
|
458
|
124 if (len > 0) |
|
4316
|
125 { |
|
|
126 make_unique (); |
|
|
127 |
|
5275
|
128 for (octave_idx_type i = 0; i < len; i++) |
|
4316
|
129 xelem (i) = val; |
|
|
130 } |
|
|
131 |
|
458
|
132 return *this; |
|
|
133 } |
|
|
134 |
|
|
135 ComplexColumnVector& |
|
|
136 ComplexColumnVector::fill (const Complex& val) |
|
|
137 { |
|
5275
|
138 octave_idx_type len = length (); |
|
4316
|
139 |
|
458
|
140 if (len > 0) |
|
4316
|
141 { |
|
|
142 make_unique (); |
|
|
143 |
|
5275
|
144 for (octave_idx_type i = 0; i < len; i++) |
|
4316
|
145 xelem (i) = val; |
|
|
146 } |
|
|
147 |
|
|
148 |
|
458
|
149 return *this; |
|
|
150 } |
|
|
151 |
|
|
152 ComplexColumnVector& |
|
5275
|
153 ComplexColumnVector::fill (double val, octave_idx_type r1, octave_idx_type r2) |
|
458
|
154 { |
|
5275
|
155 octave_idx_type len = length (); |
|
4316
|
156 |
|
458
|
157 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
158 { |
|
|
159 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
160 return *this; |
|
|
161 } |
|
|
162 |
|
5275
|
163 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
|
458
|
164 |
|
4316
|
165 if (r2 >= r1) |
|
|
166 { |
|
|
167 make_unique (); |
|
|
168 |
|
5275
|
169 for (octave_idx_type i = r1; i <= r2; i++) |
|
4316
|
170 xelem (i) = val; |
|
|
171 } |
|
458
|
172 |
|
|
173 return *this; |
|
|
174 } |
|
|
175 |
|
|
176 ComplexColumnVector& |
|
5275
|
177 ComplexColumnVector::fill (const Complex& val, octave_idx_type r1, octave_idx_type r2) |
|
458
|
178 { |
|
5275
|
179 octave_idx_type len = length (); |
|
4316
|
180 |
|
458
|
181 if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) |
|
|
182 { |
|
|
183 (*current_liboctave_error_handler) ("range error for fill"); |
|
|
184 return *this; |
|
|
185 } |
|
|
186 |
|
5275
|
187 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
|
458
|
188 |
|
4316
|
189 if (r2 >= r1) |
|
|
190 { |
|
|
191 make_unique (); |
|
|
192 |
|
5275
|
193 for (octave_idx_type i = r1; i <= r2; i++) |
|
4316
|
194 xelem (i) = val; |
|
|
195 } |
|
458
|
196 |
|
|
197 return *this; |
|
|
198 } |
|
|
199 |
|
|
200 ComplexColumnVector |
|
|
201 ComplexColumnVector::stack (const ColumnVector& a) const |
|
|
202 { |
|
5275
|
203 octave_idx_type len = length (); |
|
|
204 octave_idx_type nr_insert = len; |
|
458
|
205 ComplexColumnVector retval (len + a.length ()); |
|
|
206 retval.insert (*this, 0); |
|
|
207 retval.insert (a, nr_insert); |
|
|
208 return retval; |
|
|
209 } |
|
|
210 |
|
|
211 ComplexColumnVector |
|
|
212 ComplexColumnVector::stack (const ComplexColumnVector& a) const |
|
|
213 { |
|
5275
|
214 octave_idx_type len = length (); |
|
|
215 octave_idx_type nr_insert = len; |
|
458
|
216 ComplexColumnVector retval (len + a.length ()); |
|
|
217 retval.insert (*this, 0); |
|
|
218 retval.insert (a, nr_insert); |
|
|
219 return retval; |
|
|
220 } |
|
|
221 |
|
|
222 ComplexRowVector |
|
|
223 ComplexColumnVector::hermitian (void) const |
|
|
224 { |
|
5275
|
225 octave_idx_type len = length (); |
|
3769
|
226 return ComplexRowVector (mx_inline_conj_dup (data (), len), len); |
|
458
|
227 } |
|
|
228 |
|
|
229 ComplexRowVector |
|
|
230 ComplexColumnVector::transpose (void) const |
|
|
231 { |
|
1858
|
232 return ComplexRowVector (*this); |
|
458
|
233 } |
|
|
234 |
|
|
235 ComplexColumnVector |
|
|
236 conj (const ComplexColumnVector& a) |
|
|
237 { |
|
5275
|
238 octave_idx_type a_len = a.length (); |
|
458
|
239 ComplexColumnVector retval; |
|
|
240 if (a_len > 0) |
|
3769
|
241 retval = ComplexColumnVector (mx_inline_conj_dup (a.data (), a_len), a_len); |
|
458
|
242 return retval; |
|
|
243 } |
|
|
244 |
|
|
245 // resize is the destructive equivalent for this one |
|
|
246 |
|
|
247 ComplexColumnVector |
|
5275
|
248 ComplexColumnVector::extract (octave_idx_type r1, octave_idx_type r2) const |
|
458
|
249 { |
|
5275
|
250 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
|
458
|
251 |
|
5275
|
252 octave_idx_type new_r = r2 - r1 + 1; |
|
458
|
253 |
|
|
254 ComplexColumnVector result (new_r); |
|
|
255 |
|
5275
|
256 for (octave_idx_type i = 0; i < new_r; i++) |
|
458
|
257 result.elem (i) = elem (r1+i); |
|
|
258 |
|
|
259 return result; |
|
|
260 } |
|
|
261 |
|
4316
|
262 ComplexColumnVector |
|
5275
|
263 ComplexColumnVector::extract_n (octave_idx_type r1, octave_idx_type n) const |
|
4316
|
264 { |
|
|
265 ComplexColumnVector result (n); |
|
|
266 |
|
5275
|
267 for (octave_idx_type i = 0; i < n; i++) |
|
4316
|
268 result.elem (i) = elem (r1+i); |
|
|
269 |
|
|
270 return result; |
|
|
271 } |
|
|
272 |
|
458
|
273 // column vector by column vector -> column vector operations |
|
|
274 |
|
|
275 ComplexColumnVector& |
|
|
276 ComplexColumnVector::operator += (const ColumnVector& a) |
|
|
277 { |
|
5275
|
278 octave_idx_type len = length (); |
|
2386
|
279 |
|
5275
|
280 octave_idx_type a_len = a.length (); |
|
2386
|
281 |
|
|
282 if (len != a_len) |
|
458
|
283 { |
|
2386
|
284 gripe_nonconformant ("operator +=", len, a_len); |
|
458
|
285 return *this; |
|
|
286 } |
|
|
287 |
|
|
288 if (len == 0) |
|
|
289 return *this; |
|
|
290 |
|
|
291 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
292 |
|
3769
|
293 mx_inline_add2 (d, a.data (), len); |
|
458
|
294 return *this; |
|
|
295 } |
|
|
296 |
|
|
297 ComplexColumnVector& |
|
|
298 ComplexColumnVector::operator -= (const ColumnVector& a) |
|
|
299 { |
|
5275
|
300 octave_idx_type len = length (); |
|
2386
|
301 |
|
5275
|
302 octave_idx_type a_len = a.length (); |
|
2386
|
303 |
|
|
304 if (len != a_len) |
|
458
|
305 { |
|
2386
|
306 gripe_nonconformant ("operator -=", len, a_len); |
|
458
|
307 return *this; |
|
|
308 } |
|
|
309 |
|
|
310 if (len == 0) |
|
|
311 return *this; |
|
|
312 |
|
|
313 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
314 |
|
3769
|
315 mx_inline_subtract2 (d, a.data (), len); |
|
458
|
316 return *this; |
|
|
317 } |
|
|
318 |
|
1205
|
319 // matrix by column vector -> column vector operations |
|
|
320 |
|
|
321 ComplexColumnVector |
|
|
322 operator * (const ComplexMatrix& m, const ColumnVector& a) |
|
|
323 { |
|
|
324 ComplexColumnVector tmp (a); |
|
|
325 return m * tmp; |
|
|
326 } |
|
|
327 |
|
|
328 ComplexColumnVector |
|
|
329 operator * (const ComplexMatrix& m, const ComplexColumnVector& a) |
|
|
330 { |
|
1947
|
331 ComplexColumnVector retval; |
|
|
332 |
|
5275
|
333 octave_idx_type nr = m.rows (); |
|
|
334 octave_idx_type nc = m.cols (); |
|
1947
|
335 |
|
5275
|
336 octave_idx_type a_len = a.length (); |
|
2386
|
337 |
|
|
338 if (nc != a_len) |
|
|
339 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1947
|
340 else |
|
458
|
341 { |
|
1947
|
342 if (nc == 0 || nr == 0) |
|
|
343 retval.resize (nr, 0.0); |
|
|
344 else |
|
|
345 { |
|
5275
|
346 octave_idx_type ld = nr; |
|
1947
|
347 |
|
|
348 retval.resize (nr); |
|
|
349 Complex *y = retval.fortran_vec (); |
|
|
350 |
|
4552
|
351 F77_XFCN (zgemv, ZGEMV, (F77_CONST_CHAR_ARG2 ("N", 1), |
|
|
352 nr, nc, 1.0, m.data (), ld, |
|
|
353 a.data (), 1, 0.0, y, 1 |
|
|
354 F77_CHAR_ARG_LEN (1))); |
|
1947
|
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 { |
|
5275
|
379 octave_idx_type nr = m.rows (); |
|
|
380 octave_idx_type nc = m.cols (); |
|
2386
|
381 |
|
5275
|
382 octave_idx_type 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 |
|
5275
|
395 for (octave_idx_type i = 0; i < a_len; i++) |
|
1205
|
396 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
397 |
|
5275
|
398 for (octave_idx_type 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 { |
|
5275
|
407 octave_idx_type nr = m.rows (); |
|
|
408 octave_idx_type nc = m.cols (); |
|
2386
|
409 |
|
5275
|
410 octave_idx_type 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 |
|
5275
|
423 for (octave_idx_type i = 0; i < a_len; i++) |
|
1205
|
424 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
425 |
|
5275
|
426 for (octave_idx_type 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 { |
|
5275
|
435 octave_idx_type nr = m.rows (); |
|
|
436 octave_idx_type nc = m.cols (); |
|
2386
|
437 |
|
5275
|
438 octave_idx_type 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 |
|
5275
|
451 for (octave_idx_type i = 0; i < a_len; i++) |
|
1205
|
452 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
453 |
|
5275
|
454 for (octave_idx_type 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 |
|
5275
|
474 octave_idx_type len = length (); |
|
2676
|
475 |
|
|
476 ColumnVector retval (len); |
|
|
477 |
|
|
478 double *r = retval.fortran_vec (); |
|
|
479 |
|
5275
|
480 for (octave_idx_type i = 0; i < len; i++) |
|
2676
|
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 |
|
5275
|
491 for (octave_idx_type 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 { |
|
5275
|
500 octave_idx_type len = length (); |
|
458
|
501 if (len == 0) |
|
|
502 return 0.0; |
|
|
503 |
|
|
504 Complex res = elem (0); |
|
5260
|
505 double absres = std::abs (res); |
|
458
|
506 |
|
5275
|
507 for (octave_idx_type i = 1; i < len; i++) |
|
5260
|
508 if (std::abs (elem (i)) < absres) |
|
458
|
509 { |
|
|
510 res = elem (i); |
|
5260
|
511 absres = std::abs (res); |
|
458
|
512 } |
|
|
513 |
|
|
514 return res; |
|
|
515 } |
|
|
516 |
|
|
517 Complex |
|
|
518 ComplexColumnVector::max (void) const |
|
|
519 { |
|
5275
|
520 octave_idx_type len = length (); |
|
458
|
521 if (len == 0) |
|
|
522 return 0.0; |
|
|
523 |
|
|
524 Complex res = elem (0); |
|
5260
|
525 double absres = std::abs (res); |
|
458
|
526 |
|
5275
|
527 for (octave_idx_type i = 1; i < len; i++) |
|
5260
|
528 if (std::abs (elem (i)) > absres) |
|
458
|
529 { |
|
|
530 res = elem (i); |
|
5260
|
531 absres = std::abs (res); |
|
458
|
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; |
|
5275
|
543 for (octave_idx_type i = 0; i < a.length (); i++) |
|
458
|
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 { |
|
5275
|
551 octave_idx_type len = a.length(); |
|
458
|
552 |
|
|
553 if (len < 1) |
|
3504
|
554 is.clear (std::ios::badbit); |
|
458
|
555 else |
|
|
556 { |
|
|
557 double tmp; |
|
5275
|
558 for (octave_idx_type i = 0; i < len; i++) |
|
458
|
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 */ |
