摘要
将矩阵An×n的Doolittle分解推广到Am×n上,并在常规的迭代算法上加以创新,给出了递归的分解算法.在实现算法的过程中,对数据进行了巧妙处理,使中间数据及最终计算结果都具有分数形式,提高了结果的精确度,而且更符合人们阅读的习惯.经过运行测试,算法设计合理,程序运行高效准确.程序是对MathSoft公司的交互式的数学文字软件Mathcad的矩阵分解的数值计算扩充到符号运算.
Apply Doolittle＇s factorization of matrix An×n to matrix Am×n that has m rows and n columns, and conceive a new recursive algorithm of Doolittle＇s factorization of matrix on the basis of traditional iterative algorithm. In the realization of algorithm, the data is skillfully dealt, so the interim data and the result have the form of fraction. These merits improve the result＇s exactness. And above that it conforms to readers＇ reading habit compared to double or float forms. After running it, the result proves that the algorithm is reasonably designed and the program is running with high proficiency and exactness. The program is an augmentation of matrix factorization in the MathSoft＇s interactive mathematic language software, which promotes matrix factorization from numerical computation to symbolic computation.
出处
《智能系统学报》
2007年第1期90-93,共4页
CAAI Transactions on Intelligent Systems
