Abstract

This letter shows that traditional Newton-Raphson (NR) method cannot achieve zero-convergence in presence of additive noise without adding a multiplicative gain. Furthermore, this gain needs to converge to zero. This article proposes a novel recursive algorithm providing optimal iterative-varying gains associated with the NR method. The development of the proposed optimal algorithm is based on minimizing a stochastic performance index. The estimation error covariance matrix is shown to converge to zero for linearized functions while considering additive zero-mean white noise. In addition, the proposed approach is capable of overcoming common drawbacks associated with the traditional NR method. Simulation results are included to illustrate the performance capabilities of the proposed algorithm. We show that the proposed recursive algorithm provides significant improvement over the traditional NR method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.