摘要
本文对某些非线性方程组F(x)=0,导出了一个算法,用它可以迭代建立F(x)=0的解的紧致上、下界。算法基于某些矩阵的多分裂,因此具有自然的并行性。我们证明了趋向于解的界之收敛原则,给出了参数的收敛性区域并考察了方法的收敛速度。
For some systems of nonlinear equations F(x) = 0,we derive an algorithem which it-eratively constructs tight lower and upper bounds for the zeros of F. The algorithm is based on a multisplitting of certain matrices thus showing a natural parallelism. We prove criteria for the convergence of the bounds towards the zeros,give the regions of parameters for convergence and investigate the speed of convergence.
出处
《应用数学》
CSCD
北大核心
1995年第3期349-357,共9页
Mathematica Applicata
基金
The National Funds of Natural Science
关键词
非线性方程组
迭代法
并行算法
多分裂方法
Nonlinear system
Iterative method
Parallel algorithm
Multisplitting method
Interval algorithm
