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