Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A new family of generalized quadrature methods for solving nonlinear equations

    https://doi.org/10.1142/S1793557122500449Cited by:1 (Source: Crossref)

    Weerakoon and Fernando [A variant of Newton’s method with accelerated third-order convergence, Appl. Math. Lett. 13 (2000) 87–93] were resorted on a trapezoidal quadrature rule to derive an arithmetic mean Newton method with third-order convergence of the iterative scheme to solve nonlinear equations. Different quadrature methods have been developed, which form a special class of third-order iterative schemes requiring three evaluations of functions on [f(xn),f(xn),f(yn)] per iteration, where yn is generated from the first Newton step. As an extension of these methods, we derive a new family of iterative schemes by using a new weight function H to generalize the quadrature methods, of which (xn+1xn)f(xn)/H signifies an approximate area under the curve f(x) between xn and xn+1. Then, a generalization of the midpoint Newton method is obtained by using another weight function, which is based on three evaluations of functions on [f(xn),f(xn),f((xn+yn)/2)] per iteration. The sufficient conditions of these two weight functions are derived, which guarantee that the convergence order of the proposed iterative schemes is three.

    Communicated by N. C. Wong

    AMSC: 41A25, 65D99, 65H05