|
5610
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2005 David Bateman |
|
|
4 |
|
|
5 Octave is free software; you can redistribute it and/or modify it |
|
|
6 under the terms of the GNU General Public License as published by the |
|
|
7 Free Software Foundation; either version 2, or (at your option) any |
|
|
8 later version. |
|
|
9 |
|
|
10 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
11 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
12 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
13 for more details. |
|
|
14 |
|
|
15 You should have received a copy of the GNU General Public License |
|
|
16 along with this program; see the file COPYING. If not, write to the |
|
|
17 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
|
|
18 Boston, MA 02110-1301, USA. |
|
|
19 |
|
|
20 */ |
|
|
21 |
|
|
22 #if !defined (sparse_cmplx_QR_h) |
|
|
23 #define sparse_cmplx_QR_h 1 |
|
|
24 |
|
|
25 #include <iostream> |
|
|
26 |
|
|
27 #include "dMatrix.h" |
|
|
28 #include "CMatrix.h" |
|
|
29 #include "dSparse.h" |
|
|
30 #include "CSparse.h" |
|
|
31 #include "oct-sparse.h" |
|
|
32 |
|
|
33 #ifdef IDX_TYPE_LONG |
|
5648
|
34 #define CXSPARSE_ZNAME(name) cs_cl ## name |
|
5610
|
35 #else |
|
5648
|
36 #define CXSPARSE_ZNAME(name) cs_ci ## name |
|
5610
|
37 #endif |
|
|
38 |
|
|
39 class |
|
|
40 SparseComplexQR |
|
|
41 { |
|
|
42 protected: |
|
|
43 class SparseComplexQR_rep |
|
|
44 { |
|
|
45 public: |
|
|
46 SparseComplexQR_rep (const SparseComplexMatrix& a, int order); |
|
|
47 |
|
|
48 ~SparseComplexQR_rep (void); |
|
|
49 #ifdef HAVE_CXSPARSE |
|
|
50 bool ok (void) const { return (N && S); } |
|
|
51 #else |
|
|
52 bool ok (void) const { return false; } |
|
|
53 #endif |
|
|
54 SparseComplexMatrix V (void) const; |
|
|
55 |
|
|
56 ColumnVector Pinv (void) const; |
|
|
57 |
|
|
58 ColumnVector P (void) const; |
|
|
59 |
|
|
60 SparseComplexMatrix R (const bool econ) const; |
|
|
61 |
|
|
62 ComplexMatrix C (const ComplexMatrix &b) const; |
|
|
63 |
|
|
64 int count; |
|
|
65 |
|
|
66 octave_idx_type nrows; |
|
|
67 #ifdef HAVE_CXSPARSE |
|
5648
|
68 CXSPARSE_ZNAME (s) *S; |
|
5610
|
69 |
|
5648
|
70 CXSPARSE_ZNAME (n) *N; |
|
5610
|
71 #endif |
|
|
72 }; |
|
|
73 private: |
|
|
74 SparseComplexQR_rep *rep; |
|
|
75 |
|
|
76 public: |
|
|
77 SparseComplexQR (void) : |
|
5792
|
78 rep (new SparseComplexQR_rep (SparseComplexMatrix(), 0)) { } |
|
5610
|
79 |
|
5792
|
80 SparseComplexQR (const SparseComplexMatrix& a, int order = 0) : |
|
5610
|
81 rep (new SparseComplexQR_rep (a, order)) { } |
|
|
82 |
|
|
83 SparseComplexQR (const SparseComplexQR& a) : rep (a.rep) { rep->count++; } |
|
|
84 |
|
|
85 ~SparseComplexQR (void) |
|
|
86 { |
|
|
87 if (--rep->count <= 0) |
|
|
88 delete rep; |
|
|
89 } |
|
|
90 |
|
|
91 SparseComplexQR& operator = (const SparseComplexQR& a) |
|
|
92 { |
|
|
93 if (this != &a) |
|
|
94 { |
|
|
95 if (--rep->count <= 0) |
|
|
96 delete rep; |
|
|
97 |
|
|
98 rep = a.rep; |
|
|
99 rep->count++; |
|
|
100 } |
|
|
101 return *this; |
|
|
102 } |
|
|
103 |
|
|
104 bool ok (void) const { return rep->ok(); } |
|
|
105 |
|
|
106 SparseComplexMatrix V (void) const { return rep->V(); } |
|
|
107 |
|
|
108 ColumnVector Pinv (void) const { return rep->P(); } |
|
|
109 |
|
|
110 ColumnVector P (void) const { return rep->P(); } |
|
|
111 |
|
|
112 SparseComplexMatrix R (const bool econ = false) const |
|
|
113 { return rep->R(econ); } |
|
|
114 |
|
|
115 ComplexMatrix C (const ComplexMatrix &b) const { return rep->C(b); } |
|
|
116 |
|
|
117 friend ComplexMatrix qrsolve (const SparseComplexMatrix &a, const Matrix &b, |
|
|
118 octave_idx_type &info); |
|
|
119 |
|
|
120 friend SparseComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
121 const SparseMatrix &b, |
|
|
122 octave_idx_type &info); |
|
|
123 |
|
|
124 friend ComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
125 const ComplexMatrix &b, |
|
|
126 octave_idx_type &info); |
|
|
127 |
|
|
128 friend SparseComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
129 const SparseComplexMatrix &b, |
|
|
130 octave_idx_type &info); |
|
|
131 |
|
|
132 protected: |
|
|
133 #ifdef HAVE_CXSPARSE |
|
5648
|
134 CXSPARSE_ZNAME (s) * S (void) { return rep->S; } |
|
5610
|
135 |
|
5648
|
136 CXSPARSE_ZNAME (n) * N (void) { return rep->N; } |
|
5610
|
137 #endif |
|
|
138 }; |
|
|
139 |
|
5713
|
140 |
|
|
141 // Publish externally used friend functions. |
|
|
142 |
|
|
143 extern ComplexMatrix qrsolve (const SparseComplexMatrix &a, const Matrix &b, |
|
|
144 octave_idx_type &info); |
|
|
145 |
|
|
146 extern SparseComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
147 const SparseMatrix &b, |
|
|
148 octave_idx_type &info); |
|
|
149 |
|
|
150 extern ComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
151 const ComplexMatrix &b, |
|
|
152 octave_idx_type &info); |
|
|
153 |
|
|
154 extern SparseComplexMatrix qrsolve (const SparseComplexMatrix &a, |
|
|
155 const SparseComplexMatrix &b, |
|
|
156 octave_idx_type &info); |
|
5610
|
157 #endif |
|
|
158 |
|
|
159 /* |
|
|
160 ;;; Local Variables: *** |
|
|
161 ;;; mode: C++ *** |
|
|
162 ;;; End: *** |
|
|
163 */ |
