Borsch-Supan-like methods: Point estimation and parallel implementation

被引:6
作者
Petkovic, M [1 ]
Herceg, D [1 ]
机构
[1] UNIV NOVI SAD, INST MATH, YU-21000 NOVI SAD, YUGOSLAVIA
关键词
zeros of polynomials; simultaneous methods; convergence; parallel implementation;
D O I
10.1080/00207169708804595
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we consider Borsch-Supan's method and its modification with Weierstrass' correction. These methods are suitable for the simultaneous approximation of all simple zeros of polynominals and have the convergence order three and four, respectively. In the first part we give an initial condition for the safe convergence of the method with correction. This condition depends only on attainable data and has a practical importance. In the second part the comparison of the considered two methods on MIMD parallel computers (synchronous and asynchronous implementation) are studied.
引用
收藏
页码:327 / 341
页数:15
相关论文
共 18 条
[1]  
[Anonymous], 1989, ITERATIVE METHODS SI
[2]   ASYNCHRONOUS ITERATIVE METHODS FOR MULTIPROCESSORS [J].
BAUDET, GM .
JOURNAL OF THE ACM, 1978, 25 (02) :226-244
[3]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[4]  
BOMANNS L, 1989, 1ST P EUR WORKSH HYP, P93
[5]  
BORSCHSUPAN W, 1970, NUMER MATH, V14, P380
[6]   SIMULTANEOUS INCLUSION OF ZEROS OF A POLYNOMIAL [J].
BRAESS, D ;
HADELER, KP .
NUMERISCHE MATHEMATIK, 1973, 21 (02) :161-165
[7]  
CARSTENSEN C, 1991, Z ANGEW MATH MECH, V71, pT809
[8]   ON ITERATION METHODS WITHOUT DERIVATIVES FOR THE SIMULTANEOUS DETERMINATION OF POLYNOMIAL ZEROS [J].
CARSTENSEN, C ;
PETKOVIC, MS .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1993, 45 (03) :251-266
[9]   ANALYSIS OF ASYNCHRONOUS POLYNOMIAL ROOT FINDING METHODS ON A DISTRIBUTED-MEMORY MULTICOMPUTER [J].
COSNARD, M ;
FRAIGNIAUD, P .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (06) :639-648
[10]  
COSNARD M, 1990, PARALLEL COMPUT, V15, P75, DOI 10.1016/0167-8191(90)90032-5