Datasets:
Kant1
/
French_Wikibooks_articles

Dataset card Data Studio Files Community
1
text
stringlengths
0
211k
invgj_mZ(A,Inv) :
-1.2917e-01+8.1007e-02i +8.5597e-02-6.6602e-02i +8.5160e-02-3.3778e-04i
+1.8258e-01-8.6352e-02i -1.5122e-01+8.1911e-02i +9.3058e-02-3.8517e-02i
+3.7156e-03-6.3244e-02i +7.1142e-02-3.4463e-02i -8.4514e-02+1.6084e-02i
X = invgj_mZ(A,Inv) * B :
+0.3085+0.3691i
+0.3263+0.4945i
+0.2212-0.2204i
Press return to continue.
------------------------------------
B :
+1 +4i
+2 +5i
+3 +6i
AX :
+1 +4i
+2 +5i
+3 +6i
Press return to continue.
Mathc complexes/a192
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : c00a.c */
int main(void)
double a[RA*(CA*C2)] = { 1,2, 3,4, 5,6,
5,4, 1,3, 6,8,
7,2, 5,1, 1,1};
double b0[RA*(Cb*C2)] ={ 1,4, 5,4, 3,1,
2,5, 3,5, 2,3,
3,6, 2,6, 2,4 };
double **A = ca_A_mZ(a, i_mZ(RA,CA));
double **B = ca_A_mZ(b0,i_mZ(RA,Cb));
double **Inv = i_mZ(RA,CA);
double **X = i_mZ(RA,Cb);
double **T = i_mZ(RA,Cb);
clrscrn();
printf(" \n");
printf(" Linear systems with common coefficient matrix.\n\n");
printf(" Ax1=b1 \n");
printf(" Ax2=b2 \n");
printf(" ... \n");
printf(" Axn=bn \n\n");
printf(" We can write these equalities in this maner. \n\n");
printf(" A|x1|x2|...|xn| = b1|b2|...|bn| \n\n");
printf(" or simply : \n\n");
printf(" AX = B \n\n");
printf(" where B = b1|b2|...|bn \n\n");
printf(" and X = x1|x2|...|xn \n\n");
stop();
clrscrn();
printf(" We want to find X such as, \n\n");
printf(" AX = B \n\n");
printf(" If A is a square matrix and, \n\n");
printf(" If A has an inverse matrix, \n\n");
printf(" you can find X by this method\n\n");
printf(" X = inv(A) B \n\n\n");
printf(" To verify the result you can \n\n");
printf(" multiply the matrix A by X. \n\n");
printf(" You must refind B. \n\n");
stop();
clrscrn();
printf(" A :");
p_mZ(A, S5,P0, S3,P0, C6);
printf(" b1 b2 ... bn :");
p_mZ(B, S5,P0, S3,P0, C6);
stop();
clrscrn();
printf(" invgj_mZ(A,Inv) :");
pE_mZ(invgj_mZ(A,Inv), S12,P4, S6,P4, C3);
printf(" X = invgj_mZ(A,Inv) * B :\n\n");
printf(" x1 x2 ... xn :");
p_mZ(mul_mZ(Inv,B,X), S9,P4, S6,P4, C6);
stop();
clrscrn();
printf(" b1 b2 ... bn :");
p_mZ(B, S5,P0, S3,P0, C6);
printf(" Ax1 Ax2 ... Axn :");
p_mZ(mul_mZ(A,X,T), S5,P0, S3,P0, C6);
f_mZ(T);
f_mZ(X);
f_mZ(B);
f_mZ(Inv);
f_mZ(A);
stop();
return 0;
/* ------------------------------------ */
Exemple de sortie écran :
Linear systems with common coefficient matrix.
Ax1=b1
Ax2=b2
Axn=bn
We can write these equalities in this maner.
A|x1|x2|...|xn| = b1|b2|...|bn|
or simply :
AX = B