Menu

[r126]: / trunk / test / dgematrix / dgematrix-lapack / dggev_check.cpp  Maximize  Restore  History

Download this file

127 lines (106 with data), 3.7 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
//=============================================================================
void dggev_check_value()
{
cout << "############ check dggev value ############" << endl;
srand(time(NULL));
int M(3);
//// make dgematrix A and B ////
CPPL::dgematrix A(M,M), B(M,M);
for(int i=0; i<A.m; i++){ for(int j=0; j<A.n; j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
B(i,j) =double( rand() /(RAND_MAX/10) );
}}
//// make wr wi vr ////
vector<double> wr, wi;
//// make A_original and B_original ////
CPPL::dgematrix A_original(A);
CPPL::dgematrix B_original(B);
//// dggev ////
A.dggev(B, wr, wi);
//// print ////
cout << "A_original=\n" << A_original << endl;
cout << "B_original=\n" << B_original << endl;
for(int i=0; i<A.m; i++){
cout << "#### " << i << "th eigen ####" << endl;
cout << "wr=" << wr[i] <<endl;
cout << "wi=" << wi[i] <<endl;
}
}
//=============================================================================
void dggev_check_right()
{
cout << "############ check dggev right ############" << endl;
srand(time(NULL));
int M(3);
//// make dgematrix A and B ////
CPPL::dgematrix A(M,M), B(M,M);
for(int i=0; i<A.m; i++){ for(int j=0; j<A.n; j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
B(i,j) =double( rand() /(RAND_MAX/10) );
}}
//// make wr wi vr ////
vector<double> wr, wi;
vector<CPPL::dcovector> vrr, vri;
//// make A_original and B_original ////
CPPL::dgematrix A_original(A);
CPPL::dgematrix B_original(B);
//// dggev ////
A.dggev(B, wr, wi ,vrr, vri);
//// print ////
cout << "A_original=\n" << A_original << endl;
cout << "B_original=\n" << B_original << endl;
for(int i=0; i<A.m; i++){
cout << "#### " << i << "th eigen ####" << endl;
cout << "wr=" << wr[i] <<endl;
cout << "wi=" << wi[i] <<endl;
cout << "vrr=\n" << vrr[i] <<endl;
cout << "vri=\n" << vri[i] <<endl;
cout << "Real[ [A]*{x} -lambda*[B]*{x} ] = (Should be zeros)\n"
<< A_original*vrr[i]
-(wr[i]*B_original*vrr[i] - wi[i]*B_original*vri[i])
<< endl;
cout << "Imag[ [A]*{x} -lambda*[B]*{x} ] = (Should be zeros)\n"
<< A_original*vri[i]
-(wr[i]*B_original*vri[i] + wi[i]*B_original*vrr[i])
<< endl;
}
}
//=============================================================================
void dggev_check_left()
{
cout << "############ check dggev left ############" << endl;
srand(time(NULL));
int M(3);
//// make dgematrix A and B ////
CPPL::dgematrix A(M,M), B(M,M);
for(int i=0; i<A.m; i++){ for(int j=0; j<A.n; j++){
A(i,j) =double( rand() /(RAND_MAX/10) );
B(i,j) =double( rand() /(RAND_MAX/10) );
}}
//// make wr wi vl ////
vector<double> wr, wi;
vector<CPPL::drovector> vlr, vli;
//// make A_original and B_original ////
CPPL::dgematrix A_original(A);
CPPL::dgematrix B_original(B);
//// dggev ////
A.dggev(B, wr, wi ,vlr, vli);
//// print ////
cout << "A_original=\n" << A_original << endl;
cout << "B_original=\n" << B_original << endl;
for(int i=0; i<A.m; i++){
cout << "#### " << i << "th eigen ####" << endl;
cout << "wr = " << wr[i] << endl;
cout << "wi = " << wi[i] << endl;
cout << "vlr = " << vlr[i];
cout << "vli = " << vli[i] << endl;
cout << "Real[ {x}*[A] -lambda*{x}*[B] ] = (Should be zeros)\n"
<< vlr[i]*A_original
-(wr[i]*vlr[i]*B_original - wi[i]*vli[i]*B_original)
<< endl;
cout << "Imag[ [A]*{x} -lambda*{x}*[B] ] = (Should be zeros)\n"
<< vli[i]*A_original
-(wr[i]*vli[i]*B_original + wi[i]*vlr[i]*B_original)
<< endl;
}
}
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.