C# 实数矩阵行列式计算

Wesley13
• 阅读 513

原文链接: C# 实数矩阵行列式计算

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

namespace MatrixHandler {
    class Num {
        int numerator = 0;
        int denominator = 1;


        public static Num operator *(Num n1, Num n2) {

            return new Num(n1.Numerator * n2.Numerator, n1.Denominator * n2.Denominator);
        }
        public static Num operator /(Num n1, Num n2) {
            if (n1.Numerator < 0 && n2.Numerator < 0)
                return new Num(-n1.Numerator * n2.Denominator, n1.Denominator * -n2.Numerator);
            return new Num(n1.Numerator * n2.Denominator, n1.Denominator * n2.Numerator);
        }

        public static Num operator +(Num n1, Num n2) {
            return new Num(n1.Numerator * n2.Denominator + n2.Numerator * n1.Denominator, n1.Denominator * n2.Denominator);
        }

        public static Num operator -(Num n1, Num n2) {
            return new Num(n1.Numerator * n2.Denominator - n2.Numerator * n1.Denominator, n1.Denominator * n2.Denominator);
        }
        public static Num operator -(Num n) {
            return new Num(-n.Numerator, n.Denominator);
        }
        public Num getCopy() {
            return new Num(Numerator, Denominator);
        }
        public int Numerator {
            get {
                return numerator;
            }

            set {
                numerator = value;
            }
        }

        public int Denominator {
            get {
                return denominator;
            }

            set {
                denominator = value;
            }
        }

        public Num(int numerator, int denominator) {
            this.Numerator = numerator;
            this.Denominator = denominator;
            reduce();
        }
        public Num() { }
        public Num(string s) {

            if (s.IndexOf('.') != -1) {
                string[] str = s.Split('.');
                Numerator = Convert.ToInt32(str[0] + str[1]);
                Denominator = tenPow(str[1].Length);
            } else if (s.IndexOf('/') != -1) {
                string[] str = s.Split('/');
                Numerator = Convert.ToInt32(str[0]);
                Denominator = Convert.ToInt32(str[1]);
            } else {
                Numerator = Convert.ToInt32(s);
            }

            reduce();
        }
        public Num(int val) {
            Denominator = 1;
            Numerator = val;
        }
        public override string ToString() {
            return denominator == 1 ? Numerator + "" : Numerator + "/" + Denominator;
        }


        public int gcd(int a, int b) {
            int m = Math.Abs(a);
            int n = Math.Abs(b);
            int t;
            while (m != 0) {
                t = n % m;
                n = m;
                m = t;
            }
            return n;
        }

        private void reduce() {
            int t = gcd(Numerator, Denominator);
            Denominator /= t;
            Numerator /= t;
            if (Numerator == 0)
                Denominator = 1;

            if (Numerator > 0 != Denominator > 0) {
                Numerator = -Math.Abs(Numerator);
                Denominator = Math.Abs(Denominator);
            }
        }

        private int tenPow(int n) {
            int res = 1;
            while (n != 0) {
                res *= 10;
                --n;
            }
            return res;
        }
    }
}

矩阵类

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace MatrixHandler {
    class Matrix {
        Num[,] nums;
        int n;

        internal Num[,] Nums {
            get {
                return nums;
            }

            set {
                nums = value;
            }
        }

        public int N {
            get {
                return n;
            }

            set {
                n = value;
            }
        }

        public  Matrix(Num[,] nums,int n) {
            this.Nums = nums;
            this.N = n;
        }

    
        
        //余子式
        public Matrix getM(int x,int y) {
            if (N < 2) return null;
            Num[,] temp = new Num[N - 1, N - 1];
            for(int i = 0; i < N; ++i) {
                for(int j = 0; j < N; ++j) {
                    if (i < x && j < y) { temp[i, j] = Nums[i, j].getCopy(); }
                    if(i<x && j > y) { temp[i, j-1] = Nums[i, j].getCopy(); }
                    if(i>x && j < y) { temp[i - 1, j] = Nums[i, j].getCopy(); }
                    if(i>x && j > y) { temp[i - 1, j - 1] = Nums[i, j].getCopy(); }
                }
            }
            return new Matrix(temp, N - 1);
        }

        public Num getVal() {
            if (N == 1)
                return Nums[0, 0];
            if (N == 2)
                return Nums[0, 0] * Nums[1, 1] - Nums[0, 1] * Nums[1, 0];
            Num res = new Num(0);
            int t = 1;
            for(int i = 0; i < N; ++i) {                
                res = res + nums[0,i] * (new Num(t)) * (getM(0, i).getVal().getCopy());
                t *= -1;
            }

            return res;
        }
         
        public Matrix getInverse() {
            Num val = getVal().getCopy();
           
            Num[,] temp = new Num[N, N];
            Num[,] com = getCompany().Nums;
            for (int i = 0; i < N; ++i) {
                for(int j = 0; j < N; ++j) {
                    temp[i,j] = (com[i, j]/val).getCopy();
                }
            }
            Matrix res = new Matrix(temp,n);
            return res;
        }
         
        public Matrix getCompany() {
            Num[,] temp = new Num[N,N];
            for(int i = 0; i < N; ++i) {
                for(int j = 0; j < N; ++j) {
                    int t = (i + j) % 2 == 0 ? 1 : -1;
                    temp[j, i] = ( this.getM(i,j).getVal() * (new Num(t))).getCopy();
                }
            }
            Matrix res=new Matrix(temp,N);
            return res;
        }
        public override string ToString() {
            string res="";
            int x=0, y=0;
            for (x = 0; x < N; ++x) {
                for (y = 0; y < N; ++y) {
                    res += Nums[x, y];
                    if (y == N - 1) res += "\n";
                    else res += "\t";
                }
                
            }
            return res;
        }
    }
}


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

namespace MatrixHandler {
    class Program {

        delegate void Handler();
        static void Main(string[] args) {    
            while (true) {
                mainView();
            }
        }

       public static void mainView(){
            Console.WriteLine("实矩阵行列式计算,请选择功能:\n1,行列式求值\t2,矩阵求逆\t3,矩阵求伴随");
            try {
                int flag = Convert.ToInt32(Console.ReadLine());
                Handler[] h = new Handler[3];
                h[0] = new Handler(getVal);
                h[1] = new Handler(getInverse);
                h[2] = new Handler(getCompany);
                Console.WriteLine("请输入矩阵");
                h[flag - 1].Invoke();
               
            } catch (Exception) {
                Console.WriteLine("格式错误!数字之间只能输入一个空格!且本程序只能处理方阵.");               
            }
            

        }

        public static void getVal() {
            Matrix m = getMatrix();
            Console.WriteLine("输入的行列式为:\n"+m+"该行列式的值为:"+m.getVal());
        }

        public static void getInverse() {
            Matrix m = getMatrix();
            if (m.getVal().Numerator == 0)
                Console.WriteLine("该矩阵不可逆!");
            else
                Console.WriteLine("输入的矩阵为:\n" + m + "该矩阵的逆矩阵为:\n" + m.getInverse());
        }

        public static void getCompany() {
            Matrix m = getMatrix();
            Console.WriteLine("输入的矩阵为:\n" + m + "该矩阵的伴随矩阵为:\n" + m.getCompany());
        }

        public static Matrix getMatrix() {
            string s = Console.ReadLine();
            string[] row =  s.Split(' ');
            int n = row.Length;
            Num[,] nums = new Num[n,n];
            for (int i = 0; i < n; ++i)
                nums[0,i] = new Num(row[i]).getCopy();

            for(int i = 1; i < n; ++i) {              
                    string st = Console.ReadLine();
                    string[] rowt = st.Split(' ');
                    for(int j=0;j<n;++j)
                        nums[i, j] = new Num(rowt[j]).getCopy();               
            }

            return new Matrix(nums, n);
        }

    }
}
点赞
收藏
评论区
推荐文章
blmius blmius
3年前
MySQL:[Err] 1292 - Incorrect datetime value: ‘0000-00-00 00:00:00‘ for column ‘CREATE_TIME‘ at row 1
文章目录问题用navicat导入数据时,报错:原因这是因为当前的MySQL不支持datetime为0的情况。解决修改sql\mode:sql\mode:SQLMode定义了MySQL应支持的SQL语法、数据校验等,这样可以更容易地在不同的环境中使用MySQL。全局s
皕杰报表之UUID
​在我们用皕杰报表工具设计填报报表时,如何在新增行里自动增加id呢?能新增整数排序id吗?目前可以在新增行里自动增加id,但只能用uuid函数增加UUID编码,不能新增整数排序id。uuid函数说明:获取一个UUID,可以在填报表中用来创建数据ID语法:uuid()或uuid(sep)参数说明:sep布尔值,生成的uuid中是否包含分隔符'',缺省为
Jacquelyn38 Jacquelyn38
3年前
2020年前端实用代码段,为你的工作保驾护航
有空的时候,自己总结了几个代码段,在开发中也经常使用,谢谢。1、使用解构获取json数据let jsonData  id: 1,status: "OK",data: 'a', 'b';let  id, status, data: number   jsonData;console.log(id, status, number )
Wesley13 Wesley13
3年前
Java获得今日零时零分零秒的时间(Date型)
publicDatezeroTime()throwsParseException{    DatetimenewDate();    SimpleDateFormatsimpnewSimpleDateFormat("yyyyMMdd00:00:00");    SimpleDateFormatsimp2newS
Stella981 Stella981
3年前
Python之time模块的时间戳、时间字符串格式化与转换
Python处理时间和时间戳的内置模块就有time,和datetime两个,本文先说time模块。关于时间戳的几个概念时间戳,根据1970年1月1日00:00:00开始按秒计算的偏移量。时间元组(struct_time),包含9个元素。 time.struct_time(tm_y
Wesley13 Wesley13
3年前
mysql设置时区
mysql设置时区mysql\_query("SETtime\_zone'8:00'")ordie('时区设置失败,请联系管理员!');中国在东8区所以加8方法二:selectcount(user\_id)asdevice,CONVERT\_TZ(FROM\_UNIXTIME(reg\_time),'08:00','0
Wesley13 Wesley13
3年前
00:Java简单了解
浅谈Java之概述Java是SUN(StanfordUniversityNetwork),斯坦福大学网络公司)1995年推出的一门高级编程语言。Java是一种面向Internet的编程语言。随着Java技术在web方面的不断成熟,已经成为Web应用程序的首选开发语言。Java是简单易学,完全面向对象,安全可靠,与平台无关的编程语言。
Stella981 Stella981
3年前
Django中Admin中的一些参数配置
设置在列表中显示的字段,id为django模型默认的主键list_display('id','name','sex','profession','email','qq','phone','status','create_time')设置在列表可编辑字段list_editable
Wesley13 Wesley13
3年前
MySQL部分从库上面因为大量的临时表tmp_table造成慢查询
背景描述Time:20190124T00:08:14.70572408:00User@Host:@Id:Schema:sentrymetaLast_errno:0Killed:0Query_time:0.315758Lock_
Python进阶者 Python进阶者
10个月前
Excel中这日期老是出来00:00:00,怎么用Pandas把这个去除
大家好,我是皮皮。一、前言前几天在Python白银交流群【上海新年人】问了一个Pandas数据筛选的问题。问题如下:这日期老是出来00:00:00,怎么把这个去除。二、实现过程后来【论草莓如何成为冻干莓】给了一个思路和代码如下:pd.toexcel之前把这