Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm

2008 ◽  
Vol 35 (2) ◽  
pp. 335-353 ◽  
Author(s):  
RAVI VARADHAN ◽  
CHRISTOPHE ROLAND
Keyword(s):  
Em Algorithm ◽  
Globally Convergent ◽  
Globally Convergent Methods

A globally convergent regularized ordered-subset EM algorithm for list-mode reconstruction

2004 ◽  
Vol 51 (3) ◽  
pp. 719-725 ◽  
Author(s):  
P. Khurd ◽  
Ing-Tsung Hsiao ◽  
A. Rangarajan ◽  
G. Gindi
Keyword(s):  
Em Algorithm ◽  
List Mode ◽  
Globally Convergent

scholarly journals New Highly Efficient Families of Higher-Order Methods for Simple Roots, Permittingf′(xn)=0

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Ramandeep Behl ◽  
V. Kanwar
Keyword(s):  
Higher Order ◽  
The Other ◽  
Robust Methods ◽  
Challenging Problem ◽  
Order Convergence ◽  
Dynamical Study ◽  
Globally Convergent ◽  
Special Cases ◽  
Globally Convergent Methods ◽  
Ostrowski’S Method

Construction of higher-order optimal and globally convergent methods for computing simple roots of nonlinear equations is an earliest and challenging problem in numerical analysis. Therefore, the aim of this paper is to present optimal and globally convergent families of King's method and Ostrowski's method having biquadratic and eight-order convergence, respectively, permittingf′(x)=0in the vicinity of the required root. Fourth-order King's family and Ostrowski's method can be seen as special cases of our proposed scheme. All the methods considered here are found to be more effective to the similar robust methods available in the literature. In their dynamical study, it has been observed that the proposed methods have equal or better stability and robustness as compared to the other methods.

Sign in / Sign up

Export Citation Format

Share Document