高阶紧密交替符号补矩阵的秩的算法  

Algorithm for Rank of High Order Dense Alternating Sign Complement Matrices

作　　者：张容[1] 邵燕灵[1] ZHANG Rong SHAO Yan-ling(School of Science, North University of China, Taiyuan 030051, China)

机构地区：[1]中北大学理学院,太原030051

出　　处：《重庆理工大学学报（自然科学）》2017年第3期175-180,共6页Journal of Chongqing University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(11071227);山西省回国留学人员科研资助项目(12-070)

摘　　要：定义了紧密交替符号矩阵的补矩阵,利用矩阵的初等变换,研究了该矩阵秩的求解过程。最后,当n≥5k时,提出了该矩阵的秩的计算算法,并给出了一个实例验证了算法的可行性。The defination of dense alternating sign complement matrices was proposed and the solving process of the rank of this matrices was researched by elementary operation. Finally,when n≥5k,we give a calculation algorithm for rank and provide a practical example to verify the feasibility of the algorithm.

关 键 词：紧密交替符号矩阵 补矩阵 秩的算法 

分 类 号：O157[理学—数学]