最高阶非零子式的简便算法  

A simple algorithm of the highest order nonzero subdeterminant

作　　者：陈洪海[1] 孙璐[1] 朱捷[1] 王佳秋[1] 赵淑莹[1] 

机构地区：[1]黑龙江科技学院理学院,黑龙江哈尔滨150027

出　　处：《高师理科学刊》2012年第3期81-82,共2页Journal of Science of Teachers＇College and University

基　　金：黑龙江省高等教育学会"十二五"期间教育科学研究规划课题(HGJXHB2 110879)

摘　　要：讨论了矩阵最高阶非零子式常用的2种算法及其求解原理,指出这2种算法的固有缺点.给出了最高阶非零子式的新算法,该算法提高了求最高阶非零子式的速度和准确性.总结分析了这几种算法的优劣及适用条件.Discusses two commonly algorithms and its solving principle of the highest order nonzero subdeterminant, point out their inherent shortcomings. Gave a new method of solving the highest order nonzero subdeterminant, the algorithms improve the speed and accuracy of problem solving. Analysed the advantages and disadvantages of each solutions and their applicability.

关 键 词：矩阵 行阶梯形 最高阶非零子式 

分 类 号：O15[理学—数学] G642.0[理学—基础数学]