#include <math.h>
main()
{
int i,j,m,r,sign;
double A0[9][9],s,z,p,n,v,h,l,y[9],u[9],k,q[9],X[9],x[9]={0,0,0,0,0,0,0,0,0},B[9]
[9],g[9];
double A[9][9]={{12.38412,2.115237,-1.061074,1.112336,-
0.113584,0.718719,1.742382,3.067813,-2.031743},
{2.115237,19.141823,-3.125432,-1.012345,2.189736,1.563849,-
0.784165,1.112348,3.123124},
{-1.061074,-3.125432,15.567914,3.123848,2.031454,1.836742,-1.056781,0.336993,-
1.010103},
{1.112336,-1.012345,3.123848,27.108437,4.101011,-3.741856,2.101023,-0.71828,-
0.037585},
{-0.113584,2.189736,2.031454,4.101011,19.897918,0.431637,-
3.111223,2.121314,1.784317},
{0.718719,1.563849,1.836742,-3.741865,0.431637,9.789365,-0.103458,-
1.103456,0.238417},
{1.742382,-0.784165,-1.056781,2.101023,-3.111223,-0.103458,14.713846,3.123789,-
2.213474},
{3.067813,1.112348,0.336993,-0.71828,2.121314,-
1.103456,3.123789,30.719334,4.446782},
{-2.031743,3.123124,-1.010103,-0.037585,1.784317,0.238417,-
2.213474,4.446782,40.00001}};
double b[9]={2.1874369,33.992318,-25.173417,0.84671695,1.784317,-
86.612343,1.1101230,4.719345,
-5.6784392};
for(i=0;i<9;i++) /*给 A0 赋初值*/
for(j=0;j<9;j++)
A0[i][j]=A[i][j];
for(r=0;r<7;r++) /*求 */
{
s=0;
for(i=r+1;i<9;i++)
s=s+A[i][r]*A[i][r];
s=sqrt(s);
l=s*s+fabs(A[r+1][r])*s;
if(A[r+1][r]>0) sign=1;
else if(A[r+1][r]<0) sign=-1;
for(i=0;i<9;i++)
{
if(i<=r) u[i]=0;
评论4