SAFE STARTING REGIONS BY MIXED POINTS AND TIGHTENING

被引:32
作者
HONG, H
STAHL, V
机构
[1] Research Institute for Symbolic Computation, Johannes Kepler University, Linz
关键词
NONLINEAR EQUATION SYSTEMS; INTERVAL ARITHMETIC; SAFE STARTING REGIONS; TIGHTENING;
D O I
10.1007/BF02307383
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we present a method for finding safe starting regions for a given system of non-linear equations. The method is an improvement of the usual method which is based on the fixed point theorem. The improvement is obtained by enclosing the components of the equation system by univariate interval polynomials whose zero sets are found. This operation is called ''tightening''. Preliminary experiments show that the tightening operation usually reduces the number of bisections, and thus the computing time. The reduction seems to become more dramatic when the number of variables increases.
引用
收藏
页码:323 / 335
页数:13
相关论文
共 18 条
[11]  
MORGAN A. P., 1987, SOLVING POLYNOMIAL S
[12]  
Neumaier A., 1990, INTERVAL METHODS SYS
[13]  
OLDER W, 1990, 8 P BIENN C CAN SOC
[14]   A NOTE ON THE MOORE TEST FOR NON-LINEAR SYSTEMS [J].
QI, L .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1982, 19 (04) :851-857
[15]   SOLVING NON-LINEAR SYSTEMS WITH LEAST SIGNIFICANT BIT ACCURACY [J].
RUMP, SM .
COMPUTING, 1982, 29 (03) :183-200
[16]  
RUMP SM, 1984, COMPUTING S, V5, P147
[17]   SOME COMPUTABLE EXISTENCE, UNIQUENESS, AND CONVERGENCE TESTS FOR NONLINEAR-SYSTEMS [J].
SHEARER, JM ;
WOLFE, MA .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1985, 22 (06) :1200-1207
[18]  
WOLFE MA, 1988, RELIABILITY COMPUTIN, P229