Abstract

This paper deals with a new numerical iterative method for finding the approximate solutions associated with both scalar and vector nonlinear equations. The iterative method proposed here is an extended version of the numerical procedure originally developed in previous works. The present study proposes to show that this new root-finding algorithm combined with a stationary-type iterative method (e.g., Gauss-Seidel or Jacobi) is able to provide a longer accurate solution than classical Newton-Raphson method. A numerical analysis of the developed iterative method is addressed and discussed on some specific equations and systems.

Highlights

  • Solving both nonlinear equations and systems is a situation very often encountered in various fields of formal or physical sciences

  • For Example 1 in the case of guest start point x10 = 10−2, we can see that approximate solutions x1k provided by Adaptative Geometric-based Algorithm” (AGA) with conditions [BC4], [BC5], and [BC6] in the first iterations are accurately better than Newton-Raphson Algorithm (NRA)/Standard Newton’s Algorithm (SNA) and Third-order Modified Newton Method (TMNM)

  • For Example 3 with guest start point couple (x10, x10) = (20, 20), we can observe that approximate solutions (x1k, x2k) given by AGA using Gauss-Seidel (GS) or Jacobi (J) procedure with: (i) condition [BC1] are more accurate numerically than NRA, TMNM, and SNA; (ii) conditions [BC2] and [BC3] are accurately better than NRA and SNA

Read more

Summary

Introduction

Solving both nonlinear equations and systems is a situation very often encountered in various fields of formal or physical sciences. For Example 3 with guest start point couple (x10, x10) = (20, 20), we can observe that approximate solutions (x1k, x2k) given by AGA using Gauss-Seidel (GS) or Jacobi (J) procedure with: (i) condition [BC1] are more accurate numerically than NRA, TMNM, and SNA; (ii) conditions [BC2] and [BC3] are accurately better than NRA (only in the first iterations) and SNA.

Results
Conclusion
Full Text
Paper version not known

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.