xiaoyuan.java

高斯消元法（有错误) 谢谢麻烦修改一下

public class xiaoyuan
{
	public static void main(String[] args)
	{
		int n=10;
		
		int[] b=new int[n];
		double[] x=new double[n];
		int[][] a=new int[n][n];
		
		double[][] l=new double[n][n];
		double[][] u=new double[n][n];
		double[] z=new double[n];
		
		
		
		for(int i=0;i<n;i++)
		{
			b[i]=0;
			
			if(i==0)
			b[i]=7;
			if(i==1)
			b[i]=15;
			if(i==n-2)
			b[i]=15;
			if(i==n-1)
			b[n-1]=14;
			
			System.out.print("b"+"["+i+"] ");
			System.out.println(b[i]+" ");
			
		}
		
		for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			a[i][j]=0;
			
			if(i==0)
			{
				a[i][i]=6;
				if(j==1)
				a[i][j]=1;
			}	
			
			if(i==1)
			{
				if(j==0)
				a[i][j]=8;
				if(j==1)
				a[i][j]=6;
				if(j==2)
				a[i][j]=1;
				
			}
			
			if(i==n-2)
			{
				if(j==n-3)
				a[i][j]=8;
				if(j==n-2)
				a[i][j]=6;
				if(j==n-1)
				a[i][j]=1;
				
			}
			
			if(i==n-1)
			{
				if(j==n-2)
				a[i][j]=6;
				if(j==n-1)
				a[i][j]=1;
				
			}
			
			System.out.print("a"+"["+i+"]["+j+"] ");
			System.out.println(a[i][j]+" ");	
		}
			
		for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			for(int k=0;k<j-2;k++)
			{
				double M;
				M=(l[i][k]*u[k][j]);
				M++;
				
				if(i==j)
				l[i][j]=1;	
				
				if(i>j)
				l[i][j]=(a[i][j]-M)/u[j][j];
					
			}
			for(int k=0;k<i-2;k++)
			{
				double M;
				M=(l[i][k]*u[k][j]);
				M++;
				if(i<=j)
				u[i][j]=(a[i][j]-M)/l[i][i];
			}
			for(int k=0;k<i-2;k++)
			{
				double M;
				M=(l[i][k]*z[k]);
				M++;
				z[i]=(b[i]-M)/l[i][i];
			}
			for(int k=i;k<n-1;k++)
			{
				double M;
				M=(l[i][k]*x[k]);
				M++;
				x[i]=(z[i]-M)/u[i][i];
				
			}
			System.out.print("x"+"["+i+"] ");
			System.out.println(x[i]+" ");
			
			
		}	
		
	}
}