摘要
基于矩阵分裂与区间松弛算子导出了两种区间松弛迭代法,方法不用求矩阵 的逆且比已知的Hansen迭代法更快地收敛到解;其中有些算法具有平方收敛。此外, 应用Newton—SOR方法构造的点序列比区间的边界序列更快地收敛到解。文中还给出 数值例子。
On the basis of the splitting matirx and the introduction of interval relaxation operators, two new interval relaxation iteration methods are presented. The new algorithm need not compute inverse matrix and they converge faster to the solution than the known Hansen interval method. In some cases square convergence occurs. In addition, apply the Newton SOR method for constructing a sequence of real vectors which converges faster to the solution. Some numerical examples are given.
出处
《清华大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
1990年第3期23-30,共8页
Journal of Tsinghua University(Science and Technology)
基金
国家自然科学基金
关键词
区间迭代法
非线性方程组
阵分裂
interval iteration method, nonlinear systems, splitting matrix