C#--Gauss消元之直接法

简介

       数学上，高斯消元法（或译：高斯消去法），是线性代数规划中的一个算法，可用来为线性方程组求解。但其算法十分复杂，不常用于加减消元法，求出矩阵的秩，以及求出可逆方阵的逆矩阵。不过，如果有过百万条等式时，这个算法会十分省时。一些极大的方程组通常会用迭代法以及花式消元来解决。当用于一个矩阵时，高斯消元法会产生出一个“行梯阵式”。高斯消元法可以用在电脑中来解决数千条等式及未知数。亦有一些方法特地用来解决一些有特别排列的系数的方程组。

公式：

k次消元：a[i][j]=a[i][j]-(a[k][j]/a[k][k])*a[i][k]   (k表示消元次数)

回代公式（求x）：

   x[i]=(a[i][n+1]- ∑a[i][j]*x[j])/a[i][i];  (i+1<=j<=n)

1.消元

static void xiaoyuan()
        {
            for (int k = 0; k < n - 1; k++)
            {
                for (int i = k + 1; i < n; i++)
                {
                    double ak = a[i, k] / a[k, k];
                    for (int j = k; j < n + 1; j++)
                    {
                        a[i, j] = a[i, j] - a[k, j] * (ak);
                    }
                }
                Console.WriteLine("\n第{0}次消元：", k + 1);
                for (int i = 0; i < n; i++)
                {
                    string s = "";
                    for (int j = 0; j < n + 1; j++)
                    {
                        s += string.Format("{0,-8:f2}", a[i, j]);
                    }
                    Console.WriteLine(s);
                }
            }
            Console.WriteLine("***********消元完成*********");
        }

2.回代部分

static void huidai()
        {
            for (int i = n - 1; i >= 0; i--)
            {
                double sum = 0;
                for (int j = i + 1; j < n; j++)
                {
                    sum = a[i, j] * x[j];
                }
                x[i] = (a[i, n] - sum) / a[i, i];
            }
        }

最终实现：

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Gauss1
{
    class Program
    {
        static int n;
        static double[,] a;
        static double[] x;
        static void xiaoyuan()
        {
            for (int k = 0; k < n - 1; k++)
            {
                for (int i = k + 1; i < n; i++)
                {
                    double ak = a[i, k] / a[k, k];
                    for (int j = k; j < n + 1; j++)
                    {
                        a[i, j] = a[i, j] - a[k, j] * (ak);
                    }
                }
                Console.WriteLine("\n第{0}次消元：", k + 1);
                for (int i = 0; i < n; i++)
                {
                    string s = "";
                    for (int j = 0; j < n + 1; j++)
                    {
                        s += string.Format("{0,-8:f2}", a[i, j]);
                    }
                    Console.WriteLine(s);
                }
            }
            Console.WriteLine("***********消元完成*********");
        }
        static void xiaoyuan1()
        {
            for (int k = 0; k < n - 1; k++)
            {
                for (int i = k + 1; i < n; i++)
                {
                    for (int j = k; j < n + 1; j++)
                    {
                        a[i, j] = a[i, j] - a[i, k] / a[k, k] * a[k, j];
                    }

                }
                Console.WriteLine("第{0}次消元！！！！！！！！！", k + 1);
                for (int i = 0; i < n; i++)
                {
                    string s = null;
                    for (int j = 0; j < n + 1; j++)
                    {
                        s += string.Format("  {0,-4}  ", a[i, j]);
                    }
                    Console.WriteLine(s);
                }
            }
        }
        static void huidia()
        {
            for (int i = n - 1; i >= 0; i--)
            {
                double sum = 0;
                for (int j = i + 1; j < n; j++)
                {
                    sum = a[i, j] * x[j];
                }
                x[i] = (a[i, n] - sum) / a[i, i];
            }
        }
        static void huidai()
        {
            for (int i = n - 1; i >= 0; i--)
            {
                double sum = 0;
                for (int j = i + 1; j < n; j++)
                {
                    sum = a[i, j] * x[j];
                }
                x[i] = (a[i, n] - sum) / a[i, i];
            }
            Console.WriteLine("解为：");
            for (int i = 0; i < n; i++)
            {
                Console.WriteLine("x{0}={1,6:f2}", i + 1, x[i]);
            }
        }
        static void input()
        {
            for (int i = 0; i < n; i++)
            {
                string s = "";
                for (int j = 0; j < n + 1; j++)
                {
                    s += string.Format("{0,-6:f2}", a[i, j]);
                }
                Console.WriteLine(s);
            }
        }
        static void Main(string[] args)
        {
            Console.WriteLine("请输入阶数：");
            n = Convert.ToInt16(Console.ReadLine());
            a = new double[n, n + 1];
            x = new double[n];
            Console.WriteLine("请输入各行系数：");
            for (int i = 0; i < n; i++)
            {
                string sa = Console.ReadLine();
                string[] ss = sa.Split(' ');
                for (int j = 0; j < n + 1; j++)
                {
                    a[i, j] = Convert.ToDouble(ss[j]);
                }
            }
            Console.WriteLine("矩阵系数为：");
            input();
            xiaoyuan();
            huidia();
            Console.WriteLine("方程解为：");
            for (int i = 0; i < n; i++)
            {
                Console.WriteLine("x{0}={1,6:f2}", i + 1, x[i]);
            }
        }
    }
}

结果：

谢谢！