摘要
指出线性方程组原始矩阵的条件数与算法无关，因而用该条件数衡量直接法稳定性不科学，提出算法的求解矩阵与算法直接相关，因此用求解矩阵的条件数反映算法稳定性更为合理的新见解。
This paper points out the condition number of original coefficient matrix of hnear equations has nothing to do with the algo- rithm itself, so it is not scientific by using this condition number to measure the stability of direct methods. Because the solving matrix is associated with the algorithm itself directly, we present a new opinion that using the condition number of the solving matrix to reflect the sta- bility of algorithm is more reasonable.
作者
王静
WANG Jing （Teaching Research Office of Computer, North-Sichuan Medical Institute, Nanchong 637000, China）
出处
《电脑知识与技术》
2012年第6期3940-3941,共2页
Computer Knowledge and Technology
关键词
直接法
算法
条件数
稳定性
direct methods
algorithm
condition number
stability
