|
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; |
|
|
66 return equal (data (), a.data (), len); |
|
|
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 (); |
|
|
191 return ComplexRowVector (conj_dup (data (), len), len); |
|
|
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) |
|
|
206 retval = ComplexColumnVector (conj_dup (a.data (), a_len), a_len); |
|
|
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 |
|
|
247 add2 (d, a.data (), len); |
|
|
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 |
|
|
269 subtract2 (d, a.data (), len); |
|
|
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 |
|
|
317 // column vector by column vector -> column vector operations |
|
|
318 |
|
|
319 ComplexColumnVector |
|
|
320 operator + (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
321 { |
|
|
322 int len = v.length (); |
|
2386
|
323 |
|
|
324 int a_len = a.length (); |
|
|
325 |
|
|
326 if (len != a_len) |
|
458
|
327 { |
|
2386
|
328 gripe_nonconformant ("operator +", len, a_len); |
|
458
|
329 return ComplexColumnVector (); |
|
|
330 } |
|
|
331 |
|
|
332 if (len == 0) |
|
|
333 return ComplexColumnVector (0); |
|
|
334 |
|
|
335 return ComplexColumnVector (add (v.data (), a.data (), len), len); |
|
|
336 } |
|
|
337 |
|
|
338 ComplexColumnVector |
|
|
339 operator - (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
340 { |
|
|
341 int len = v.length (); |
|
2386
|
342 |
|
|
343 int a_len = a.length (); |
|
|
344 |
|
|
345 if (len != a_len) |
|
458
|
346 { |
|
2386
|
347 gripe_nonconformant ("operator -", len, a_len); |
|
458
|
348 return ComplexColumnVector (); |
|
|
349 } |
|
|
350 |
|
|
351 if (len == 0) |
|
|
352 return ComplexColumnVector (0); |
|
|
353 |
|
|
354 return ComplexColumnVector (subtract (v.data (), a.data (), len), len); |
|
|
355 } |
|
|
356 |
|
|
357 ComplexColumnVector |
|
1205
|
358 operator + (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
359 { |
|
|
360 int len = v.length (); |
|
2386
|
361 |
|
|
362 int a_len = a.length (); |
|
|
363 |
|
|
364 if (len != a_len) |
|
1205
|
365 { |
|
2386
|
366 gripe_nonconformant ("operator +", len, a_len); |
|
1205
|
367 return ComplexColumnVector (); |
|
|
368 } |
|
|
369 |
|
|
370 if (len == 0) |
|
|
371 return ComplexColumnVector (0); |
|
|
372 |
|
|
373 return ComplexColumnVector (add (v.data (), a.data (), len), len); |
|
|
374 } |
|
|
375 |
|
|
376 ComplexColumnVector |
|
|
377 operator - (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
378 { |
|
|
379 int len = v.length (); |
|
2386
|
380 |
|
|
381 int a_len = a.length (); |
|
|
382 |
|
|
383 if (len != a_len) |
|
1205
|
384 { |
|
2386
|
385 gripe_nonconformant ("operator -", len, a_len); |
|
1205
|
386 return ComplexColumnVector (); |
|
|
387 } |
|
|
388 |
|
|
389 if (len == 0) |
|
|
390 return ComplexColumnVector (0); |
|
|
391 |
|
|
392 return ComplexColumnVector (subtract (v.data (), a.data (), len), len); |
|
|
393 } |
|
|
394 |
|
|
395 ComplexColumnVector |
|
458
|
396 product (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
397 { |
|
|
398 int len = v.length (); |
|
2386
|
399 |
|
|
400 int a_len = a.length (); |
|
|
401 |
|
|
402 if (len != a_len) |
|
458
|
403 { |
|
2386
|
404 gripe_nonconformant ("product", len, a_len); |
|
458
|
405 return ComplexColumnVector (); |
|
|
406 } |
|
|
407 |
|
|
408 if (len == 0) |
|
|
409 return ComplexColumnVector (0); |
|
|
410 |
|
|
411 return ComplexColumnVector (multiply (v.data (), a.data (), len), len); |
|
|
412 } |
|
|
413 |
|
|
414 ComplexColumnVector |
|
|
415 quotient (const ComplexColumnVector& v, const ColumnVector& a) |
|
|
416 { |
|
|
417 int len = v.length (); |
|
2386
|
418 |
|
|
419 int a_len = a.length (); |
|
|
420 |
|
|
421 if (len != a_len) |
|
458
|
422 { |
|
2386
|
423 gripe_nonconformant ("quotient", len, a_len); |
|
458
|
424 return ComplexColumnVector (); |
|
|
425 } |
|
|
426 |
|
|
427 if (len == 0) |
|
|
428 return ComplexColumnVector (0); |
|
|
429 |
|
|
430 return ComplexColumnVector (divide (v.data (), a.data (), len), len); |
|
|
431 } |
|
|
432 |
|
1205
|
433 ComplexColumnVector |
|
|
434 product (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
435 { |
|
|
436 int len = v.length (); |
|
2386
|
437 |
|
|
438 int a_len = a.length (); |
|
|
439 |
|
|
440 if (len != a_len) |
|
1205
|
441 { |
|
2386
|
442 gripe_nonconformant ("product", len, a_len); |
|
3585
|
443 return ComplexColumnVector (); |
|
1205
|
444 } |
|
|
445 |
|
|
446 if (len == 0) |
|
|
447 return ComplexColumnVector (0); |
|
|
448 |
|
|
449 return ComplexColumnVector (multiply (v.data (), a.data (), len), len); |
|
|
450 } |
|
|
451 |
|
|
452 ComplexColumnVector |
|
|
453 quotient (const ColumnVector& v, const ComplexColumnVector& a) |
|
|
454 { |
|
|
455 int len = v.length (); |
|
2386
|
456 |
|
|
457 int a_len = a.length (); |
|
|
458 |
|
|
459 if (len != a_len) |
|
1205
|
460 { |
|
2386
|
461 gripe_nonconformant ("quotient", len, a_len); |
|
3585
|
462 return ComplexColumnVector (); |
|
1205
|
463 } |
|
|
464 |
|
|
465 if (len == 0) |
|
|
466 return ComplexColumnVector (0); |
|
|
467 |
|
|
468 return ComplexColumnVector (divide (v.data (), a.data (), len), len); |
|
|
469 } |
|
|
470 |
|
|
471 // matrix by column vector -> column vector operations |
|
|
472 |
|
|
473 ComplexColumnVector |
|
|
474 operator * (const Matrix& m, const ComplexColumnVector& a) |
|
|
475 { |
|
|
476 ComplexMatrix tmp (m); |
|
|
477 return tmp * a; |
|
|
478 } |
|
|
479 |
|
|
480 // diagonal matrix by column vector -> column vector operations |
|
|
481 |
|
|
482 ComplexColumnVector |
|
|
483 operator * (const DiagMatrix& m, const ComplexColumnVector& a) |
|
|
484 { |
|
|
485 int nr = m.rows (); |
|
|
486 int nc = m.cols (); |
|
2386
|
487 |
|
1205
|
488 int a_len = a.length (); |
|
2386
|
489 |
|
1205
|
490 if (nc != a_len) |
|
|
491 { |
|
2386
|
492 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
3585
|
493 return ComplexColumnVector (); |
|
1205
|
494 } |
|
|
495 |
|
|
496 if (nc == 0 || nr == 0) |
|
|
497 return ComplexColumnVector (0); |
|
|
498 |
|
|
499 ComplexColumnVector result (nr); |
|
|
500 |
|
|
501 for (int i = 0; i < a_len; i++) |
|
|
502 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
503 |
|
1321
|
504 for (int i = a_len; i < nr; i++) |
|
1205
|
505 result.elem (i) = 0.0; |
|
|
506 |
|
|
507 return result; |
|
|
508 } |
|
|
509 |
|
|
510 ComplexColumnVector |
|
|
511 operator * (const ComplexDiagMatrix& m, const ColumnVector& a) |
|
|
512 { |
|
|
513 int nr = m.rows (); |
|
|
514 int nc = m.cols (); |
|
2386
|
515 |
|
1205
|
516 int a_len = a.length (); |
|
2386
|
517 |
|
1205
|
518 if (nc != a_len) |
|
|
519 { |
|
2386
|
520 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
521 return ComplexColumnVector (); |
|
|
522 } |
|
|
523 |
|
|
524 if (nc == 0 || nr == 0) |
|
|
525 return ComplexColumnVector (0); |
|
|
526 |
|
|
527 ComplexColumnVector result (nr); |
|
|
528 |
|
|
529 for (int i = 0; i < a_len; i++) |
|
|
530 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
531 |
|
1321
|
532 for (int i = a_len; i < nr; i++) |
|
1205
|
533 result.elem (i) = 0.0; |
|
|
534 |
|
|
535 return result; |
|
|
536 } |
|
|
537 |
|
|
538 ComplexColumnVector |
|
|
539 operator * (const ComplexDiagMatrix& m, const ComplexColumnVector& a) |
|
|
540 { |
|
|
541 int nr = m.rows (); |
|
|
542 int nc = m.cols (); |
|
2386
|
543 |
|
1205
|
544 int a_len = a.length (); |
|
2386
|
545 |
|
1205
|
546 if (nc != a_len) |
|
|
547 { |
|
2386
|
548 gripe_nonconformant ("operator *", nr, nc, a_len, 1); |
|
1205
|
549 return ComplexColumnVector (); |
|
|
550 } |
|
|
551 |
|
|
552 if (nc == 0 || nr == 0) |
|
|
553 return ComplexColumnVector (0); |
|
|
554 |
|
|
555 ComplexColumnVector result (nr); |
|
|
556 |
|
|
557 for (int i = 0; i < a_len; i++) |
|
|
558 result.elem (i) = a.elem (i) * m.elem (i, i); |
|
|
559 |
|
1321
|
560 for (int i = a_len; i < nr; i++) |
|
1205
|
561 result.elem (i) = 0.0; |
|
|
562 |
|
|
563 return result; |
|
|
564 } |
|
|
565 |
|
458
|
566 // other operations |
|
|
567 |
|
|
568 ComplexColumnVector |
|
2676
|
569 ComplexColumnVector::map (c_c_Mapper f) const |
|
458
|
570 { |
|
2676
|
571 ComplexColumnVector b (*this); |
|
|
572 return b.apply (f); |
|
458
|
573 } |
|
|
574 |
|
2676
|
575 ColumnVector |
|
|
576 ComplexColumnVector::map (d_c_Mapper f) const |
|
458
|
577 { |
|
2676
|
578 const Complex *d = data (); |
|
|
579 |
|
|
580 int len = length (); |
|
|
581 |
|
|
582 ColumnVector retval (len); |
|
|
583 |
|
|
584 double *r = retval.fortran_vec (); |
|
|
585 |
|
|
586 for (int i = 0; i < len; i++) |
|
|
587 r[i] = f (d[i]); |
|
|
588 |
|
|
589 return retval; |
|
|
590 } |
|
|
591 |
|
|
592 ComplexColumnVector& |
|
|
593 ComplexColumnVector::apply (c_c_Mapper f) |
|
|
594 { |
|
|
595 Complex *d = fortran_vec (); // Ensures only one reference to my privates! |
|
|
596 |
|
458
|
597 for (int i = 0; i < length (); i++) |
|
2676
|
598 d[i] = f (d[i]); |
|
|
599 |
|
|
600 return *this; |
|
458
|
601 } |
|
|
602 |
|
|
603 Complex |
|
|
604 ComplexColumnVector::min (void) const |
|
|
605 { |
|
|
606 int len = length (); |
|
|
607 if (len == 0) |
|
|
608 return 0.0; |
|
|
609 |
|
|
610 Complex res = elem (0); |
|
|
611 double absres = abs (res); |
|
|
612 |
|
|
613 for (int i = 1; i < len; i++) |
|
|
614 if (abs (elem (i)) < absres) |
|
|
615 { |
|
|
616 res = elem (i); |
|
|
617 absres = abs (res); |
|
|
618 } |
|
|
619 |
|
|
620 return res; |
|
|
621 } |
|
|
622 |
|
|
623 Complex |
|
|
624 ComplexColumnVector::max (void) const |
|
|
625 { |
|
|
626 int len = length (); |
|
|
627 if (len == 0) |
|
|
628 return 0.0; |
|
|
629 |
|
|
630 Complex res = elem (0); |
|
|
631 double absres = abs (res); |
|
|
632 |
|
|
633 for (int i = 1; i < len; i++) |
|
|
634 if (abs (elem (i)) > absres) |
|
|
635 { |
|
|
636 res = elem (i); |
|
|
637 absres = abs (res); |
|
|
638 } |
|
|
639 |
|
|
640 return res; |
|
|
641 } |
|
|
642 |
|
|
643 // i/o |
|
|
644 |
|
3504
|
645 std::ostream& |
|
|
646 operator << (std::ostream& os, const ComplexColumnVector& a) |
|
458
|
647 { |
|
|
648 // int field_width = os.precision () + 7; |
|
|
649 for (int i = 0; i < a.length (); i++) |
|
|
650 os << /* setw (field_width) << */ a.elem (i) << "\n"; |
|
|
651 return os; |
|
|
652 } |
|
|
653 |
|
3504
|
654 std::istream& |
|
|
655 operator >> (std::istream& is, ComplexColumnVector& a) |
|
458
|
656 { |
|
|
657 int len = a.length(); |
|
|
658 |
|
|
659 if (len < 1) |
|
3504
|
660 is.clear (std::ios::badbit); |
|
458
|
661 else |
|
|
662 { |
|
|
663 double tmp; |
|
|
664 for (int i = 0; i < len; i++) |
|
|
665 { |
|
|
666 is >> tmp; |
|
|
667 if (is) |
|
|
668 a.elem (i) = tmp; |
|
|
669 else |
|
|
670 break; |
|
|
671 } |
|
|
672 } |
|
532
|
673 return is; |
|
458
|
674 } |
|
|
675 |
|
|
676 /* |
|
|
677 ;;; Local Variables: *** |
|
|
678 ;;; mode: C++ *** |
|
|
679 ;;; End: *** |
|
|
680 */ |
