摘要
给出对任意的n×m阶相容性或不相容性线性代数方程组均有效的一种新的迭代算法 .证明了算法求解过程 .在经过m次迭代后 ,必然求得该方程组的理论上精确的解或最小二乘解 .分析了该算法的计算复杂度。
A new SISD iterative algorithm is put forward to effectively solve arbitrary con sistent or inconsistent system of linear algebraic equations. It is proved that accurate theoretic or least square solutions of the system can be obtained throu gh m iterations. In addition, the computational complexity, the numerical st ability and the inherent parallelism of the algorithm are discussed.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2003年第4期445-449,共5页
Journal of Southwest Jiaotong University
基金
中国工程物理研究院科学技术基金资助项目 (2 0 0 2 0 6 5 6 )
