行列式两种求值算法的比较  

Comparison between two determinant evaluation algorithms

作　　者：卫洪春[1] 

机构地区：[1]四川文理学院计算机科学系,四川达州635000

出　　处：《现代电子技术》2014年第4期25-27,共3页Modern Electronics Technique

基　　金：国家自然科学基金(61152003);四川省青年基金(10ZB085)

摘　　要：为了实现科技和工程技术领域中对有限元线性方程组的快速求解,首先需判断该线性方程组所对应的行列式的值是否为零。若该值不为零,则线性方程组有惟一确定的解;否则,线性方程组的解不惟一。利用行列式的基本性质、代数余子式、定理,采用递归程序设计方法,设计了两种算法,用以求解行列式的值;并从运算精度和运行效率上比较了这两种算法,得出了这两种算法各自的适用环境。In order to quickly solve the value offinite element linear equations in the fields of science,technology and engi-neering,The first step is to judge that the determinant’s value corresponding to the given linear equations is zero or not. If the value is nonzero,linear equations have only one determinate solution. Otherwise,the answer is not determinate. Two algorithms were designed by using determinant＆#39;s basic nature,algebraic complement,relevant theorem and recursive programming methods to solve the determinant＆#39;s value. The two algorithms were compared in calculative accuracy and operational efficiency. The appli-cation environment of each algorithm was achieved.

关 键 词：递归程序设计方法 行列式算法 运行效率 线性方程 

分 类 号：TN911.34[电子电信—通信与信息系统]