text
stringlengths 0
211k
|
---|
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 |
where B = b1|b2|...|bn |
and X = x1|x2|...|xn |
-------------------------------------- |
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 : |
+4 +2 +3 |
+5 +3 +1 |
+8 +2 +2 |
b1 b2 ... bn : |
+3 +4 +9 |
+2 +5 +8 |
+1 +6 +7 |
inv(A) : |
-1.3333e-01 -6.6667e-02 +2.3333e-01 |
+6.6667e-02 +5.3333e-01 -3.6667e-01 |
+4.6667e-01 -2.6667e-01 -6.6667e-02 |
X = inv(A) * B : |
x1 x2 ... xn |
-0.3000 +0.5333 -0.1000 |
+0.9000 +0.7333 +2.3000 |
+0.8000 +0.1333 +1.6000 |
-------------------------------------- |
b1 b2 ... bn : |
+3 +4 +9 |
+2 +5 +8 |
+1 +6 +7 |
Ax1 Ax2 ... Axn : |
+3 +4 +9 |
+2 +5 +8 |
+1 +6 +7 |
Press return to continue. |
Mathc complexes/a197 |
Application |
Installer et compiler ces fichiers dans votre répertoire de travail. |
/* Save as : c01a.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 b[RA*(Cb*C2)] ={ 1,2, |
3,4, |
5,6 }; |
double **A = ca_A_mZ(a,i_mZ(RA,CA)); |
double **B = ca_A_mZ(b,i_mZ(RA,Cb)); |
double **Inv = i_mZ(RA,CA); |
double **X = i_mZ(RA,Cb); |
double **T = i_mZ(RA,Cb); |
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), S12,P4, S12,P4, C4); |
printf(" X = inv(A) * B :\n"); |
p_mZ(mul_mZ(Inv,B,X), S10,P4, S8,P4, C4); |
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); |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.