1 | #include "machdefs.h"
|
---|
2 | #include <iostream.h>
|
---|
3 | #include <stdlib.h>
|
---|
4 | #include <stdio.h>
|
---|
5 | #include <string.h>
|
---|
6 | #include <math.h>
|
---|
7 | #include "outilsinit.h"
|
---|
8 | #include "pexceptions.h"
|
---|
9 | #include "matrix.h"
|
---|
10 | #include "tmatrix.h"
|
---|
11 | #include "nbrandom.h"
|
---|
12 |
|
---|
13 | using namespace PlanckDPC;
|
---|
14 |
|
---|
15 | ////////////////////////////////////////////////////////////////////////////////////////
|
---|
16 | int main(int narg,char *arg[])
|
---|
17 | {
|
---|
18 | PeidaInit();
|
---|
19 | r_8 v[3][4] = {{1,2,3,4},{4,5,6,5},{7,8,9,10}};
|
---|
20 |
|
---|
21 | {
|
---|
22 |
|
---|
23 | TMatrix<r_8> A(2,3);
|
---|
24 | {for(int i=0;i<2;i++) for(int j=0;j<3;j++) A(i,j) = v[i][j];}
|
---|
25 | cout<<"A:"<<endl<<A;
|
---|
26 |
|
---|
27 | {
|
---|
28 | cout << " Test ecriture PPersist TMatrix " << endl;
|
---|
29 | FIO_TMatrix<r_8> ftm(A);
|
---|
30 | ftm.Write("tmtx.ppf");
|
---|
31 | }
|
---|
32 | {
|
---|
33 | cout << " Test lecture PPersist TMatrix " << endl;
|
---|
34 | FIO_TMatrix<r_8> ftm("tmtx.ppf");
|
---|
35 | cout<<"Alue:"<<(TMatrix<r_8>)ftm<<endl;
|
---|
36 | }
|
---|
37 |
|
---|
38 | cout<<"Matrices B(2,3)"<<endl;
|
---|
39 | TMatrix<r_8> B(3,2);
|
---|
40 | {for(int i=0;i<3;i++) for(int j=0;j<2;j++) B(i,j) = v[i][j];}
|
---|
41 | cout<<"B:"<<endl<<B;
|
---|
42 |
|
---|
43 | cout<<"Matrices C(3,3)"<<endl;
|
---|
44 | TMatrix<r_8> C(3,3);
|
---|
45 | {for(int i=0;i<3;i++) for(int j=0;j<3;j++) C(i,j) = v[i][j];}
|
---|
46 | cout<<"C:"<<endl<<C;
|
---|
47 |
|
---|
48 | cout<<"Matrices D(2,2)"<<endl;
|
---|
49 | TMatrix<r_8> D(2,2);
|
---|
50 | {for(int i=0;i<2;i++) for(int j=0;j<2;j++) D(i,j) = v[i][j];}
|
---|
51 | cout<<"D:"<<endl<<D;
|
---|
52 |
|
---|
53 | cout<<"Matrices E(3,4)"<<endl;
|
---|
54 | TMatrix<r_8> E(3,4);
|
---|
55 | {for(int i=0;i<3;i++) for(int j=0;j<4;j++) E(i,j) = v[i][j];}
|
---|
56 | cout<<"E:"<<endl<<E;
|
---|
57 |
|
---|
58 | //-----------------------------------------------
|
---|
59 | cout<<endl<<"Matrices AA(A)"<<endl;
|
---|
60 | TMatrix<r_8> AA(A);
|
---|
61 | cout<<"AA:"<<endl<<AA;
|
---|
62 |
|
---|
63 | //-----------------------------------------------
|
---|
64 | cout<<endl<<"Matrices AA2; AA2=A;"<<endl;
|
---|
65 | TMatrix<r_8> AA2; AA2=A;
|
---|
66 | cout<<"AA2:"<<endl<<AA2;
|
---|
67 |
|
---|
68 | //-----------------------------------------------
|
---|
69 | cout<<endl<<"Matrices AAA.Clone(A)"<<endl;
|
---|
70 | TMatrix<r_8> AAA; AAA.Clone(A);
|
---|
71 | cout<<"AAA:"<<endl<<AAA;
|
---|
72 | cout<<endl<<"Matrices BBB.Clone(B)"<<endl;
|
---|
73 | TMatrix<r_8> BBB; BBB.Clone(B);
|
---|
74 | cout<<"BBB:"<<endl<<BBB;
|
---|
75 | cout<<"Matrices CCC.Clone(C)"<<endl;
|
---|
76 | TMatrix<r_8> CCC; CCC.Clone(C);
|
---|
77 | cout<<"CCC:"<<endl<<CCC;
|
---|
78 |
|
---|
79 | //-----------------------------------------------
|
---|
80 | cout<<endl<<"Matrices I(5,5)=1.234"<<endl;
|
---|
81 | TMatrix<r_8> I(5,5); I = 5;
|
---|
82 | cout<<"I:"<<endl<<I;
|
---|
83 |
|
---|
84 | //-----------------------------------------------
|
---|
85 | cout<<endl<<"Matrices AAA+=1"<<endl;
|
---|
86 | AAA += 1;
|
---|
87 | cout<<"AAA:"<<endl<<AAA;
|
---|
88 | cout<<"Matrices AAA-=1"<<endl;
|
---|
89 | AAA -= 1;
|
---|
90 | cout<<"AAA:"<<endl<<AAA;
|
---|
91 | cout<<"Matrices AAA*=10"<<endl;
|
---|
92 | AAA *= 10;
|
---|
93 | cout<<"AAA:"<<endl<<AAA;
|
---|
94 | cout<<"Matrices AAA/=10"<<endl;
|
---|
95 | AAA /= 10;
|
---|
96 | cout<<"AAA:"<<endl<<AAA;
|
---|
97 |
|
---|
98 | //-----------------------------------------------
|
---|
99 | cout<<endl<<"Matrices AAA+=A"<<endl;
|
---|
100 | AAA += A;
|
---|
101 | cout<<"AAA:"<<endl<<AAA;
|
---|
102 | cout<<"Matrices AAA-=A"<<endl;
|
---|
103 | AAA -= A;
|
---|
104 | cout<<"AAA:"<<endl<<AAA;
|
---|
105 |
|
---|
106 | //-----------------------------------------------
|
---|
107 | cout<<endl<<"Matrices AAA=A"<<endl;
|
---|
108 | AAA = A;
|
---|
109 | cout<<"AAA:"<<endl<<AAA;
|
---|
110 | cout<<endl<<"Matrices BBB=B"<<endl;
|
---|
111 | BBB = B;
|
---|
112 | cout<<"BBB:"<<endl<<BBB;
|
---|
113 |
|
---|
114 | //---------------------------------------------
|
---|
115 | TMatrix<r_8> a(A,false);
|
---|
116 | cout<<endl<<"Matrices AAA*=C"<<endl;
|
---|
117 | {for(int i=0;i<AAA.NRows();i++) for(int j=0;j<C.NCols();j++)
|
---|
118 | {a(i,j) = 0; for(int k=0;k<AAA.NCols();k++) a(i,j) += AAA(i,k)*C(k,j);}}
|
---|
119 | AAA *= C;
|
---|
120 | cout<<"AAA:"<<endl<<AAA;
|
---|
121 | cout<<"a:"<<endl<<a;
|
---|
122 | TMatrix<r_8> b(B,false);
|
---|
123 | cout<<"Matrices BBB*=D"<<endl;
|
---|
124 | {for(int i=0;i<BBB.NRows();i++) for(int j=0;j<D.NCols();j++)
|
---|
125 | {b(i,j) = 0; for(int k=0;k<BBB.NCols();k++) b(i,j) += BBB(i,k)*D(k,j);}}
|
---|
126 | BBB *= D;
|
---|
127 | cout<<"B:"<<endl<<BBB;
|
---|
128 | cout<<"b:"<<endl<<b;
|
---|
129 |
|
---|
130 | //-----------------------------------------------
|
---|
131 | AA.Clone(A);
|
---|
132 | cout<<endl<<"Matrices AA = AA + 10"<<endl;
|
---|
133 | AA = AA + 10.; cout<<"AA"<<endl<<AA;
|
---|
134 | cout<<endl<<"Matrices AA = AA - 10"<<endl;
|
---|
135 | AA = AA - 10.; cout<<"AA"<<endl<<AA;
|
---|
136 | cout<<endl<<"Matrices AA = 10 - AA"<<endl;
|
---|
137 | AA = 10. - AA; cout<<"AA"<<endl<<AA;
|
---|
138 | cout<<endl<<"Matrices AA = AA - 10"<<endl;
|
---|
139 | AA = AA - 10.; cout<<"AA"<<endl<<AA;
|
---|
140 | cout<<endl<<"Matrices AA = -1 * AA"<<endl;
|
---|
141 | AA = -1. * AA; cout<<"AA"<<endl<<AA;
|
---|
142 | cout<<endl<<"Matrices AA = 10 * AA"<<endl;
|
---|
143 | AA = 10. * AA; cout<<"AA"<<endl<<AA;
|
---|
144 | cout<<endl<<"Matrices AA = AA * 10"<<endl;
|
---|
145 | AA = AA * 10.; cout<<"AA"<<endl<<AA;
|
---|
146 | cout<<endl<<"Matrices AA = AA / 100"<<endl;
|
---|
147 | AA = AA / 100.; cout<<"AA"<<endl<<AA;
|
---|
148 |
|
---|
149 | //-----------------------------------------------
|
---|
150 | TMatrix<r_8> R;
|
---|
151 | AA.Clone(A); AA += 10.; AAA.Clone(A); AAA += 100.;
|
---|
152 | cout<<endl<<"Matrices R = A + AA"<<endl;
|
---|
153 | R = A + AA; cout<<"R"<<endl<<R;
|
---|
154 | cout<<endl<<"Matrices R = AA - A"<<endl;
|
---|
155 | R = AA - A; cout<<"R"<<endl<<R;
|
---|
156 | cout<<endl<<"Matrices R = A + AA + AAA"<<endl;
|
---|
157 | R = A + AA + AAA; cout<<"R"<<endl<<R;
|
---|
158 | cout<<endl<<"Matrices R = A + 100 + 2*A"<<endl;
|
---|
159 | R = A + 100. + 2.*A; cout<<"R"<<endl<<R;
|
---|
160 |
|
---|
161 | //-----------------------------------------------
|
---|
162 | TMatrix<r_8> RR(2,4);
|
---|
163 | {for(int i=0;i<A.NRows();i++) for(int j=0;j<E.NCols();j++)
|
---|
164 | {RR(i,j) = 0; for(int k=0;k<A.NCols();k++) RR(i,j) += A(i,k)*E(k,j);}}
|
---|
165 | cout<<endl<<"Matrices R = A * E"<<endl;
|
---|
166 | R = A * E;
|
---|
167 | cout<<"R"<<endl<<R; cout<<"RR"<<endl<<RR;
|
---|
168 |
|
---|
169 | //-----------------------------------------------
|
---|
170 | cout<<endl<<"Matrices A = A.Transpose 2x"<<endl;
|
---|
171 | cout<<"A"<<endl<<A;
|
---|
172 | A = A.Transpose(); cout<<"trA"<<endl<<A;
|
---|
173 | A = A.Transpose(); cout<<"trtrA"<<endl<<A;
|
---|
174 | cout<<endl<<"Matrices AT = A.Transpose() 2x"<<endl;
|
---|
175 | TMatrix<r_8> AT;
|
---|
176 | AT = A.Transpose(); cout<<"AT"<<endl<<AT;
|
---|
177 | AT = AT.Transpose(); cout<<"trAT"<<endl<<AT;
|
---|
178 |
|
---|
179 | //-----------------------------------------------
|
---|
180 | cout<<endl<<"Test Inversion avec couplage a M=Matrix(C)"<<endl;
|
---|
181 | TMatrix<r_8> X(10,10);
|
---|
182 | {for(int i=0;i<10;i++) for(int j=0;j<10;j++)
|
---|
183 | {X(i,j) = drand01(); if(drand01()>0.8) X(i,j) += 1.e+15*drand01();}}
|
---|
184 | cout<<"TMatrix X"<<endl<<X;
|
---|
185 | {
|
---|
186 | Matrix M(X); cout<<"Matrix M"<<endl<<M<<endl;
|
---|
187 | Matrix MI = M.Inverse(); cout<<"MI"<<endl<<MI;
|
---|
188 | MI *= M; cout<<"MI*M"<<endl<<MI;
|
---|
189 | r_8 xmin=-1.;
|
---|
190 | for(int i=0;i<10;i++) for(int j=0;j<10;j++)
|
---|
191 | if(i!=j && fabs(MI(i,j))>xmin) xmin=fabs(MI(i,j));
|
---|
192 | cout<<"Biggest off diagonal identity matrix element is "<<xmin<<endl;
|
---|
193 | } // destruction de M,MI
|
---|
194 | cout<<"TMatrix X"<<endl<<X;
|
---|
195 |
|
---|
196 | //-----------------------------------------------
|
---|
197 | {
|
---|
198 | cout<<endl<<"Test Inversion directe"<<endl;
|
---|
199 | cout<<"TMatrix X"<<endl<<X;
|
---|
200 | TMatrix<r_8> Xinv;
|
---|
201 | Xinv = X.Inverse();
|
---|
202 | cout<<"TMatrix Xinv"<<endl<<Xinv;
|
---|
203 | Xinv *= X;
|
---|
204 | cout<<"Xinv *= X"<<endl<<Xinv;
|
---|
205 | r_8 xmin=-1.;
|
---|
206 | for(int i=0;i<10;i++) for(int j=0;j<10;j++)
|
---|
207 | if(i!=j && fabs(Xinv(i,j))>xmin) xmin=fabs(Xinv(i,j));
|
---|
208 | cout<<"Biggest off diagonal identity matrix element is "<<xmin<<endl;
|
---|
209 | cout<<"TMatrix X"<<endl<<X;
|
---|
210 | }
|
---|
211 |
|
---|
212 | //-----------------------------------------------
|
---|
213 | cout<<endl<<"Test liens TMatrix L avec Matrix MI"<<endl;
|
---|
214 | Matrix MI(10,5);
|
---|
215 | {for(int i=0;i<10;i++) for(int j=0;j<5;j++) MI(i,j) = 1000*i+j;}
|
---|
216 | cout<<"MI"<<endl<<MI;
|
---|
217 | {
|
---|
218 | TMatrix<r_8> L(MI.NRows(),MI.NCol(),MI.Data(),new Bridge);
|
---|
219 | cout<<"L"<<endl<<L;
|
---|
220 | L *= 100.; cout<<"L*=100."<<endl<<L;
|
---|
221 | } // destruction de L
|
---|
222 | cout<<"MI(4,4)="<<MI(4,4)<<endl;
|
---|
223 |
|
---|
224 | } // destruction de toutes les matrices
|
---|
225 | exit(0);
|
---|
226 | }
|
---|