Menu

[r136]: / trunk / include / zhematrix- / zhematrix-misc.hpp  Maximize  Restore  History

Download this file

188 lines (165 with data), 5.5 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
//=============================================================================
/*! complete the upper-right components */
inline void zhematrix::complete() const
{VERBOSE_REPORT;
for(long i=0; i<n; i++){
for(long j=0; j<i; j++){
darray[i][j] =std::conj(darray[j][i]);
}
#ifdef CPPL_DEBUG
if(std::fabs(std::imag(operator()(i,i))) > DBL_MIN){
std::cerr << "[WARNING] zhematrix::complete() const: The " << i << "th diagonal component of the zhematrix is not a real number." << std::endl;
}
#endif//CPPL_DEBUG
}
}
//=============================================================================
/*! clear all the matrix data and set the sizes 0 */
inline void zhematrix::clear()
{VERBOSE_REPORT;
n =0;
delete [] array;
array =NULL;
delete [] darray;
darray =NULL;
}
//=============================================================================
/*! change the matrix into a zero matrix */
inline zhematrix& zhematrix::zero()
{VERBOSE_REPORT;
for(long i=0; i<n; i++){
for(long j=0; j<=i; j++){
darray[j][i]=comple(0.0,0.0);
}
}
return *this;
}
//=============================================================================
/*! change the matrix into an identity matrix */
inline zhematrix& zhematrix::identity()
{VERBOSE_REPORT;
for(long i=0; i<n; i++){
for(long j=0; j<i; j++){
darray[j][i] =comple(0.0,0.0);
}
darray[i][i] =comple(1.0,0.0);
}
return *this;
}
//=============================================================================
/*! change sign(+/-) of the matrix */
inline void zhematrix::chsign()
{VERBOSE_REPORT;
for(long i=0; i<n; i++){
for(long j=0; j<=i; j++){
darray[j][i] =-darray[j][i];
}
}
}
//=============================================================================
/*! make a deep copy of the matrix */
inline void zhematrix::copy(const zhematrix& mat)
{VERBOSE_REPORT;
n =mat.n;
delete [] array;
array =new comple[n*n];
delete [] darray;
darray =new comple*[n];
for(int i=0; i<n; i++){ darray[i] =&array[i*n]; }
zcopy_(mat.n*mat.n, mat.array, 1, array, 1);
}
//=============================================================================
/*! make a shallow copy of the matrix\n
This function is not designed to be used in project codes. */
inline void zhematrix::shallow_copy(const _zhematrix& mat)
{VERBOSE_REPORT;
n =mat.n;
delete [] array;
array =mat.array;
delete [] darray;
darray =mat.darray;
mat.nullify();
}
//=============================================================================
/*! resize the matrix */
inline void zhematrix::resize(const long& _n)
{VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if( _n<0 ){
std::cerr << "[ERROR] zhematrix::resize(const long&, const long&)" << std::endl
<< "Matrix sizes must be positive integers." << std::endl
<< "Your input was (" << _n << ")." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
n =_n;
delete [] array;
array =new comple[n*n];
delete [] darray;
darray =new comple*[n];
for(int i=0; i<n; i++){ darray[i] =&array[i*n]; }
}
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
//=============================================================================
/*! get row of the matrix */
inline _zrovector zhematrix::row(const long& _m) const
{VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if( _m<0 || _m>m ){
std::cerr << "[ERROR] zhematrix::row(const long&)" << std::endl
<< "Input row number must be between 0 and " << m << "." << std::endl
<< "Your input was " << _m << "." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
zrovector v(n);
for(long j=0; j<n; j++){ v(j)=(*this)(_m,j); }
return _(v);
}
//=============================================================================
/*! get column of the matrix */
inline _zcovector zhematrix::col(const long& _n) const
{VERBOSE_REPORT;
#ifdef CPPL_DEBUG
if( _n<0 || _n>n ){
std::cerr << "[ERROR] zhematrix::col(const long&)" << std::endl
<< "Input row number must be between 0 and " << n << "." << std::endl
<< "Your input was " << _n << "." << std::endl;
exit(1);
}
#endif//CPPL_DEBUG
zcovector v(m);
for(long i=0; i<m; i++){ v(i)=(*this)(i,_n); }
return _(v);
}
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
//=============================================================================
/*! swap two matrices */
inline void swap(zhematrix& A, zhematrix& B)
{VERBOSE_REPORT;
long A_n(A.n);
comple* A_array(A.array);
//comple** A_darray(A.darray);
comple** A_darray=A.darray; //corruption to support VC++
A.n=B.n; A.array=B.array; A.darray=B.darray;
B.n=A_n; B.array=A_array; B.darray=A_darray;
}
//=============================================================================
/*! convert user object to smart-temporary object */
inline _zhematrix _(zhematrix& mat)
{VERBOSE_REPORT;
_zhematrix newmat;
//////// shallow copy ////////
newmat.n =mat.n;
newmat.array =mat.array;
newmat.darray =mat.darray;
//////// nullify ////////
mat.n =0;
mat.array =NULL;
mat.darray =NULL;
return newmat;
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.