Mercurial > hg > octave-nkf
annotate liboctave/CDiagMatrix.cc @ 10396:a0b51ac0f88a
optimize accumdim with summation
| author | Jaroslav Hajek <highegg@gmail.com> |
|---|---|
| date | Fri, 05 Mar 2010 12:31:30 +0100 |
| parents | a0728e81ed25 |
| children | fd0a3ac60b0e |
| rev | line source |
|---|---|
| 1993 | 1 // DiagMatrix manipulations. |
| 458 | 2 /* |
| 3 | |
| 7017 | 4 Copyright (C) 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003, 2004, |
| 8920 | 5 2005, 2007, 2008, 2009 John W. Eaton |
|
9601
a9b37bae1802
add a couple of missing copyright statements
Jaroslav Hajek <highegg@gmail.com>
parents:
9550
diff
changeset
|
6 Copyright (C) 2009 VZLU Prague |
| 458 | 7 |
| 8 This file is part of Octave. | |
| 9 | |
| 10 Octave is free software; you can redistribute it and/or modify it | |
| 11 under the terms of the GNU General Public License as published by the | |
| 7016 | 12 Free Software Foundation; either version 3 of the License, or (at your |
| 13 option) any later version. | |
| 458 | 14 |
| 15 Octave is distributed in the hope that it will be useful, but WITHOUT | |
| 16 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 18 for more details. | |
| 19 | |
| 20 You should have received a copy of the GNU General Public License | |
| 7016 | 21 along with Octave; see the file COPYING. If not, see |
| 22 <http://www.gnu.org/licenses/>. | |
| 458 | 23 |
| 24 */ | |
| 25 | |
| 26 #ifdef HAVE_CONFIG_H | |
| 1192 | 27 #include <config.h> |
| 458 | 28 #endif |
| 29 | |
| 3503 | 30 #include <iostream> |
| 458 | 31 |
| 4669 | 32 #include "Array-util.h" |
| 1368 | 33 #include "lo-error.h" |
|
9003
0631d397fbe0
replace lo_ieee_isnan by xisnan, add missing includes
Jaroslav Hajek <highegg@gmail.com>
parents:
8920
diff
changeset
|
34 #include "lo-ieee.h" |
| 458 | 35 #include "mx-base.h" |
| 36 #include "mx-inlines.cc" | |
| 1650 | 37 #include "oct-cmplx.h" |
| 458 | 38 |
| 1360 | 39 // Complex Diagonal Matrix class |
| 458 | 40 |
| 41 ComplexDiagMatrix::ComplexDiagMatrix (const DiagMatrix& a) | |
| 1989 | 42 : MDiagArray2<Complex> (a.rows (), a.cols ()) |
| 458 | 43 { |
| 5275 | 44 for (octave_idx_type i = 0; i < length (); i++) |
| 458 | 45 elem (i, i) = a.elem (i, i); |
| 46 } | |
| 47 | |
| 2386 | 48 bool |
| 458 | 49 ComplexDiagMatrix::operator == (const ComplexDiagMatrix& a) const |
| 50 { | |
| 51 if (rows () != a.rows () || cols () != a.cols ()) | |
| 52 return 0; | |
| 53 | |
|
9550
3d6a9aea2aea
refactor binary & bool ops in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9003
diff
changeset
|
54 return mx_inline_equal (length (), data (), a.data ()); |
| 458 | 55 } |
| 56 | |
| 2386 | 57 bool |
| 458 | 58 ComplexDiagMatrix::operator != (const ComplexDiagMatrix& a) const |
| 59 { | |
| 60 return !(*this == a); | |
| 61 } | |
| 62 | |
| 63 ComplexDiagMatrix& | |
| 64 ComplexDiagMatrix::fill (double val) | |
| 65 { | |
| 5275 | 66 for (octave_idx_type i = 0; i < length (); i++) |
| 458 | 67 elem (i, i) = val; |
| 68 return *this; | |
| 69 } | |
| 70 | |
| 71 ComplexDiagMatrix& | |
| 72 ComplexDiagMatrix::fill (const Complex& val) | |
| 73 { | |
| 5275 | 74 for (octave_idx_type i = 0; i < length (); i++) |
| 458 | 75 elem (i, i) = val; |
| 76 return *this; | |
| 77 } | |
| 78 | |
| 79 ComplexDiagMatrix& | |
| 5275 | 80 ComplexDiagMatrix::fill (double val, octave_idx_type beg, octave_idx_type end) |
| 458 | 81 { |
| 82 if (beg < 0 || end >= length () || end < beg) | |
| 83 { | |
| 84 (*current_liboctave_error_handler) ("range error for fill"); | |
| 85 return *this; | |
| 86 } | |
| 87 | |
| 5275 | 88 for (octave_idx_type i = beg; i <= end; i++) |
| 458 | 89 elem (i, i) = val; |
| 90 | |
| 91 return *this; | |
| 92 } | |
| 93 | |
| 94 ComplexDiagMatrix& | |
| 5275 | 95 ComplexDiagMatrix::fill (const Complex& val, octave_idx_type beg, octave_idx_type end) |
| 458 | 96 { |
| 97 if (beg < 0 || end >= length () || end < beg) | |
| 98 { | |
| 99 (*current_liboctave_error_handler) ("range error for fill"); | |
| 100 return *this; | |
| 101 } | |
| 102 | |
| 5275 | 103 for (octave_idx_type i = beg; i <= end; i++) |
| 458 | 104 elem (i, i) = val; |
| 105 | |
| 106 return *this; | |
| 107 } | |
| 108 | |
| 109 ComplexDiagMatrix& | |
| 110 ComplexDiagMatrix::fill (const ColumnVector& a) | |
| 111 { | |
| 5275 | 112 octave_idx_type len = length (); |
| 458 | 113 if (a.length () != len) |
| 114 { | |
| 115 (*current_liboctave_error_handler) ("range error for fill"); | |
| 116 return *this; | |
| 117 } | |
| 118 | |
| 5275 | 119 for (octave_idx_type i = 0; i < len; i++) |
| 458 | 120 elem (i, i) = a.elem (i); |
| 121 | |
| 122 return *this; | |
| 123 } | |
| 124 | |
| 125 ComplexDiagMatrix& | |
| 126 ComplexDiagMatrix::fill (const ComplexColumnVector& a) | |
| 127 { | |
| 5275 | 128 octave_idx_type len = length (); |
| 458 | 129 if (a.length () != len) |
| 130 { | |
| 131 (*current_liboctave_error_handler) ("range error for fill"); | |
| 132 return *this; | |
| 133 } | |
| 134 | |
| 5275 | 135 for (octave_idx_type i = 0; i < len; i++) |
| 458 | 136 elem (i, i) = a.elem (i); |
| 137 | |
| 138 return *this; | |
| 139 } | |
| 140 | |
| 141 ComplexDiagMatrix& | |
| 142 ComplexDiagMatrix::fill (const RowVector& a) | |
| 143 { | |
| 5275 | 144 octave_idx_type len = length (); |
| 458 | 145 if (a.length () != len) |
| 146 { | |
| 147 (*current_liboctave_error_handler) ("range error for fill"); | |
| 148 return *this; | |
| 149 } | |
| 150 | |
| 5275 | 151 for (octave_idx_type i = 0; i < len; i++) |
| 458 | 152 elem (i, i) = a.elem (i); |
| 153 | |
| 154 return *this; | |
| 155 } | |
| 156 | |
| 157 ComplexDiagMatrix& | |
| 158 ComplexDiagMatrix::fill (const ComplexRowVector& a) | |
| 159 { | |
| 5275 | 160 octave_idx_type len = length (); |
| 458 | 161 if (a.length () != len) |
| 162 { | |
| 163 (*current_liboctave_error_handler) ("range error for fill"); | |
| 164 return *this; | |
| 165 } | |
| 166 | |
| 5275 | 167 for (octave_idx_type i = 0; i < len; i++) |
| 458 | 168 elem (i, i) = a.elem (i); |
| 169 | |
| 170 return *this; | |
| 171 } | |
| 172 | |
| 173 ComplexDiagMatrix& | |
| 5275 | 174 ComplexDiagMatrix::fill (const ColumnVector& a, octave_idx_type beg) |
| 458 | 175 { |
| 5275 | 176 octave_idx_type a_len = a.length (); |
| 458 | 177 if (beg < 0 || beg + a_len >= length ()) |
| 178 { | |
| 179 (*current_liboctave_error_handler) ("range error for fill"); | |
| 180 return *this; | |
| 181 } | |
| 182 | |
| 5275 | 183 for (octave_idx_type i = 0; i < a_len; i++) |
| 458 | 184 elem (i+beg, i+beg) = a.elem (i); |
| 185 | |
| 186 return *this; | |
| 187 } | |
| 188 | |
| 189 ComplexDiagMatrix& | |
| 5275 | 190 ComplexDiagMatrix::fill (const ComplexColumnVector& a, octave_idx_type beg) |
| 458 | 191 { |
| 5275 | 192 octave_idx_type a_len = a.length (); |
| 458 | 193 if (beg < 0 || beg + a_len >= length ()) |
| 194 { | |
| 195 (*current_liboctave_error_handler) ("range error for fill"); | |
| 196 return *this; | |
| 197 } | |
| 198 | |
| 5275 | 199 for (octave_idx_type i = 0; i < a_len; i++) |
| 458 | 200 elem (i+beg, i+beg) = a.elem (i); |
| 201 | |
| 202 return *this; | |
| 203 } | |
| 204 | |
| 205 ComplexDiagMatrix& | |
| 5275 | 206 ComplexDiagMatrix::fill (const RowVector& a, octave_idx_type beg) |
| 458 | 207 { |
| 5275 | 208 octave_idx_type a_len = a.length (); |
| 458 | 209 if (beg < 0 || beg + a_len >= length ()) |
| 210 { | |
| 211 (*current_liboctave_error_handler) ("range error for fill"); | |
| 212 return *this; | |
| 213 } | |
| 214 | |
| 5275 | 215 for (octave_idx_type i = 0; i < a_len; i++) |
| 458 | 216 elem (i+beg, i+beg) = a.elem (i); |
| 217 | |
| 218 return *this; | |
| 219 } | |
| 220 | |
| 221 ComplexDiagMatrix& | |
| 5275 | 222 ComplexDiagMatrix::fill (const ComplexRowVector& a, octave_idx_type beg) |
| 458 | 223 { |
| 5275 | 224 octave_idx_type a_len = a.length (); |
| 458 | 225 if (beg < 0 || beg + a_len >= length ()) |
| 226 { | |
| 227 (*current_liboctave_error_handler) ("range error for fill"); | |
| 228 return *this; | |
| 229 } | |
| 230 | |
| 5275 | 231 for (octave_idx_type i = 0; i < a_len; i++) |
| 458 | 232 elem (i+beg, i+beg) = a.elem (i); |
| 233 | |
| 234 return *this; | |
| 235 } | |
| 236 | |
|
8366
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
237 DiagMatrix |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
238 ComplexDiagMatrix::abs (void) const |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
239 { |
|
10363
a0728e81ed25
improve diag matrix interface & implementation
Jaroslav Hajek <highegg@gmail.com>
parents:
10314
diff
changeset
|
240 return DiagMatrix (diag ().abs (), rows (), columns ()); |
|
8366
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
241 } |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
242 |
| 458 | 243 ComplexDiagMatrix |
| 244 conj (const ComplexDiagMatrix& a) | |
| 245 { | |
|
10363
a0728e81ed25
improve diag matrix interface & implementation
Jaroslav Hajek <highegg@gmail.com>
parents:
10314
diff
changeset
|
246 return ComplexDiagMatrix (conj (a.diag ()), a.rows (), a.columns ()); |
| 458 | 247 } |
| 248 | |
| 249 // resize is the destructive analog for this one | |
| 250 | |
| 251 ComplexMatrix | |
| 5275 | 252 ComplexDiagMatrix::extract (octave_idx_type r1, octave_idx_type c1, octave_idx_type r2, octave_idx_type c2) const |
| 458 | 253 { |
| 5275 | 254 if (r1 > r2) { octave_idx_type tmp = r1; r1 = r2; r2 = tmp; } |
| 255 if (c1 > c2) { octave_idx_type tmp = c1; c1 = c2; c2 = tmp; } | |
| 458 | 256 |
| 5275 | 257 octave_idx_type new_r = r2 - r1 + 1; |
| 258 octave_idx_type new_c = c2 - c1 + 1; | |
| 458 | 259 |
| 260 ComplexMatrix result (new_r, new_c); | |
| 261 | |
| 5275 | 262 for (octave_idx_type j = 0; j < new_c; j++) |
| 263 for (octave_idx_type i = 0; i < new_r; i++) | |
| 458 | 264 result.elem (i, j) = elem (r1+i, c1+j); |
| 265 | |
| 266 return result; | |
| 267 } | |
| 268 | |
| 269 // extract row or column i. | |
| 270 | |
| 271 ComplexRowVector | |
| 5275 | 272 ComplexDiagMatrix::row (octave_idx_type i) const |
| 458 | 273 { |
| 5275 | 274 octave_idx_type r = rows (); |
| 275 octave_idx_type c = cols (); | |
| 3504 | 276 if (i < 0 || i >= r) |
| 458 | 277 { |
| 278 (*current_liboctave_error_handler) ("invalid row selection"); | |
| 3585 | 279 return ComplexRowVector (); |
| 458 | 280 } |
| 281 | |
| 3504 | 282 ComplexRowVector retval (c, 0.0); |
| 283 if (r <= c || (r > c && i < c)) | |
| 458 | 284 retval.elem (i) = elem (i, i); |
| 285 | |
| 286 return retval; | |
| 287 } | |
| 288 | |
| 289 ComplexRowVector | |
| 290 ComplexDiagMatrix::row (char *s) const | |
| 291 { | |
| 533 | 292 if (! s) |
| 458 | 293 { |
| 294 (*current_liboctave_error_handler) ("invalid row selection"); | |
| 295 return ComplexRowVector (); | |
| 296 } | |
| 297 | |
| 298 char c = *s; | |
| 299 if (c == 'f' || c == 'F') | |
| 5275 | 300 return row (static_cast<octave_idx_type>(0)); |
| 458 | 301 else if (c == 'l' || c == 'L') |
| 302 return row (rows () - 1); | |
| 303 else | |
| 304 { | |
| 305 (*current_liboctave_error_handler) ("invalid row selection"); | |
| 306 return ComplexRowVector (); | |
| 307 } | |
| 308 } | |
| 309 | |
| 310 ComplexColumnVector | |
| 5275 | 311 ComplexDiagMatrix::column (octave_idx_type i) const |
| 458 | 312 { |
| 5275 | 313 octave_idx_type r = rows (); |
| 314 octave_idx_type c = cols (); | |
| 3504 | 315 if (i < 0 || i >= c) |
| 458 | 316 { |
| 317 (*current_liboctave_error_handler) ("invalid column selection"); | |
| 3585 | 318 return ComplexColumnVector (); |
| 458 | 319 } |
| 320 | |
| 3504 | 321 ComplexColumnVector retval (r, 0.0); |
| 322 if (r >= c || (r < c && i < r)) | |
| 458 | 323 retval.elem (i) = elem (i, i); |
| 324 | |
| 325 return retval; | |
| 326 } | |
| 327 | |
| 328 ComplexColumnVector | |
| 329 ComplexDiagMatrix::column (char *s) const | |
| 330 { | |
| 533 | 331 if (! s) |
| 458 | 332 { |
| 333 (*current_liboctave_error_handler) ("invalid column selection"); | |
| 3585 | 334 return ComplexColumnVector (); |
| 458 | 335 } |
| 336 | |
| 337 char c = *s; | |
| 338 if (c == 'f' || c == 'F') | |
| 5275 | 339 return column (static_cast<octave_idx_type>(0)); |
| 458 | 340 else if (c == 'l' || c == 'L') |
| 341 return column (cols () - 1); | |
| 342 else | |
| 343 { | |
| 344 (*current_liboctave_error_handler) ("invalid column selection"); | |
| 3585 | 345 return ComplexColumnVector (); |
| 458 | 346 } |
| 347 } | |
| 348 | |
| 349 ComplexDiagMatrix | |
| 350 ComplexDiagMatrix::inverse (void) const | |
| 351 { | |
| 8811 | 352 octave_idx_type info; |
| 458 | 353 return inverse (info); |
| 354 } | |
| 355 | |
| 356 ComplexDiagMatrix | |
| 8811 | 357 ComplexDiagMatrix::inverse (octave_idx_type& info) const |
| 458 | 358 { |
| 5275 | 359 octave_idx_type r = rows (); |
| 360 octave_idx_type c = cols (); | |
| 3504 | 361 if (r != c) |
| 458 | 362 { |
| 363 (*current_liboctave_error_handler) ("inverse requires square matrix"); | |
| 3585 | 364 return ComplexDiagMatrix (); |
| 458 | 365 } |
| 366 | |
| 3504 | 367 ComplexDiagMatrix retval (r, c); |
| 458 | 368 |
| 369 info = 0; | |
| 5275 | 370 for (octave_idx_type i = 0; i < length (); i++) |
| 458 | 371 { |
| 372 if (elem (i, i) == 0.0) | |
|
10314
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
373 { |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
374 info = -1; |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
375 return *this; |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
376 } |
| 458 | 377 else |
|
10314
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
378 retval.elem (i, i) = 1.0 / elem (i, i); |
| 458 | 379 } |
| 380 | |
| 1627 | 381 return retval; |
| 458 | 382 } |
| 383 | |
|
8840
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
384 ComplexDiagMatrix |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
385 ComplexDiagMatrix::pseudo_inverse (void) const |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
386 { |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
387 octave_idx_type r = rows (); |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
388 octave_idx_type c = cols (); |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
389 octave_idx_type len = length (); |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
390 |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
391 ComplexDiagMatrix retval (c, r); |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
392 |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
393 for (octave_idx_type i = 0; i < len; i++) |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
394 { |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
395 if (elem (i, i) != 0.0) |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
396 retval.elem (i, i) = 1.0 / elem (i, i); |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
397 else |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
398 retval.elem (i, i) = 0.0; |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
399 } |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
400 |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
401 return retval; |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
402 } |
|
c690e3772583
support diagonal matrices in pinv
Jaroslav Hajek <highegg@gmail.com>
parents:
8811
diff
changeset
|
403 |
|
8366
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
404 bool |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
405 ComplexDiagMatrix::all_elements_are_real (void) const |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
406 { |
|
9825
7483fe200fab
narrow complex values with negative zero imaginary parts
Jaroslav Hajek <highegg@gmail.com>
parents:
9812
diff
changeset
|
407 return mx_inline_all_real (length (), data ()); |
|
8366
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
408 } |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
409 |
| 458 | 410 // diagonal matrix by diagonal matrix -> diagonal matrix operations |
| 411 | |
| 412 ComplexDiagMatrix& | |
| 413 ComplexDiagMatrix::operator += (const DiagMatrix& a) | |
| 414 { | |
| 5275 | 415 octave_idx_type r = rows (); |
| 416 octave_idx_type c = cols (); | |
| 2386 | 417 |
| 5275 | 418 octave_idx_type a_nr = a.rows (); |
| 419 octave_idx_type a_nc = a.cols (); | |
| 2386 | 420 |
| 3504 | 421 if (r != a_nr || c != a_nc) |
| 458 | 422 { |
| 3504 | 423 gripe_nonconformant ("operator +=", r, c, a_nr, a_nc); |
| 458 | 424 return *this; |
| 425 } | |
| 426 | |
| 3504 | 427 if (r == 0 || c == 0) |
| 458 | 428 return *this; |
| 429 | |
| 430 Complex *d = fortran_vec (); // Ensures only one reference to my privates! | |
| 431 | |
|
9550
3d6a9aea2aea
refactor binary & bool ops in liboctave
Jaroslav Hajek <highegg@gmail.com>
parents:
9003
diff
changeset
|
432 mx_inline_add2 (length (), d, a.data ()); |
| 458 | 433 return *this; |
| 434 } | |
| 435 | |
| 436 ComplexDiagMatrix | |
| 437 operator * (const ComplexDiagMatrix& a, const DiagMatrix& b) | |
| 438 { | |
| 5275 | 439 octave_idx_type a_nr = a.rows (); |
| 440 octave_idx_type a_nc = a.cols (); | |
| 2386 | 441 |
| 5275 | 442 octave_idx_type b_nr = b.rows (); |
| 443 octave_idx_type b_nc = b.cols (); | |
| 2386 | 444 |
| 3504 | 445 if (a_nc != b_nr) |
|
9698
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
446 gripe_nonconformant ("operator *", a_nr, a_nc, b_nr, b_nc); |
| 458 | 447 |
| 3504 | 448 ComplexDiagMatrix c (a_nr, b_nc); |
| 458 | 449 |
|
9698
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
450 octave_idx_type len = c.length (), lenm = len < a_nc ? len : a_nc; |
| 458 | 451 |
|
9698
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
452 for (octave_idx_type i = 0; i < lenm; i++) |
|
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
453 c.dgxelem (i) = a.dgelem (i) * b.dgelem (i); |
|
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
454 for (octave_idx_type i = lenm; i < len; i++) |
|
7c6d5d8c8d37
fix diag*diag multiplication
Jaroslav Hajek <highegg@gmail.com>
parents:
9601
diff
changeset
|
455 c.dgxelem (i) = 0.0; |
| 458 | 456 |
| 457 return c; | |
| 458 } | |
| 459 | |
| 460 ComplexDiagMatrix | |
| 1205 | 461 operator * (const DiagMatrix& a, const ComplexDiagMatrix& b) |
| 462 { | |
| 5275 | 463 octave_idx_type a_nr = a.rows (); |
| 464 octave_idx_type a_nc = a.cols (); | |
| 2386 | 465 |
| 5275 | 466 octave_idx_type b_nr = b.rows (); |
| 467 octave_idx_type b_nc = b.cols (); | |
| 2386 | 468 |
| 3504 | 469 if (a_nc != b_nr) |
| 1205 | 470 { |
| 3504 | 471 gripe_nonconformant ("operator *", a_nr, a_nc, b_nr, b_nc); |
| 1205 | 472 return ComplexDiagMatrix (); |
| 473 } | |
| 474 | |
| 3504 | 475 if (a_nr == 0 || a_nc == 0 || b_nc == 0) |
| 476 return ComplexDiagMatrix (a_nr, a_nc, 0.0); | |
| 1205 | 477 |
| 3504 | 478 ComplexDiagMatrix c (a_nr, b_nc); |
| 1205 | 479 |
| 5275 | 480 octave_idx_type len = a_nr < b_nc ? a_nr : b_nc; |
| 1205 | 481 |
| 5275 | 482 for (octave_idx_type i = 0; i < len; i++) |
| 1205 | 483 { |
| 484 double a_element = a.elem (i, i); | |
| 485 Complex b_element = b.elem (i, i); | |
| 486 | |
|
8366
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
487 c.elem (i, i) = a_element * b_element; |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
488 } |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
489 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
490 return c; |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
491 } |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
492 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
493 ComplexDiagMatrix |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
494 operator * (const ComplexDiagMatrix& a, const ComplexDiagMatrix& b) |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
495 { |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
496 octave_idx_type a_nr = a.rows (); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
497 octave_idx_type a_nc = a.cols (); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
498 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
499 octave_idx_type b_nr = b.rows (); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
500 octave_idx_type b_nc = b.cols (); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
501 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
502 if (a_nc != b_nr) |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
503 { |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
504 gripe_nonconformant ("operator *", a_nr, a_nc, b_nr, b_nc); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
505 return ComplexDiagMatrix (); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
506 } |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
507 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
508 if (a_nr == 0 || a_nc == 0 || b_nc == 0) |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
509 return ComplexDiagMatrix (a_nr, a_nc, 0.0); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
510 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
511 ComplexDiagMatrix c (a_nr, b_nc); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
512 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
513 octave_idx_type len = a_nr < b_nc ? a_nr : b_nc; |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
514 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
515 for (octave_idx_type i = 0; i < len; i++) |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
516 { |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
517 Complex a_element = a.elem (i, i); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
518 Complex b_element = b.elem (i, i); |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
519 |
|
8b1a2555c4e2
implement diagonal matrix objects
Jaroslav Hajek <highegg@gmail.com>
parents:
7789
diff
changeset
|
520 c.elem (i, i) = a_element * b_element; |
| 1205 | 521 } |
| 522 | |
| 523 return c; | |
| 524 } | |
| 525 | |
| 458 | 526 // other operations |
| 527 | |
|
8371
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
528 ComplexDET |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
529 ComplexDiagMatrix::determinant (void) const |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
530 { |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
531 ComplexDET det (1.0); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
532 if (rows () != cols ()) |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
533 { |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
534 (*current_liboctave_error_handler) ("determinant requires square matrix"); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
535 det = ComplexDET (0.0); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
536 } |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
537 else |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
538 { |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
539 octave_idx_type len = length (); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
540 for (octave_idx_type i = 0; i < len; i++) |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
541 det *= elem (i, i); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
542 } |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
543 |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
544 return det; |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
545 } |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
546 |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
547 double |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
548 ComplexDiagMatrix::rcond (void) const |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
549 { |
|
9812
f80c566bc751
improve unary mapper system
Jaroslav Hajek <highegg@gmail.com>
parents:
9698
diff
changeset
|
550 ColumnVector av = diag (0).map<double> (std::abs); |
|
8371
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
551 double amx = av.max (), amn = av.min (); |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
552 return amx == 0 ? 0.0 : amn / amx; |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
553 } |
|
c3f7e2549abb
make det & inv aware of diagonal & permutation matrices
Jaroslav Hajek <highegg@gmail.com>
parents:
8366
diff
changeset
|
554 |
| 458 | 555 // i/o |
| 556 | |
| 3504 | 557 std::ostream& |
| 558 operator << (std::ostream& os, const ComplexDiagMatrix& a) | |
| 458 | 559 { |
| 560 Complex ZERO (0.0); | |
| 561 // int field_width = os.precision () + 7; | |
| 5275 | 562 for (octave_idx_type i = 0; i < a.rows (); i++) |
| 458 | 563 { |
| 5275 | 564 for (octave_idx_type j = 0; j < a.cols (); j++) |
|
10314
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
565 { |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
566 if (i == j) |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
567 os << " " /* setw (field_width) */ << a.elem (i, i); |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
568 else |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
569 os << " " /* setw (field_width) */ << ZERO; |
|
07ebe522dac2
untabify liboctave C++ sources
John W. Eaton <jwe@octave.org>
parents:
10158
diff
changeset
|
570 } |
| 458 | 571 os << "\n"; |
| 572 } | |
| 573 return os; | |
| 574 } |