| 求解矩阵方程AX=B几种算法的比较 |
| |
| 引用本文： | 农利伟.求解矩阵方程AX=B几种算法的比较[J].计算机时代,2012(1):36-37. |
| |
| 作者姓名： | 农利伟 |
| |
| 作者单位： | 南宁地区教育学院数学系,广西南宁,530001 |
| |
| 摘 要： | 探究了求解矩阵方程AX=B的广义共轭残量法（GCR）、正交极小化法（ORTHOMIN）、重开始的广义共轭残量法（GCR（k））、重开始的正交极小化法（ORTHOMIN（k））等四种算法的迭代思想,讨论了算法的收敛性和收敛速度;用数值实验比较四种算法的性能,得出了重开始的广义共轭残量法能更好地求解大规模矩阵方程的结论。
|
| 关 键 词： | 矩阵方程 迭代法 广义共轭残量法 正交极小化法 |
Comparison of some algorithms for solving matrix equation AX=B |
| |
| Nong Liwei.Comparison of some algorithms for solving matrix equation AX=B[J].Computer Era,2012(1):36-37. |
| |
| Authors: | Nong Liwei |
| |
| Affiliation: | Nong Liwei(Dept.of Mathematics,Nanning Prefecture Education College,Nanning,Guangxi 530001,China) |
| |
| Abstract: | We explore the iterative ideas of four algorithms for solving matrix equation AX=B,they are generalized conjugate residual（GCR）,orthogonal minimum（ORTHOMIN）,restarted generalized conjugate residual（GCR（k）） and restarted orthogonal minimum（ORTHOMIN（k））,and discuss their convergence and convergence rate;compare the performances of the four algorithms by numerical experiments,and draw the conclusion that the restarted generalized conjugate residual algorithm can solve large-scale matrix equation better. |
| |
| Keywords: | matrix equation iterative algorithm GCR ORTHOMIN |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
