2－块AOR迭代解最小二乘问题的最优收敛性

Optimal Convergence of Two-Block AOR Iteration for Solving Least Square Problems

讨论用２－块ＡＯＲ迭代法解大型稀疏最小二乘问题的收敛性，给出其收敛的充要条件及其收敛域．进而证明；当时，ＡＯＲ迭代矩阵的谱半径，它远比相应的最优２－块ＡＯＲ迭代矩阵的谱半径好得多．

For solving large-scale sparse least square problems,the author discusses the convergence of two-block AOR iterative method;and gives the necessary and sufficient conditions and the domain of its convergence;and further demonstrates that the spectral radius p (L(2)γ,ω) of two-block AOR optimal iterative matrix.