//高斯消去法
#include<iostream>
using namespace std;
#define N 3
void main()
{
//读入数据
float a[N+1][N+1],m[N+1][N+1],b[N+1];
int k=0,i,j;
cout<<"输入方程组各系数的值如下:"<<endl;
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
cin>>a[i][j];
}
cout<<"输入b的值:"<<endl;
for(i=1;i<=N;i++)
cin>>b[i];
//选主元
do
{
k++;
for(i=k+1;i<=N;i++)
{
m[i][k]=a[i][k]/a[k][k];
for(j=1;j<=N;j++)
{
a[i][j]=a[i][j]-m[i][k]*a[k][j];
}
b[i]=b[i]-m[i][k]*b[k];
}
}while(k!=N-1);
//
b[N]=b[N]/a[N][N];
for(i=N-1;i>=1;i--)
{
for(j=i+1;j<=N;j++)
b[i]=b[i]-a[i][j]*b[j];
b[i]=b[i]/a[i][i];
}
cout<<"此方程的解是:"<<endl;
for(i=1;i<=N;i++)
cout<<b[i]<<endl;
}
using namespace std;
#define N 3
void main()
{
//读入数据
float a[N+1][N+1],m[N+1][N+1],b[N+1];
int k=0,i,j;
cout<<"输入方程组各系数的值如下:"<<endl;
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
cin>>a[i][j];
}
cout<<"输入b的值:"<<endl;
for(i=1;i<=N;i++)
cin>>b[i];
//选主元
do
{
k++;
for(i=k+1;i<=N;i++)
{
m[i][k]=a[i][k]/a[k][k];
for(j=1;j<=N;j++)
{
a[i][j]=a[i][j]-m[i][k]*a[k][j];
}
b[i]=b[i]-m[i][k]*b[k];
}
}while(k!=N-1);
//
b[N]=b[N]/a[N][N];
for(i=N-1;i>=1;i--)
{
for(j=i+1;j<=N;j++)
b[i]=b[i]-a[i][j]*b[j];
b[i]=b[i]/a[i][i];
}
cout<<"此方程的解是:"<<endl;
for(i=1;i<=N;i++)
cout<<b[i]<<endl;
}
//杜里特尔分解
#include <iostream.h>
const int N=3;
void main()
{
//读入数据
float a[N+1][N+1],A;
float u[N+1][N+1],l[N+
#include <iostream.h>
const int N=3;
void main()
{
//读入数据
float a[N+1][N+1],A;
float u[N+1][N+1],l[N+