Computational effective modified Newton–Raphson algorithm for power harmonics parameters estimation

2018 ◽  
Vol 12 (5) ◽  
pp. 590-598 ◽  
Author(s):  
Predrag B. Petrović ◽  
Dimitrije Rozgić
1989 ◽  
Vol 3 (3) ◽  
pp. 397-403 ◽  
Author(s):  
P. Whittle

A condition expressed in Eq. (7) is given which, with one simplifying regularity condition, ensures that the policy-improvement algorithm is equivalent to application of the Newton–Raphson algorithm to an optimality condition. It is shown that this condition covers the two known cases of such equivalence, and another example is noted. The condition is believed to be necessary to within transformations of the problem, but this has not been proved.


2013 ◽  
Vol 23 (1) ◽  
pp. 117-129 ◽  
Author(s):  
Jiawen Bian ◽  
Huiming Peng ◽  
Jing Xing ◽  
Zhihui Liu ◽  
Hongwei Li

This paper considers parameter estimation of superimposed exponential signals in multiplicative and additive noise which are all independent and identically distributed. A modified Newton-Raphson algorithm is used to estimate the frequencies of the considered model, which is further used to estimate other linear parameters. It is proved that the modified Newton- Raphson algorithm is robust and the corresponding estimators of frequencies attain the same convergence rate with Least Squares Estimators (LSEs) under the same noise conditions, but it outperforms LSEs in terms of the mean squared errors. Finally, the effectiveness of the algorithm is verified by some numerical experiments.


2021 ◽  
Vol 68 (1) ◽  
pp. 17-46
Author(s):  
Adam Korczyński

Statistical practice requires various imperfections resulting from the nature of data to be addressed. Data containing different types of measurement errors and irregularities, such as missing observations, have to be modelled. The study presented in the paper concerns the application of the expectation-maximisation (EM) algorithm to calculate maximum likelihood estimates, using an autoregressive model as an example. The model allows describing a process observed only through measurements with certain level of precision and through more than one data series. The studied series are affected by a measurement error and interrupted in some time periods, which causes the information for parameters estimation and later for prediction to be less precise. The presented technique aims to compensate for missing data in time series. The missing data appear in the form of breaks in the source of the signal. The adjustment has been performed by the EM algorithm to a hybrid version, supplemented by the Newton-Raphson method. This technique allows the estimation of more complex models. The formulation of the substantive model of an autoregressive process affected by noise is outlined, as well as the adjustment introduced to overcome the issue of missing data. The extended version of the algorithm has been verified using sampled data from a model serving as an example for the examined process. The verification demonstrated that the joint EM and Newton-Raphson algorithms converged with a relatively small number of iterations and resulted in the restoration of the information lost due to missing data, providing more accurate predictions than the original algorithm. The study also features an example of the application of the supplemented algorithm to some empirical data (in the calculation of a forecasted demand for newspapers).


2021 ◽  
Vol 14 (3) ◽  
pp. 339-350
Author(s):  
Yueyong Shi ◽  
Jian Huang ◽  
Yuling Jiao ◽  
Yicheng Kang ◽  
Hu Zhang

2020 ◽  
Vol 11 (6) ◽  
pp. 5339-5356 ◽  
Author(s):  
Yushuai Li ◽  
David Wenzhong Gao ◽  
Wei Gao ◽  
Huaguang Zhang ◽  
Jianguo Zhou

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1118
Author(s):  
Sabharwal

Finding the roots of an equation is a fundamental problem in various fields, including numerical computing, social and physical sciences. Numerical techniques are used when an analytic solution is not available. There is not a single algorithm that works best for every function. We designed and implemented a new algorithm that is a dynamic blend of the bisection and regula falsi algorithms. The implementation results validate that the new algorithm outperforms both bisection and regula falsi algorithms. It is also observed that the new algorithm outperforms the secant algorithm and the Newton–Raphson algorithm because the new algorithm requires fewer computational iterations and is guaranteed to find a root. The theoretical and empirical evidence shows that the average computational complexity of the new algorithm is considerably less than that of the classical algorithms.


2007 ◽  
Vol 6 (1-3) ◽  
pp. 349-352 ◽  
Author(s):  
J. W. Jerome ◽  
P. R. Sievert ◽  
L. H. Ye ◽  
I. G. Kim ◽  
A. J. Freeman

1989 ◽  
Vol 3 (3) ◽  
pp. 393-396 ◽  
Author(s):  
J. M. McNamara

We consider a renewal reward process in continuous time. The supremum average reward, γ* for this process can be characterised as the unique root of a certain function. We show how one can apply the Newton–Raphson algorithm to obtain successive approximations to γ*, and show that the successive approximations so obtained are the same as those obtained by using the policy improvement technique.


Sign in / Sign up

Export Citation Format

Share Document