|
1
|
1 // xdiv.cc -*- C++ -*- |
|
|
2 /* |
|
|
3 |
|
453
|
4 Copyright (C) 1992, 1993, 1994 John W. Eaton |
|
1
|
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 |
|
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
240
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include "config.h" |
|
1
|
26 #endif |
|
|
27 |
|
|
28 #include <assert.h> |
|
164
|
29 #include <Complex.h> |
|
|
30 |
|
|
31 #include "xdiv.h" |
|
453
|
32 #include "dMatrix.h" |
|
|
33 #include "CMatrix.h" |
|
164
|
34 #include "tree-const.h" |
|
1
|
35 #include "error.h" |
|
|
36 |
|
|
37 static inline int |
|
|
38 result_ok (int info, double rcond, int warn = 1) |
|
|
39 { |
|
|
40 assert (info != -1); |
|
|
41 |
|
|
42 if (info == -2) |
|
|
43 { |
|
|
44 error ("matrix singular to machine precision, rcond = %g", rcond); |
|
|
45 return 0; |
|
|
46 } |
|
|
47 else |
|
|
48 return 1; |
|
|
49 } |
|
|
50 |
|
|
51 static inline int |
|
|
52 mx_leftdiv_conform (int a_nr, int a_nc, int b_nr, int warn = 1) |
|
|
53 { |
|
|
54 if (a_nr != b_nr) |
|
|
55 { |
|
|
56 error ("number of rows must be the same for left division"); |
|
|
57 return 0; |
|
|
58 } |
|
|
59 |
|
|
60 return 1; |
|
|
61 } |
|
|
62 |
|
|
63 static inline int |
|
|
64 mx_div_conform (int b_nr, int b_nc, int a_nc, int warn = 1) |
|
|
65 { |
|
|
66 if (a_nc != b_nc) |
|
|
67 { |
|
|
68 error ("number of columns must be the same for right division"); |
|
|
69 return 0; |
|
|
70 } |
|
|
71 |
|
|
72 return 1; |
|
|
73 } |
|
|
74 |
|
767
|
75 // Right division functions. |
|
|
76 // |
|
|
77 // op2 / op1: m cm |
|
|
78 // +-- +---+----+ |
|
|
79 // matrix | 1 | 3 | |
|
|
80 // +---+----+ |
|
|
81 // complex_matrix | 2 | 4 | |
|
|
82 // +---+----+ |
|
1
|
83 |
|
767
|
84 // -*- 1 -*- |
|
1
|
85 tree_constant |
|
164
|
86 xdiv (const Matrix& a, const Matrix& b) |
|
1
|
87 { |
|
|
88 if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) |
|
|
89 return tree_constant (); |
|
|
90 |
|
|
91 Matrix atmp = a.transpose (); |
|
|
92 Matrix btmp = b.transpose (); |
|
|
93 |
|
|
94 int info; |
|
|
95 if (btmp.rows () == btmp.columns ()) |
|
|
96 { |
|
|
97 double rcond = 0.0; |
|
|
98 Matrix result = btmp.solve (atmp, info, rcond); |
|
|
99 if (result_ok (info, rcond)) |
|
|
100 return tree_constant (result.transpose ()); |
|
|
101 } |
|
|
102 |
|
|
103 int rank; |
|
|
104 Matrix result = btmp.lssolve (atmp, info, rank); |
|
|
105 |
|
|
106 return tree_constant (result.transpose ()); |
|
|
107 } |
|
|
108 |
|
767
|
109 // -*- 2 -*- |
|
1
|
110 tree_constant |
|
164
|
111 xdiv (const Matrix& a, const ComplexMatrix& b) |
|
1
|
112 { |
|
|
113 if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) |
|
|
114 return tree_constant (); |
|
|
115 |
|
|
116 Matrix atmp = a.transpose (); |
|
|
117 ComplexMatrix btmp = b.hermitian (); |
|
|
118 |
|
|
119 int info; |
|
|
120 if (btmp.rows () == btmp.columns ()) |
|
|
121 { |
|
|
122 double rcond = 0.0; |
|
|
123 ComplexMatrix result = btmp.solve (atmp, info, rcond); |
|
|
124 if (result_ok (info, rcond)) |
|
|
125 return tree_constant (result.hermitian ()); |
|
|
126 } |
|
|
127 |
|
|
128 int rank; |
|
|
129 ComplexMatrix result = btmp.lssolve (atmp, info, rank); |
|
|
130 |
|
|
131 return tree_constant (result.hermitian ()); |
|
|
132 } |
|
|
133 |
|
767
|
134 // -*- 3 -*- |
|
1
|
135 tree_constant |
|
164
|
136 xdiv (const ComplexMatrix& a, const Matrix& b) |
|
1
|
137 { |
|
|
138 if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) |
|
|
139 return tree_constant (); |
|
|
140 |
|
|
141 ComplexMatrix atmp = a.hermitian (); |
|
|
142 Matrix btmp = b.transpose (); |
|
|
143 |
|
|
144 int info; |
|
|
145 if (btmp.rows () == btmp.columns ()) |
|
|
146 { |
|
|
147 double rcond = 0.0; |
|
|
148 ComplexMatrix result = btmp.solve (atmp, info, rcond); |
|
|
149 if (result_ok (info, rcond)) |
|
|
150 return tree_constant (result.hermitian ()); |
|
|
151 } |
|
|
152 |
|
|
153 int rank; |
|
|
154 ComplexMatrix result = btmp.lssolve (atmp, info, rank); |
|
|
155 |
|
|
156 return tree_constant (result.hermitian ()); |
|
|
157 } |
|
|
158 |
|
767
|
159 // -*- 4 -*- |
|
1
|
160 tree_constant |
|
164
|
161 xdiv (const ComplexMatrix& a, const ComplexMatrix& b) |
|
1
|
162 { |
|
|
163 if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) |
|
|
164 return tree_constant (); |
|
|
165 |
|
|
166 ComplexMatrix atmp = a.hermitian (); |
|
|
167 ComplexMatrix btmp = b.hermitian (); |
|
|
168 |
|
|
169 int info; |
|
|
170 if (btmp.rows () == btmp.columns ()) |
|
|
171 { |
|
|
172 double rcond = 0.0; |
|
|
173 ComplexMatrix result = btmp.solve (atmp, info, rcond); |
|
|
174 if (result_ok (info, rcond)) |
|
|
175 return tree_constant (result.hermitian ()); |
|
|
176 } |
|
|
177 |
|
|
178 int rank; |
|
|
179 ComplexMatrix result = btmp.lssolve (atmp, info, rank); |
|
|
180 |
|
|
181 return tree_constant (result.hermitian ()); |
|
|
182 } |
|
|
183 |
|
767
|
184 // Funny element by element division operations. |
|
|
185 // |
|
|
186 // op2 \ op1: s cs |
|
|
187 // +-- +---+----+ |
|
|
188 // matrix | 1 | 3 | |
|
|
189 // +---+----+ |
|
|
190 // complex_matrix | 2 | 4 | |
|
|
191 // +---+----+ |
|
1
|
192 |
|
|
193 tree_constant |
|
164
|
194 x_el_div (double a, const Matrix& b) |
|
1
|
195 { |
|
|
196 int nr = b.rows (); |
|
|
197 int nc = b.columns (); |
|
|
198 |
|
|
199 Matrix result (nr, nc); |
|
|
200 |
|
|
201 for (int j = 0; j < nc; j++) |
|
|
202 for (int i = 0; i < nr; i++) |
|
|
203 result.elem (i, j) = a / b.elem (i, j); |
|
|
204 |
|
|
205 return tree_constant (result); |
|
|
206 } |
|
|
207 |
|
|
208 tree_constant |
|
164
|
209 x_el_div (double a, const ComplexMatrix& b) |
|
1
|
210 { |
|
|
211 int nr = b.rows (); |
|
|
212 int nc = b.columns (); |
|
|
213 |
|
|
214 ComplexMatrix result (nr, nc); |
|
|
215 |
|
|
216 for (int j = 0; j < nc; j++) |
|
|
217 for (int i = 0; i < nr; i++) |
|
|
218 result.elem (i, j) = a / b.elem (i, j); |
|
|
219 |
|
|
220 return tree_constant (result); |
|
|
221 } |
|
|
222 |
|
|
223 tree_constant |
|
164
|
224 x_el_div (const Complex a, const Matrix& b) |
|
1
|
225 { |
|
|
226 int nr = b.rows (); |
|
|
227 int nc = b.columns (); |
|
|
228 |
|
|
229 ComplexMatrix result (nr, nc); |
|
|
230 |
|
|
231 for (int j = 0; j < nc; j++) |
|
|
232 for (int i = 0; i < nr; i++) |
|
|
233 result.elem (i, j) = a / b.elem (i, j); |
|
|
234 |
|
|
235 return tree_constant (result); |
|
|
236 } |
|
|
237 |
|
|
238 tree_constant |
|
164
|
239 x_el_div (const Complex a, const ComplexMatrix& b) |
|
1
|
240 { |
|
|
241 int nr = b.rows (); |
|
|
242 int nc = b.columns (); |
|
|
243 |
|
|
244 ComplexMatrix result (nr, nc); |
|
|
245 |
|
|
246 for (int j = 0; j < nc; j++) |
|
|
247 for (int i = 0; i < nr; i++) |
|
|
248 result.elem (i, j) = a / b.elem (i, j); |
|
|
249 |
|
|
250 return tree_constant (result); |
|
|
251 } |
|
|
252 |
|
767
|
253 // Left division functions. |
|
|
254 // |
|
|
255 // op2 \ op1: m cm |
|
|
256 // +-- +---+----+ |
|
|
257 // matrix | 1 | 3 | |
|
|
258 // +---+----+ |
|
|
259 // complex_matrix | 2 | 4 | |
|
|
260 // +---+----+ |
|
1
|
261 |
|
767
|
262 // -*- 1 -*- |
|
1
|
263 tree_constant |
|
164
|
264 xleftdiv (const Matrix& a, const Matrix& b) |
|
1
|
265 { |
|
|
266 if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) |
|
|
267 return tree_constant (); |
|
|
268 |
|
|
269 int info; |
|
|
270 if (a.rows () == a.columns ()) |
|
|
271 { |
|
|
272 double rcond = 0.0; |
|
|
273 Matrix result = a.solve (b, info, rcond); |
|
|
274 if (result_ok (info, rcond)) |
|
|
275 return tree_constant (result); |
|
|
276 } |
|
|
277 |
|
|
278 int rank; |
|
|
279 Matrix result = a.lssolve (b, info, rank); |
|
|
280 |
|
|
281 return tree_constant (result); |
|
|
282 } |
|
|
283 |
|
767
|
284 // -*- 2 -*- |
|
1
|
285 tree_constant |
|
164
|
286 xleftdiv (const Matrix& a, const ComplexMatrix& b) |
|
1
|
287 { |
|
|
288 if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) |
|
|
289 return tree_constant (); |
|
|
290 |
|
|
291 int info; |
|
|
292 if (a.rows () == a.columns ()) |
|
|
293 { |
|
|
294 double rcond = 0.0; |
|
|
295 ComplexMatrix result = a.solve (b, info, rcond); |
|
|
296 if (result_ok (info, rcond)) |
|
|
297 return tree_constant (result); |
|
|
298 } |
|
|
299 |
|
|
300 int rank; |
|
|
301 ComplexMatrix result = a.lssolve (b, info, rank); |
|
|
302 |
|
|
303 return tree_constant (result); |
|
|
304 } |
|
|
305 |
|
767
|
306 // -*- 3 -*- |
|
1
|
307 tree_constant |
|
164
|
308 xleftdiv (const ComplexMatrix& a, const Matrix& b) |
|
1
|
309 { |
|
|
310 if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) |
|
|
311 return tree_constant (); |
|
|
312 |
|
|
313 int info; |
|
|
314 if (a.rows () == a.columns ()) |
|
|
315 { |
|
|
316 double rcond = 0.0; |
|
|
317 ComplexMatrix result = a.solve (b, info, rcond); |
|
|
318 if (result_ok (info, rcond)) |
|
|
319 return tree_constant (result); |
|
|
320 } |
|
|
321 |
|
|
322 int rank; |
|
|
323 ComplexMatrix result = a.lssolve (b, info, rank); |
|
|
324 |
|
|
325 return tree_constant (result); |
|
|
326 } |
|
|
327 |
|
767
|
328 // -*- 4 -*- |
|
1
|
329 tree_constant |
|
164
|
330 xleftdiv (const ComplexMatrix& a, const ComplexMatrix& b) |
|
1
|
331 { |
|
|
332 if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) |
|
|
333 return tree_constant (); |
|
|
334 |
|
|
335 int info; |
|
|
336 if (a.rows () == a.columns ()) |
|
|
337 { |
|
|
338 double rcond = 0.0; |
|
|
339 ComplexMatrix result = a.solve (b, info, rcond); |
|
|
340 if (result_ok (info, rcond)) |
|
|
341 return tree_constant (result); |
|
|
342 } |
|
|
343 |
|
|
344 int rank; |
|
|
345 ComplexMatrix result = a.lssolve (b, info, rank); |
|
|
346 |
|
|
347 return tree_constant (result); |
|
|
348 } |
|
|
349 |
|
|
350 /* |
|
|
351 ;;; Local Variables: *** |
|
|
352 ;;; mode: C++ *** |
|
|
353 ;;; page-delimiter: "^/\\*" *** |
|
|
354 ;;; End: *** |
|
|
355 */ |
