text
stringlengths 0
211k
|
---|
-828 +6 +321 +504 |
+555 +300 +507 -830 |
+303 +959 +719 -612 |
-458 -594 -64 -25 |
b : ID : |
+1 +0 +0 +0 |
+0 +1 +0 +0 |
+0 +0 +1 +0 |
+0 +0 +0 +1 |
Press return to continue. |
------------------------------------ |
Ab : |
-828 +6 +321 +504 |
+555 +300 +507 -830 |
+303 +959 +719 -612 |
-458 -594 -64 -25 |
+1 +0 +0 +0 |
+0 +1 +0 +0 |
+0 +0 +1 +0 |
+0 +0 +0 +1 |
gj_TP_mR(Ab) : |
+1.0000e+00 +0.0000e+00 +0.0000e+00 +0.0000e+00 |
+0.0000e+00 +1.0000e+00 +0.0000e+00 +0.0000e+00 |
+0.0000e+00 +0.0000e+00 +1.0000e+00 +0.0000e+00 |
+0.0000e+00 +0.0000e+00 +0.0000e+00 +1.0000e+00 |
+9.6778e-04 +2.4025e-03 -2.3558e-03 -2.5803e-03 |
-1.1140e-03 -2.3055e-03 +2.1822e-03 +6.6390e-04 |
+2.6791e-03 +3.5312e-03 -2.4923e-03 -2.2132e-03 |
+1.8810e-03 +1.7253e-03 -2.3089e-03 -2.8374e-03 |
Press return to continue. |
------------------------------------ |
Copy/Past into the octave window. |
A=[ |
-828,+6,+321,+504; |
+555,+300,+507,-830; |
+303,+959,+719,-612; |
-458,-594,-64,-25] |
format short e |
inv(A) |
invA : c_Inv_A_mR(Ab,invA); |
+9.6778e-04 +2.4025e-03 -2.3558e-03 -2.5803e-03 |
-1.1140e-03 -2.3055e-03 +2.1822e-03 +6.6390e-04 |
+2.6791e-03 +3.5312e-03 -2.4923e-03 -2.2132e-03 |
+1.8810e-03 +1.7253e-03 -2.3089e-03 -2.8374e-03 |
Press return to continue |
Press X return to stop |
Mathc matrices/a110 |
Application |
Installer et compiler ces fichiers dans votre répertoire de travail. |
/* Save as : c00.c */ |
int main(void) |
double at[RA*CA]={ |
+10, -150, -148, |
+207, -215, +997, |
-858, +803, +289 |
double bt[RA*Cb]={ |
+437, |
-233, |
+444 |
double **A = ca_A_mR(at,i_mR(RA,CA)); |
double **B = ca_A_mR(bt,i_mR(RA,Cb)); |
double **Inv = i_mR(RA,C3); |
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"); |
stop(); |
clrscrn(); |
printf(" A :\n"); |
p_mR(A,S5,P0,C7); |
printf(" B :\n"); |
p_mR(B,S5,P0,C7); |
stop(); |
clrscrn(); |
printf(" inv(A) :\n"); |
pE_mR(invgj_mR(A,Inv),S1,P3,C7); |
printf(" X = inv(A) * B :\n"); |
p_mR(mul_mR(Inv,B,X),S13,P4,C7); |
stop(); |
clrscrn(); |
printf(" B :\n"); |
p_mR(B,S5,P0,C7); |
printf(" AX :\n"); |
p_mR(mul_mR(A,X,T),S5,P0,C7); |
stop(); |
f_mR(T); |
f_mR(X); |
f_mR(B); |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.