萬盛學電腦網

您现在的位置: 萬盛學電腦網 >> 程式設計 >  >> 網路程式設計 >> 程式語言綜合

C# 矩陣運算完整實作:初始化、轉置、逆矩陣、乘法

前言

.NET 標準庫未內建矩陣型別,科學計算常需自行實作或引用 Math.NET Numerics。本文提供純 C# 矩陣類別,涵蓋初始化、轉置、逆矩陣(高斯-喬丹消去法)、乘法等核心運算,適合教學與輕量專案嵌入。

矩陣類別核心代碼

using System;

public class Matrix
{
    public readonly int Rows, Cols;
    private readonly double[,] data;

    public Matrix(int rows, int cols, double[,] data = null)
    {
        Rows = rows; Cols = cols;
        this.data = data ?? new double[rows, cols];
    }

    public double this[int r, int c]
    {
        get => data[r, c];
        set => data[r, c] = value;
    }

    // 靜態工廠:單位矩陣
    public static Matrix Identity(int n)
    {
        var m = new Matrix(n, n);
        for (int i = 0; i < n; i++) m[i, i] = 1;
        return m;
    }

    // 轉置
    public Matrix Transpose()
    {
        var t = new Matrix(Cols, Rows);
        for (int r = 0; r < Rows; r++)
            for (int c = 0; c < Cols; c++)
                t[c, r] = this[r, c];
        return t;
    }

    // 矩陣乘法
    public static Matrix operator *(Matrix A, Matrix B)
    {
        if (A.Cols != B.Rows)
            throw new InvalidOperationException("維度不合");
        var r = new Matrix(A.Rows, B.Cols);
        for (int i = 0; i < A.Rows; i++)
            for (int j = 0; j < B.Cols; j++)
                for (int k = 0; k < A.Cols; k++)
                    r[i, j] += A[i, k] * B[k, j];
        return r;
    }

    // 逆矩陣:高斯-喬丹消去法(擴充矩陣 [A|I] → [I|A⁻¹])
    public Matrix Inverse()
    {
        if (Rows != Cols) throw new InvalidOperationException("非方陣");
        int n = Rows;
        var aug = new Matrix(n, 2 * n);
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                aug[i, j] = this[i, j];
        for (int i = 0; i < n; i++) aug[i, n + i] = 1;

        for (int col = 0; col < n; col++)
        {
            // 尋找主元
            int pivot = col;
            for (int r = col + 1; r < n; r++)
                if (Math.Abs(aug[r, col]) > Math.Abs(aug[pivot, col])) pivot = r;
            if (Math.Abs(aug[pivot, col]) < 1e-12) throw new InvalidOperationException("奇異矩陣");

            // 交換列
            if (pivot != col)
                for (int c = 0; c < 2 * n; c++)
                {
                    var tmp = aug[col, c]; aug[col, c] = aug[pivot, c]; aug[pivot, c] = tmp;
                }

            // 歸一化主列
            double div = aug[col, col];
            for (int c = 0; c < 2 * n; c++) aug[col, c] /= div;

            // 消去其他列
            for (int r = 0; r < n; r++)
            {
                if (r == col) continue;
                double factor = aug[r, col];
                for (int c = 0; c < 2 * n; c++) aug[r, c] -= factor * aug[col, c];
            }
        }

        var inv = new Matrix(n, n);
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                inv[i, j] = aug[i, n + j];
        return inv;
    }

    public override string ToString()
    {
        var sb = new System.Text.StringBuilder();
        for (int r = 0; r < Rows; r++)
        {
            for (int c = 0; c < Cols; c++) sb.Append($"{this[r, c]:F4} ");
            sb.AppendLine();
        }
        return sb.ToString();
    }
}

使用範例

var A = new Matrix(3, 3, new[,] {
    {4, 3, 2},
    {3, 2, 1},
    {2, 1, 3}
});

Console.WriteLine("A:");
Console.WriteLine(A);

var Ainv = A.Inverse();
Console.WriteLine("A⁻¹:");
Console.WriteLine(Ainv);

Console.WriteLine("A * A⁻¹ (應為單位矩陣):");
Console.WriteLine(A * Ainv);

效能與數值穩定性提醒

  • 高斯-喬丹法 O(n³),適合中小型矩陣(< 100×100)。
  • 大型/疏矩陣請改用 LU 分解、QR 分解或疏矩陣庫(Math.NET、ALGLIB)。
  • 主元選擇(partial pivoting)已實作,減少數值誤差;極端病態矩陣仍可能不穩定。

結語

純 C# 實作矩陣運算能深入理解線性代數演算法細節。專案若需高效能、大規模計算,強烈建議直接引用 Math.NET Numerics(NuGet: MathNet.Numerics),提供 MKL 加速、平行運算、完整分解族群。

copyright © 萬盛學電腦網 all rights reserved