text
stringlengths 0
211k
|
---|
Exemple de sortie écran : |
A : |
-826,+623, +985,-271, +849,-954, -671,-220, |
-826,+623, +985,-271, +849,-954, -671,-220, |
-826,+623, +985,-271, +849,-954, -671,-220, |
+489, -44, -740,+892, -908,-267, -734,+284 |
b : |
+566,+183, |
+566,+183, |
+566,+183, |
+866,-619 |
Press return to continue. |
------------------------------------ |
Copy/Past into the octave window. |
Ab=[ |
-826+623*i,+985-271*i,+849-954*i,-671-220*i,+566+183*i; |
-826+623*i,+985-271*i,+849-954*i,-671-220*i,+566+183*i; |
-826+623*i,+985-271*i,+849-954*i,-671-220*i,+566+183*i; |
+489-44*i,-740+892*i,-908-267*i,-734+284*i,+866-619*i] |
rref(Ab.00000000001) |
gj4_mZ(Ab) : |
+1.0000 -0.0000i +0.0000 -0.0000i -1.6492 +0.4954i +0.3124 +1.4367i |
-0.0000 -0.0000i +1.0000 -0.0000i -0.3184 +0.4024i +0.2545 +0.8538i |
+0.0000 +0.0000i +0.0000 +0.0000i +0.0000 +0.0000i +0.0000 +0.0000i |
+0.0000 +0.0000i +0.0000 +0.0000i +0.0000 +0.0000i +0.0000 +0.0000i |
-0.5885 -1.4786i |
-0.6195 -0.8524i |
+0.0000 +0.0000i |
+0.0000 +0.0000i |
Press return to continue. |
Mathc matrices/c184 |
Application |
Installer et compiler ces fichiers dans votre répertoire de travail. |
/* Save as : c01a.c */ |
int main(void) |
double a[RA*CA] ={ 4,2,3, |
5,3,1, |
8,2,2}; |
double b[RA*Cb] ={ 3, |
2, |
1}; |
double **A = ca_A_mR(a,i_mR(RA,CA)); |
double **B = ca_A_mR(b,i_mR(RA,Cb)); |
double **Inv = i_mR(RA,CA); |
double **X = i_mR(RA,Cb); |
double **T = i_mR(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_mR(A,S5,P0,C7); |
printf(" B :\n"); |
p_mR(B,S5,P0,C7); |
getchar(); |
clrscrn(); |
printf(" inv(A) :\n"); |
pE_mR(inv_mR(A,Inv),S1,P3,C7); |
printf(" X = inv(A) * B :\n"); |
p_mR(mul_mR(Inv,B,X),S13,P4,C7); |
getchar(); |
clrscrn(); |
printf(" B :\n"); |
p_mR(B,S5,P0,C7); |
printf(" AX :\n"); |
p_mR(mul_mR(A,X,T),S5,P0,C7); |
f_mR(T); |
f_mR(X); |
f_mR(B); |
f_mR(Inv); |
f_mR(A); |
return 0; |
/* ------------------------------------ */ |
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 : |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.