Exemple de sortie écran :
 Copy/Past into the octave window.
 A=[
-7-1*i,-9-3*i,-5+6*i,+6+8*i;
-3+4*i,+8-3*i,-1+6*i,+4-3*i;
+4+4*i,-7-1*i,-9-9*i,+2-5*i;
+8+8*i,-3-7*i,-3+2*i,+4-7*i]
 inv(A)
 inv_mZ(A,Inv); :
-3.2154e-02+2.2574e-02i -1.0356e-01+1.1025e-01i -9.3497e-02+1.5867e-02i 
-3.8531e-02+2.4073e-02i +2.4657e-02+5.6872e-02i -3.5626e-02+1.1407e-02i 
-9.6887e-03-2.2186e-02i -2.2642e-02-1.2822e-02i -3.9658e-02+3.7585e-02i 
+2.3037e-02-1.6958e-03i +4.7620e-02+1.5746e-01i -2.4740e-02+1.0619e-01i 
+1.5634e-01-8.6736e-03i 
+3.0915e-02+6.4401e-03i 
+2.4705e-03-1.5545e-02i 
+8.9167e-02-9.3258e-02i 
 Press return to continue
 Press X to stop

Mathc complexes/c082a
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : minor_z.c */
void fun(int r)
double **A = r_mZ(i_mZ(r,r),9.);
double **Minor = i_mZ(r-C1,r-C1);
int minor_r = rp_I(r);
int minor_c = rp_I(r);
 clrscrn();
 printf(" A :");
 p_mZ(A, S5,P0, S4,P0, C6);
 printf(" Minor(R%d,C%d) \n\n",
 minor_r,
 minor_c);
 minor_c = minor_c*C2-C1;
 /* col*C2 : a number has two columns */
 /* -C1 : The real part of the number */
 p_Z(minor_Z(A,minor_r, minor_c), S1,P0, S0,P0);printf("\n\n");
 minor_mZ(A, Minor, minor_r, minor_c);
 printf(" Copy/Past into the octave window.\n\n");
 p_Octave_mZ(Minor,"Minor",P0 ,C0);
 printf(" det(Minor)\n");
 f_mZ(A);
 f_mZ(Minor);
/* ------------------------------------ */
int main(void)
time_t t;
int r;
 srand(time(&t));
do
 r=rp_I(RC4)+RC1;
 fun(r);
} while(stop_w());
 return 0;
/* ------------------------------------ */
 Vérifier avec octave.

Exemple de sortie écran :
 A :
 +6 +6i -5 -7i +4 -1i -7 +6i 
 -5 +2i +8 +4i +4 +8i -5 +6i 
 +6 -5i -5 +8i -3 -5i +6 -5i 
 +4 -9i -9 -7i +8 -7i -7 +2i 
 Minor(R3,C3) 
-687-1915i 
 Copy/Past into the octave window.
 Minor=[
+6+6*i,-5-7*i,-7+6*i;
-5+2*i,+8+4*i,-5+6*i;
+4-9*i,-9-7*i,-7+2*i]
 det(Minor)
 Press return to continue
 Press X to stop

Mathc complexes/c082b
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : minorm_z.c */
void fun(int r)
double **A = r_mZ(i_mZ(r+C1,r+C1),9.);
double **Minor = i_mZ(r,r);
int minor_r = rp_I(r);
int minor_c = rp_I(r);
 clrscrn();
 printf(" A :");
 p_mZ(A, S5,P0, S4,P0, C6);
 printf(" Minor(R%d,C%d) :\n",minor_r, minor_c);
 minor_c = minor_c*C2-C1;
 /* col*C2 : a number has two columns */
 /* -C1 : The real part of the number */
 minor_mZ(A, Minor, minor_r, minor_c);
 p_mZ(Minor, S5,P0, S4,P0, C6);
 f_mZ(A);
 f_mZ(Minor);
/* ------------------------------------ */
int main(void)
time_t t;
 srand(time(&t));
do
 fun(rp_I(RC5));
} while(stop_w());
 return 0;
/* ------------------------------------ */
 On construit une des matrices pour calculer les mineurs.

Exemple de sortie écran :
 A :
 -5 -3i -1 +2i -3 +6i +6 +8i 
 +4 +2i +6 +8i +2 -1i -3 -7i 
 +6 -5i -1 +4i -1 +8i -7 -5i 
 +8 +8i +4 +2i -5 -5i -9 -9i 
 Minor(R2,C1) :
 -1 +2i -3 +6i +6 +8i 
 -1 +4i -1 +8i -7 -5i 
 +4 +2i -5 -5i -9 -9i 
 Press return to continue
 Press X to stop

Mathc complexes/c082c
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : cof_z.c */
void fun(int r)
double **A = r_mZ(i_mZ(r,r),9.);
int minor_r = rp_I(r);
int minor_c = rp_I(r);
 clrscrn();
 printf(" A :");
 p_mZ(A, S5,P0, S4,P0, C6);
 printf(" cofactor(R%d,C%d) = ", minor_r, minor_c);
 minor_c = minor_c*C2-C1;
 /* col*C2 : a number has two columns */ 
 /* -C1 : The real part of the number */
 p_Z(cofactor_Z(A,minor_r,minor_c), S5,P0, S5,P0);printf("\n\n");
 f_mZ(A);
/* ------------------------------------ */
int main(void)
time_t t;
 srand(time(&t));
do
 fun(rp_I(RC5)+RC1);
} while(stop_w());
 return 0;
/* ------------------------------------ */
 On calcul un cofacteur.

Exemple de sortie écran :
 A :
 -7 -1i +2 +6i +6 -1i +4 -5i 
 +4 +2i +8 -1i -5 +8i +2 -3i 
 +6 -5i -1 -5i -3 -3i -9 +2i 
 -9 -3i +8 +4i -3 +8i -5 -9i 
 cofactor(R4,C1) = -406 -57i 
 Press return to continue
 Press X to stop

Mathc complexes/c082d
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : cofm_z.c */
void fun(int r)
double **A = r_mZ(i_mZ(r,r),9.);
double ** Cofactor = i_mZ(r,r);
 clrscrn();
 printf(" A :\n");
 p_mZ(A, S5,P0, S4,P0, C6);
 printf(" Cofactor :\n");
 p_mZ(cofactor_mZ(A,Cofactor), S7,P0, S7,P0, C6);
 f_mZ(A);
 f_mZ(Cofactor);
/* ------------------------------------ */
int main(void)
time_t t;
 srand(time(&t));
do
 fun(rp_I(RC4)+RC1);
} while(stop_w());
 return 0;
/* ------------------------------------ */
On construit la matrice des cofacteurs.

Exemple de sortie écran :
 A :
 -5 -1i +2 -9i -3 -3i 
 -5 +6i -7 -7i +8 +6i 
 +4 -1i +2 +4i -3 +8i 
 Cofactor :
 +85 -79i +71 +74i +1 +13i 
 -60 -61i +38 -28i +5 -16i 
 +70 -102i +67 +35i -16 -15i 
 Press return to continue
 Press X to stop

Mathc complexes/c082e
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : adjoin_z.c */
void fun(int r)
double **A = r_mZ(i_mZ(r,r),9.);
double **Adjoint = i_mZ(r,r);
 clrscrn();
 printf(" A :");
 p_mZ(A,S5,P0, S4,P0, C6);
 printf(" Adjoint :");
 p_mZ(adjoint_mZ(A,Adjoint), S6,P0, S6,P0, C6);
 f_mZ(A);
 f_mZ(Adjoint);
/* ------------------------------------ */
int main(void)
time_t t;
 srand(time(&t));
do
 fun(rp_I(RC4)+RC1);
} while(stop_w());
 return 0;
/* ------------------------------------ */
 On construit l'adjointe qui est la transposé de la matrice des cofacteurs.

Exemple de sortie écran :
 A :
 -7 +4i -1 -3i +8 -9i 
 +4 -3i +6 +6i -1 +2i 
 +4 +6i -1 +6i -3 -5i 
 Adjoint :
 +23 -40i +58 +43i -95 +7i 
 +11 +13i -45 +11i +6 -42i 
 +26 -33i +31 +28i -53 -9i 
 Press return to continue
 Press X to stop

Mathc complexes/c083a
Application 
Installer et compiler ces fichiers dans votre répertoire de travail.
/* Save as : c01a.c */
void fun(int r)
double **A = i_mZ(r,r);
double **Inv = i_mZ(r,r);
double **B = r_mZ(i_mZ(r,C1),9.);
double **X = i_mZ(r,C1);
double **T = i_mZ(r,C1);
 do
 r_mZ(A,9.);
 printf(".");
 }while(!det_Z(A).r);
 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");
 getchar();
 clrscrn();
 printf(" A :\n");
 p_mZ(A, S5,P0, S4,P0, C6);
 printf(" B :\n");
 p_mZ(B, S5,P0, S4,P0, C6);
 getchar();
 clrscrn();
 printf(" inv(A) :\n");
 pE_mZ(inv_mZ(A,Inv), S1,P3, S1,P4, C3);
 printf(" X = inv(A) * B :\n");
 p_mZ(mul_mZ(Inv,B,X), S9,P5, S9,P5, C3);
 getchar();
 clrscrn();
 printf(" B :\n");
 p_mZ(B, S5,P0, S4,P0, C6);
 printf(" AX :\n");
 p_mZ(mul_mZ(A,X,T), S5,P0, S4,P0, C6);
 f_mZ(T);
 f_mZ(X);
 f_mZ(B);
 f_mZ(Inv);
 f_mZ(A);
/* ------------------------------------ */
int main(void)
time_t t;
 srand(time(&t));
do
 fun(rp_I(RC3)+RC1);
} while(stop_w());
 return 0;
/* ------------------------------------ */
 Nous résolvons un système d'équations, et nous vérifions les calculs.

Exemple de sortie écran :
 We want to find X such as, 
 AX = B 
 If A is a square matrix and, 
 If A has an inverse matrix, 
 you can find X by this method
 X = inv(A) B 
 To verify the result you can 
 multiply the matrix A by X. 
 You must refind B.

A :
 +6 +2i -1 +8i -1 -9i 
 +4 +4i +2 -9i -5 +8i 
 -3 -5i +2 +4i -1 -9i 
 B :
 -1 +6i 
 -1 -9i 
 -1 +6i 
 inv(A) :
+5.529e-02-2.6581e-02i +6.721e-02-2.4622e-03i +1.211e-03+6.8008e-02i 
-6.161e-02-3.2869e-02i +2.925e-03+1.5333e-01i -3.511e-02+1.6004e-01i 
-5.940e-02+2.5681e-02i -1.115e-02+9.0028e-02i -2.009e-02+1.5043e-01i 
 X = inv(A) * B :
 -0.39443 -0.30480i 
 +0.71072 -0.88711i 
 -0.15578 -0.64277i 
 -------------------------------------- Ax = B ?
 B :
 -1 +6i 
 -1 -9i 
 -1 +6i 
 AX :
 -1 +6i 
 -1 -9i 
 -1 +6i 
 Press return to continue
 Press X to stop