一、目的
1、掌握高斯完全主元消去法基础原理
2、掌握高斯完全主元消去法解方程组的步骤
3、能用程序语言对Gauss完全主元消去法进行编程实现
二、代码
1、Program.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace 高斯完全主元
{
class Program
{
//列互换
static void ExchangeCol(int k,int jk,int n, double[,] a2,int[] iz)
{
if (k == jk)
return;
for (int i = 1; i <= n; i++)
{
double t = a2[i,k];
a2[i,k] = a2[i,jk];
a2[i,jk] = t;
}
//X下标互换
int m = iz[k];
iz[k] = iz[jk];
iz[jk]=m;
//Console.WriteLine("{0}列--{1}列--互换", k, jk);
}
//行互换
static void ExchangeRow(int k,int ik,int n,double[,]a2)
{
if (k == ik)
return;
for(int j=k;j<=n+1;j++)
{
double t = a2[k, j];
a2[k, j] = a2[ik, j];
a2[ik, j] = t;
}
//Console.WriteLine("{0}行--{1}行--互换",k,ik);
}
//找主元
static double FindMaxIkJk(int k,int n,double[,]a,ref int ik,ref int jk)
{
//ik = k;
//jk = k;
double max =Math.Abs( a[k, k]);
for(int i=k;i<=n;i++)
{
for (int j = k; j <= n; j++)
{
if (max < Math.Abs(a[i, k]))
{
ik = i;
jk = j;
max = Math.Abs(a[i, j]);
}
}
}
return max;
}
//输入
static void Input(ref int n,ref double[,] a2,ref int[] iz)
{
Console.WriteLine("请输入方程的阶数");
n = int.Parse(Console.ReadLine());
a2 = new double[n + 1, n + 2];
iz = new int[n + 1];
// x=new double[n+1];
Console.WriteLine("请输入方程的系数");
for (int i=1;i<=n;i++)
{
iz[i]= i;
string r = Console.ReadLine();
string[] rs = r.Split(' ');
for (int j=1; j<=n+1; j++)
{
a2[i, j] = double.Parse(rs[j - 1]);
}
}
}
//输出A
static void OutputA( int n, double[,] a)
{
Console.WriteLine("A[i,j]如下");
for (int i=1;i<=n;i++)
{
for (int j = 1; j <= n+1; j++)
{
Console.Write("{0,8:f2}", a[i, j]);
}
Console.WriteLine();
}
}
//消元
static void CalcuA(int n,ref double[,]a,int []iz)
{
Console.WriteLine("完全主元素消元");
for(int k=1;k<=n-1;k++)
{
Console.WriteLine("第{0}次消元",k);//找主元
int ik=k, jk=k;
double max = FindMaxIkJk(k, n, a,ref ik,ref jk);
//行互换
ExchangeRow(k, ik, n, a);
ExchangeCol(k, jk, n, a,iz);
for (int i=k+1;i<=n;i++)
{
double lik = a[i, k] / a[k, k];
for (int j=k+1;j<=n+1;j++)
{
a[i, j] = a[i, j] - lik * a[k, j];
}
a[i, k] = 0;
}
OutputA(n,a);
}
Console.WriteLine("消元过程完毕,结果见下");
}
static void CalcuX(int n, double[,] a, ref double[] x,int []iz)
{
x = new double[n + 1];
//正在计算回代过程
for (int i = n; i >= 1; i--)
{
double sum = 0;
for (int j = i + 1; j <= n; j++)
{
sum += a[i, j] * x[iz[j]];
}
x[iz[i]] = (a[i, n + 1] - sum) / a[i, i];
}
}
static void OutputX(double[] x)
{
int n = x.Length - 1;
Console.WriteLine("方程解如下");
for(int i=1;i<=n; i++)
{
Console.WriteLine("X[{0}]={1,8:f2}", i, x[i]);
}
}
static void Main(string[] args)
{
int n = 0;
double[,] a = null;
double[] x = null;
int[] IZ = null;
Input(ref n, ref a,ref IZ);
OutputA(n, a);
//消元
CalcuA(n,ref a,IZ);
OutputA(n, a);
CalcuX(n, a, ref x,IZ);
OutputX(x);
Console.Read();
}
}
}