Mathc matrices/c21w
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* ------------------------------------ */
/* Save as : c00d.c */
int main(void)
double ab[R4*C6]={
 +1, 4, 5, 6, 2, 0,
 +3, -2, 1, 4, 6, 0,
 -1, 0, -1, -2, -2, 0, 
 2, 3, 5, 7, 4, 0, 
double **Ab = ca_A_mR(ab,i_Abr_Ac_bc_mR(R4,C5,C1));
double **A = c_Ab_A_mR(Ab,i_mR(R4,C5));
double **b = c_Ab_b_mR(Ab,i_mR(R4,C1));
double **Ab_free = i_Abr_Ac_bc_mR(csize_A_R(Ab),csize_A_R(Ab),C1+C3);
double **b_free = i_mR(rsize_R(Ab_free),csize_b_R(Ab_free)); 
double **A_bfree = i_mR(rsize_R(A),csize_R(b_free)) ;
int r;
 clrscrn();
 printf("Find a basis for the orthogonal complement of A :\n\n");
 printf(" A :");
 p_mR(A,S6,P1,C10);
 printf(" b :");
 p_mR(b,S6,P1,C10);
 printf(" Ab :");
 p_mR(Ab,S6,P1,C10);
 stop();
 clrscrn();
 printf(" Ab : gj_PP_mR(Ab,NO) :");
 gj_PP_mR(Ab,NO);
 p_mR(Ab,S7,P3,C10);
 put_var_mR(Ab,Ab_free); 
// printf(" Ab_free : put_var_mR(Ab,Ab_free);"); 
// p_mR(Ab_free,S7,P3,C10); 
 put_freeV_mR(Ab_free);
// printf(" Ab_free : put_freeV_mR(Ab_free);"); 
// p_mR(Ab_free,S7,P3,C10); 
 stop();
 clrscrn(); 
 r = rsize_R(Ab_free);
 while(r>R1) 
 zero_below_pivot_gj1Ab_mR(Ab_free,r--);
 printf(" Ab_free : zero_below_pivot_gj1Ab_mR(Ab_free,r--);"); 
 p_mR(Ab_free,S7,P3,C10); 
 c_Ab_b_mR(Ab_free,b_free);
// printf(" b_free :"); 
// p_mR(b_free,S10,P3,C7);
 printf(" b_free : free variables");
 p_freeV(b_free,S6,P3);
 stop(); 
 clrscrn();
 printf(" A :");
 p_mR(A,S10,P3,C10);
 printf(" b_free :"); 
 p_mR(b_free,S10,P3,C7);
 printf(" A * bfree :"); 
 p_mR(mul_mR(A,b_free,A_bfree),S10,P3,C7);
 stop();
 f_mR(Ab);
 f_mR(Ab_free);
 f_mR(b_free);
 f_mR(b);
 f_mR(A);
 f_mR(A_bfree);
 return 0;
/* ------------------------------------ */
On commence par calculer les variables libres. 
Les colonnes de b_free sont une base pour le complément orthogonal de A. 
 A * b_free = 0
Cela prouve que les vecteurs lignes de A sont orthogonaux aux vecteurs colonnes de b_free.
 Exemple de sortie écran :
Find a basis for the orthogonal complement of A :
 A :
 +1.0 +4.0 +5.0 +6.0 +2.0 
 +3.0 -2.0 +1.0 +4.0 +6.0 
 -1.0 +0.0 -1.0 -2.0 -2.0 
 +2.0 +3.0 +5.0 +7.0 +4.0 
 b :
 +0.0 
 +0.0 
 +0.0 
 +0.0 
 Ab :
 +1.0 +4.0 +5.0 +6.0 +2.0 +0.0 
 +3.0 -2.0 +1.0 +4.0 +6.0 +0.0 
 -1.0 +0.0 -1.0 -2.0 -2.0 +0.0 
 +2.0 +3.0 +5.0 +7.0 +4.0 +0.0 
 Press return to continue. 
 Ab : gj_PP_mR(Ab,NO) :
 +1.000 -0.667 +0.333 +1.333 +2.000 +0.000 
 +0.000 +1.000 +1.000 +1.000 +0.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 +0.000 +0.000 
 +0.000 +0.000 -0.000 -0.000 +0.000 +0.000 
 Press return to continue. 
 ------------------------------------ 
 Ab_free : zero_below_pivot_gj1Ab_mR(Ab_free,r--);
 +1.000 +0.000 +0.000 +0.000 +0.000 +0.000 -1.000 -2.000 -2.000 
 +0.000 +1.000 +0.000 +0.000 +0.000 +0.000 -1.000 -1.000 +0.000 
 +0.000 +0.000 +1.000 +0.000 +0.000 +0.000 +1.000 +0.000 +0.000 
 +0.000 +0.000 +0.000 +1.000 +0.000 +0.000 +0.000 +1.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 +1.000 +0.000 +0.000 +0.000 +1.000 
 b_free : free variables
 x1 = +0.000 -1.000*t -2.000*u -2.000*v
 x2 = +0.000 -1.000*t -1.000*u +0.000*v
 x3 = +0.000 +1.000*t +0.000*u +0.000*v
 x4 = +0.000 +0.000*t +1.000*u +0.000*v
 x5 = +0.000 +0.000*t +0.000*u +1.000*v
 Press return to continue. 
 A :
 +1.000 +4.000 +5.000 +6.000 +2.000 
 +3.000 -2.000 +1.000 +4.000 +6.000 
 -1.000 +0.000 -1.000 -2.000 -2.000 
 +2.000 +3.000 +5.000 +7.000 +4.000 
 b_free :
 +0.000 -1.000 -2.000 -2.000 
 +0.000 -1.000 -1.000 +0.000 
 +0.000 +1.000 +0.000 +0.000 
 +0.000 +0.000 +1.000 +0.000 
 +0.000 +0.000 +0.000 +1.000 
 A * bfree :
 +0.000 +0.000 +0.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 
 Press return to continue.

Mathc matrices/c21x
Application
Installer et compiler ces fichiers dans votre répertoire de travail.
/* ------------------------------------ */
/* Save as : c00a.c */
int main(void)
double ab[R4*C7]={
 1, -3, 4, -2, 5, +4, 0,
 2, -6, 9, -1, 8, 2, 0,
 2, -6, 9, -1, 9, 7, 0, 
 -1, 3, -4, 2, -5, -4, 0, 
double **Ab = ca_A_mR(ab,i_Abr_Ac_bc_mR(R4,C6,C1));
double **A = c_Ab_A_mR(Ab,i_mR(R4,C6));
double **b = c_Ab_b_mR(Ab,i_mR(R4,C1));
double **B = i_mR(R4,C3);
double **B_T = i_mR(R3,C4);
double **B_T_0 = i_Abr_Ac_bc_mR(R3,C4,C1);
 clrscrn();
 printf("Basis for a Column Space by Row Reduction :\n\n");
 printf(" A :");
 p_mR(A,S6,P1,C10);
 printf(" b :");
 p_mR(b,S6,P1,C10);
 printf(" Ab :");
 p_mR(Ab,S6,P1,C10);
 stop();
 clrscrn();
 printf(" The leading 1’s of R give the position \n"
 " of the columns of A which form a basis \n"
 " for the column space of A \n\n"
 " Ab :");
 p_mR(Ab,S7,P3,C10);
 printf(" R : gj_PP_mR(Ab,NO) :");
 gj_PP_mR(Ab,NO);
 p_mR(Ab,S7,P3,C10);
 ca_A_mR(ab,Ab); 
 c_c_mR(Ab,C1,B,C1);
 c_c_mR(Ab,C3,B,C2);
 c_c_mR(Ab,C5,B,C3);
 printf(" B : A basis for the column space of A");
 p_mR(B,S7,P3,C10); 
 stop(); 
 clrscrn();
 printf(" B : A basis for the column space of A");
 p_mR(B,S7,P3,C10); 
 printf(" B_T_0 : ");
 transpose_mR(B,B_T); 
 c_mR(B_T,B_T_0);
 p_mR(B_T_0,S7,P3,C10); 
 printf(" B_T_0 : Verify if B is a basis for the column space of A");
 gj_PP_mR(B_T_0,YES);
 p_mR(B_T_0,S7,P3,C10); 
 stop(); 
 f_mR(Ab);
 f_mR(b);
 f_mR(A);
 f_mR(B);
 f_mR(B_T);
 f_mR(B_T_0); 
 return 0;
/* ------------------------------------ */
La fonction transpose_mR(); vérifie la taille des matrices. 
 p_mR(B,S7,P3,C10); 
 printf(" B_T_0 : ");
 transpose_mR(B,B_T); 
 c_mR(B_T,B_T_0);
La fonction c_mR(); ne vérifie pas la taille des matrices. Cela me permet de créer le système B_T_0, ou 0 représente la matrice b.
double **B_T_0 = i_Abr_Ac_bc_mR(R3,C4,C1);
La création d'une matrice pour créer un systeme est la fonction i_Abr_Ac_bc_mR(A_R3,A_C4,b_C1), si vous utilisez i_mR(); la fonction gaussjordan de fonctionnera pas. 
 Exemple de sortie écran :
Basis for a Column Space by Row Reduction :
 A :
 +1.0 -3.0 +4.0 -2.0 +5.0 +4.0 
 +2.0 -6.0 +9.0 -1.0 +8.0 +2.0 
 +2.0 -6.0 +9.0 -1.0 +9.0 +7.0 
 -1.0 +3.0 -4.0 +2.0 -5.0 -4.0 
 b :
 +0.0 
 +0.0 
 +0.0 
 +0.0 
 Ab :
 +1.0 -3.0 +4.0 -2.0 +5.0 +4.0 +0.0 
 +2.0 -6.0 +9.0 -1.0 +8.0 +2.0 +0.0 
 +2.0 -6.0 +9.0 -1.0 +9.0 +7.0 +0.0 
 -1.0 +3.0 -4.0 +2.0 -5.0 -4.0 +0.0 
 Press return to continue. 
 ------------------------------------ 
 The leading 1’s of R give the position 
 of the columns of A which form a basis 
 for the column space of A 
 Ab :
 +1.000 -3.000 +4.000 -2.000 +5.000 +4.000 +0.000 
 +2.000 -6.000 +9.000 -1.000 +8.000 +2.000 +0.000 
 +2.000 -6.000 +9.000 -1.000 +9.000 +7.000 +0.000 
 -1.000 +3.000 -4.000 +2.000 -5.000 -4.000 +0.000 
 R : gj_PP_mR(Ab,NO) :
 +1.000 -3.000 +4.500 -0.500 +4.000 +1.000 +0.000 
 -0.000 -0.000 +1.000 +3.000 -2.000 -6.000 -0.000 
 +0.000 +0.000 +0.000 +0.000 +1.000 +5.000 +0.000 
 +0.000 +0.000 +0.000 +0.000 +0.000 +0.000 +0.000 
 B : A basis for the column space of A
 +1.000 +4.000 +5.000 
 +2.000 +9.000 +8.000 
 +2.000 +9.000 +9.000 
 -1.000 -4.000 -5.000 
 Press return to continue. 
 ------------------------------------ 
 B : A basis for the column space of A
 +1.000 +4.000 +5.000 
 +2.000 +9.000 +8.000 
 +2.000 +9.000 +9.000 
 -1.000 -4.000 -5.000 
 B_T_0 : 
 +1.000 +2.000 +2.000 -1.000 +0.000 
 +4.000 +9.000 +9.000 -4.000 +0.000 
 +5.000 +8.000 +9.000 -5.000 +0.000 
 B_T_0 : Verify if B is a basis for the column space of A
 +1.000 +0.000 +0.000 -1.000 +0.000 
 +0.000 +1.000 +0.000 +0.000 +0.000 
 -0.000 -0.000 +1.000 -0.000 -0.000 
 Press return to continue.