Approximate Globally Convergent Algorithm with Applications in Electrical Prospecting

Author(s):  
John Bondestam Malmberg ◽  
Larisa Beilina
Author(s):  
M. R. Farmer ◽  
G. Loizou

AbstractA globally convergent algorithm is presented for the total, or partial, factorization of a polynomial. Firstly, a circle is found containing all the zeros. Secondly, a search procedure locates smaller circles, each containing a zero, and the multiplicities are then calculated. Thirdly, a simultaneous Iteration Function is used to accelerate convergence. The Iteration Function is chosen from a class of such functions derived herein to deal with the general case of multiple zeros; various properties of these functions are also discussed. Finally, sample numerical results are given which demon-strate the effectiveness of the algorithm.


2010 ◽  
Vol 26 (4) ◽  
pp. 045003 ◽  
Author(s):  
Michael V Klibanov ◽  
Michael A Fiddy ◽  
Larisa Beilina ◽  
Natee Pantong ◽  
John Schenk

2015 ◽  
Vol 3 (3) ◽  
pp. 263-296 ◽  
Author(s):  
Abdeslam Kadrani ◽  
Jean Pierre Dussault ◽  
Abdelhamid Benchakroun

2017 ◽  
Vol 345 ◽  
pp. 17-32 ◽  
Author(s):  
Dinh-Liem Nguyen ◽  
Michael V. Klibanov ◽  
Loc H. Nguyen ◽  
Aleksandr E. Kolesov ◽  
Michael A. Fiddy ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document