Menu

[r83]: / trunk / test / dgbmatrix / dgbmatrix-dsymatrix / main.cpp  Maximize  Restore  History

Download this file

130 lines (117 with data), 3.2 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
/*****************************************************************************/
/* noname */
/*****************************************************************************/
//====================================================================[include]
#include <iostream>
#include <cstdlib>
#include <ctime>
#include "cpplapack.h"
using namespace std;
//=======================================================================[main]
/*! main */
int main(int argc, char** argv)
{
srand(time(NULL));
int M(5), N(5), KL(2), KU(3);
CPPL::dsymatrix X(N), Y(N), Z(N);
CPPL::dgbmatrix A(M,N,KL,KU);
A.zero();
X.zero();
Y.zero();
Z.zero();
for(int i=0; i<A.m; i++){
for(int j=CPPL::max(0,i-A.kl); j<CPPL::min(A.n,i+A.ku+1); j++){
if( i>=j && (CPPL::max(0,j-A.kl) <= i && i < CPPL::min(A.n,j+A.ku+1) )){
A(i,j) = double( rand() /(RAND_MAX/10) );
A(j,i) = A(i,j);
X(i,j) = -A(i,j);
Y(i,j) = A(i,j);
}
}
}
for(int i=0; i<Z.n; i++){
for(int j=0; j<Z.n; j++){
Z(i,j) = double( rand() /(RAND_MAX/10) );
}
}
cout << "A =\n" << A << endl;
cout << "X =\n" << X << endl;
cout << "Y =\n" << Y << endl;
cout << "Z =\n" << Z << endl;
//dgb+dsy
cout << "A+X =\n" << A+X << "<-Should be zero." << endl;
//dgb-dsy
cout << "A-Y =\n" << A-Y << "<-Should be zero." << endl;
//dgb*dsy
cout << "t(A*Z)-Z*t(A) =\n" << t(A*Z)-Z*t(A) << "<-Should be zero." << endl;
//dgb/dsy
//N/A
//dgb=dsy
//N/A
//dgb+=dsy
//N/A
//dgb-=dsy
//N/A
//dgb*=dsy
//N/A
//dgb/=dsy
//N/A
//dgb+_dsy, -dsy
cout << "A+(-Y) =\n" << A+(-Y) << "<-Should be zero." << endl;
//dgb-_dsy, -dsy
cout << "A-(-X) =\n" << A-(-X) << "<-Should be zero." << endl;
//dgb*_dsy, dsy+dsy, dgb*dsy, _dge+_dge, _dge-_dge
cout << "A*(X+Z) - (A*X+A*Z) =\n" << A*(X+Z) - (A*X+A*Z) << "<-Should be zero." << endl;
//dgb/_dsy
//N/A
//dgb=_dsy
//N/A
//dgb+=_dsy
//N/A
//dgb-=_dsy
//N/A
//dgb*=_dsy
//N/A
//dgb/=_dsy
//N/A
//_dgb+dsy, -dgb
cout << "(-A)+Y =\n" << (-A)+Y << "<-Should be zero." << endl;
//_dgb-dsy, -dgb
cout << endl << endl << endl << endl;
cout << "(-A)-X =\n" << (-A)-X << "<-Should be zero." << endl;
cout << endl << endl << endl << endl;
//_dgb*dsy, -dgb, dgb*dsy, _dge+_dge
cout << "(-A)*Z+(A*Z) =\n" << ((-A)*Z+(A*Z)) << "<-Should be zero." << endl;
//_dgb/dsy
//N/A
//_dgb=dsy
//N/A
//_dgb+=dsy
//N/A
//_dgb-=dsy
//N/A
//_dgb*=dsy
//N/A
//_dgb/=dsy
//N/A
//_dgb+_dsy, -dgb, -dsy
cout << "(-A)+(-X) =\n" << (-A)+(-X) << "<-Should be zero." << endl;
//_dgb-_dsy, -dgb, -dsy
cout << "(-A)-(-Y) =\n" << (-A)-(-Y) << "<-Should be zero." << endl;
//_dgb*_dsy, -dgb, -dsy, dgb*dsy, _dge-_dge
cout << "(-A)*(-Z)-(A*Z) =\n" << (-A)*(-Z)-(A*Z) << "<-Should be zero." << endl;
//_dgb/_dsy
//N/A
//_dgb=_dsy
//N/A
//_dgb+=_dsy
//N/A
//_dgb-=_dsy
//N/A
//_dgb*=_dsy
//N/A
//_dgb/=_dsy
//N/A
return 0;
}
/*****************************************************************************/
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.