C# 矩阵运算与实现

2 篇文章 0 订阅
1 篇文章 0 订阅

如果只是简单的矩阵运算,不想调用第三方库,可以自己实现矩阵运算,直接上代码:

 public class Matrix
    {
        private double[,] matrix;

        /// <summary>
        /// 初始化矩阵
        /// </summary>
        /// <param name="x"></param>
        /// <param name="y"></param>
        public Matrix(int x, int y)
        {
            this.matrix = new double[x, y];
            this.Width = x;
            this.Height = y;
        }

        /// <summary>
        /// 矩阵索引器
        /// </summary>
        /// <param name="x"></param>
        /// <param name="y"></param>
        /// <returns></returns>
        public double this[int x, int y]
        {
            get { return this.matrix[x, y]; }
            set { this.matrix[x, y] = value; }
        }

        /// <summary>
        /// 获取列
        /// </summary>
        /// <param name="c">列索引</param>
        /// <returns></returns>
        public double[] GetColumn(int c)
        {
            double[] column = new double[this.Width];
            for (int i = 0; i < this.Width; i++)
            {
                column[i] = this.matrix[i, c];
            }
            return column;

        }

        /// <summary>
        /// 获取行
        /// </summary>
        /// <param name="r">行索引</param>
        /// <returns></returns>
        public double[] GetRow(int r)
        {
            double[] row = new double[this.Height];
            for (int i = 0; i < this.Height; i++)
            {
                row[i] = this.matrix[r, i];
            }

            return row;
        }

        /// <summary>
        /// 宽
        /// </summary>
        public int Width { get; private set; }

        /// <summary>
        /// 高
        /// </summary>
        public int Height { get; private set; }
        public static Matrix operator +(Matrix m1, Matrix m2)
        {
            Matrix m = new Matrix(m1.Width, m1.Height);
            for (int i = 0; i < m.Width; i++)
            {
                for (int j = 0; j < m.Height; j++)
                {
                    m[i, j] = m1[i, j] + m2[i, j];
                }
            }
            return m;
        }

        public static Matrix operator -(Matrix m1, Matrix m2)
        {
            Matrix m = new Matrix(m1.Width, m1.Height);
            for (int i = 0; i < m.Width; i++)
            {
                for (int j = 0; j < m.Height; j++)
                {
                    m[i, j] = m1[i, j] - m2[i, j];
                }
            }
            return m;
        }
        public static Matrix operator *(Matrix m1, Matrix m2)
        {
            Matrix m = new Matrix(m1.Width, m1.Height);
            for (int i = 0; i < m.Width; i++)
            {
                for (int j = 0; j < m.Height; j++)
                {
                    m[i, j] = m1[i, j] * m2[i, j];
                }
            }
            return m;
        }

        public static Matrix operator /(Matrix m1, Matrix m2)
        {
            Matrix m = new Matrix(m1.Width, m1.Height);
            for (int i = 0; i < m.Width; i++)
            {
                for (int j = 0; j < m.Height; j++)
                {
                    m[i, j] = m1[i, j] / m2[i, j];
                }
            }
            return m;
        }
    }

以上代码已经实现了运算符重载,如 Matrix =Matrix1+Matrix2 ;

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 2
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值