| 解线性方程组的一种新的迭代法 |
| |
| 引用本文： | 龙建辉.解线性方程组的一种新的迭代法[J].福建建筑高等专科学校学报,2010(4):352-354,423. |
| |
| 作者姓名： | 龙建辉 |
| |
| 作者单位： | 福建工程学院数理系,福建福州350108 |
| |
| 基金项目： | 高校博士点基金（20060532014）; 福建省自然科学基金（2009J05001）; 福建工程学院院基金（E0600073 GY-Z0893） |
| |
| 摘 要： | 提出了解线性方程的新迭代算法,证明了当系数矩阵严格对角占优,不可约弱对角占优,对称正定时该方法收敛.给出新迭代算法的迭代矩阵的谱半径的上界.数值例子说明新方法在选取合适的参数的情况下,收敛较快。
|
| 关 键 词： | 线性方程组 迭代法 收敛 算法. |
A new iterative method for resolving linear equation systems |
| |
| Long Jianhui.A new iterative method for resolving linear equation systems[J].Journal of Fujian College of Architecture & C.E.,2010(4):352-354,423. |
| |
| Authors: | Long Jianhui |
| |
| Affiliation: | Long Jianhui(Mathematics and Physics Department,Fujian University of Technology,Fuzhou 350108,China) |
| |
| Abstract: | A new iterative method for solving linear equation systems is obtained.The convergence of the method is proved when the coefficient matrix is a strictly diagonally dominant matrix by rows,or irreducible weak diagonal dominant matrix by rows or symmetric positive definite matrix.Upper bound for the spectral radius of the iterative method is given.Numerical results show that the method with the proper choice of the parameter can converge rapidly. |
| |
| Keywords: | linear system iterative method convergence algorithm |
| 本文献已被 维普 等数据库收录！ |
