矩阵相乘算法

        /// <summary>
        /// 矩阵乘法
        /// </summary>
        /// <param name="A">矩阵A</param>
        /// <param name="B">矩阵B</param>
        /// <returns>返回矩阵C</returns>
        public double[,] multiply(double[,] A, double[,] B)
        {
            int Arow, Acolumn, Brow, Bcolumn;//分别为A、B矩阵的行数、列数
            Arow = A.GetLength(0);//GetLength（0）为获取A矩阵的行数
            Acolumn = A.GetLength(1);//GetLength（1）为获取B矩阵的列数
            Brow = B.GetLength(0);
            Bcolumn = B.GetLength(1);
            double[,] C = new double[Arow, Bcolumn];//相乘后的矩阵 将A的行数做为行数、将B的列数作为列数
            for (int i = 0; i < Arow; i++)//行数
            {
                for (int j = 0; j < Bcolumn; j++)//列数
                {
                    for (int k = 0; k < Acolumn; k++)
                    {
                        C[i, j] += A[i, k] * B[k, j];//计算A的列数个数的乘积的和
                    }
                }
            }
            return C;
        }