0 views

Uploaded by Editor IJAERD

Waste may be defined as any material that cannot be used again and does not represent any economic value to its owner. Solid Wastes are categorized into municipal wastes, hazardous wastes, medical wastes and radioactive wastes. In Indian cities rate of waste generation ranges between 200 - 870 grams/day, this depends upon the region’s lifestyle and the size of the city. The per capita waste generation is increasing by about 1.3% per year in India. The per capita rate of waste generation is strongly correlated to the gross domestic product (GDP) of a country. Now using the technology of new era and strategic approach, the concept of smart cities is coming up all around the world. A smart city is incomplete without a smart waste management system. This paper deals with the review of practices made for management of Solid waste in India. An attempt has been made to provide comprehensive review of the characteristics, generation, collection, transportation and disposal, treatment technologies of SWM practiced in India. This paper, focus on different way in which solid waste can be reducedto least possible amount.

save

- Mathematics Courses
- Algorithm for Raman Backward Pumping
- ne
- COMPUTING ALL THE REAL AND COMPLEX ROOTS OF A POLYNOMIAL EQUATION OF DEGREE ‘N’ WITH REAL COEFFICIENTS BASED UPON BAIRSTOW’S METHOD USING C PROGRAMMING.
- Mechanical-Nonlin 13.0 Ch01 Overview
- OMN-201704-110696-3-exercises-v2
- The Newton Raphson Method_2017
- dfh
- vol1-28-13
- Lesson 1-CHE 358
- Ch1-3.doc
- SEC-EEE-305-lec-9
- In Haskell, Less is More_2016
- Thesis Adityav
- Me to Do Newton Krylov
- pdf.pdf
- Course Gerdts Part2
- simplex-1
- Numerical Methods_ Fixed Point Iteration
- ijsrp-p2498.pdf
- Weighted Essentially Non-Oscillatory Schemes
- DAY Wise Programs in matlab software
- articol_1-1
- Wang Etal 2003 Cageo
- Problem 1C
- Gate
- CALCULUS II Sequences and Series
- Module for Graeffe
- A Stabilization Procedure for Soil-water Coupled Problems Using the Element-free Galerkin Method
- 02bracketingmethods-101108031223-phpapp02
- A Study on Different Failures of Composite Materials-IJAERDV04I0978320
- An Enhance Expert System for Diagnosis of Diabetes Using Fuzzy Rules Over PIMA Dataset-IJAERDV04I0996134
- Analysis of a Structure With Magneto-rheological Fluid Damper-IJAERDV04I0917914
- An Analysis of Water Governance in India- Problems and Remedies-IJAERDV04I0953541
- A Critical Review on Flow, Heat Transfer Characteristics and Correlations of Helically Coiled Heat Exchanger-IJAERDV04I0972560
- A Review- On Solid Waste Management in Smart Cities-IJAERDV04I0922901
- Analytic Study of Phase Shift Crystal Structure and Temperature Dependent Dielectric Properties of Modified Synthesis One System Ceramics Using BNT-BZT-IJAERDV04I0937657
- A Study on Tall Structure With Soft Stories at Various Level by Non-Linear Analysis-IJAERDV04I0928305
- A Study to Determine the Effectiveness of Psychoneurobics on Memory Among High School Children Aged 14 to 16; A Pilot Study-ijaerdv04i0950904
- An Improved Mobility Aware Clustering Based MAC Protocol for Safety Message Dissemination in VANET-IJAERDV04I0970094
- Analysis of Vendor’s for Machine Tool Manufacturing Industries With Fuzzy Inference Decision Support System- Modelling Tool-IJAERDV04I0977668
- A Review on Solar Photovoltaic Powerplant-ijaerdv04i0992895
- Antecedents of the Students’ Acceptance of Online Courses- A Test of UTAUT in the Context of Sri Lankan Higher Education-IJAERDV04I0991102N
- An Efficient and Secure AMDMM Routing Protocol in MANET-IJAERDV04I0874842
- A Survey on Different Techniques of CBIR-IJAERDV04I0921177
- A Survey on Performance Evaluation of VPN-IJAERDV04I0324072
- A Novel Design “Binary to Gray Converter” With QCA Nanotechnology-IJAERDV04I0999722
- A Review on Optimization of Bus Driver Scheduling-IJAERDV04I0373755 (1)
- A Review on Mood Prediction Based Music System-IJAERDV04I0355925
- A Combined Approach WNN for ECG Feature Based Disease Classification-IJAERDV04I0932888
- A Study on Speed Breakers-IJAERDV04I0363450
- A Survey on Content Based Video Retrieval Using Mpeg-7 Visual Descriptors-ijaerdv04i0399438
- A Review Pneumatic Bumper for Four Wheeler Using Two Cylinder-IJAERDV04I0342284
- Design of 5-Bit Flash ADC Through Domino Logic in 180nm, 90nm, And 45nm Technology-IJAERDV04I0819867
- A SURVEY ON NEW HORIZONS FOR HEALTH THROUGH MOBILE TECHNOLOGIES-IJAERDV04I0334966.pdf
- A SURVEY ON CONTENT BASED VIDEO RETRIEVAL USING MPEG-7 VISUAL DESCRIPTORS-IJAERDV04I0399438.pdf
- A Review of Studies on Ultrasonic Welding-IJAERDV04I0977419
- A Concept-Based Approach for Entity Matching-IJAERDV04I0965828

You are on page 1of 5

**Scientific Journal of Impact Factor (SJIF): 4.72
**

p-ISSN (P): 2348-6406

**International Journal of Advance Engineering and Research
**

Development

Volume 4, Issue 9, September -2017

**A Six-Order Method for Non-linear Equations to Find Roots
**

Manoj Kumar Singh and Arvind K. Singh*

**Department of Mathematics, Institute of Science,
**

Banaras Hindu University, Varanasi-221005, India

Abstract- In this paper, new variant of Newton's method based on harmonic mean has been discussed and its sixth order

convergence has been established. The method generates a sequence converging to the root with a suitable choice of

initial approximation 𝑥0 . In terms of computational cost, it requires evaluations of only two functions and two first order

derivatives per iteration and the efficiency index of the proposed method is 1.5651. Proposed method has been compared

with some existing methods. Proposed method is free from the evaluation of the second order derivative of the given

function as required in the family of Chebyshev–Halley type methods. The efficiency of the method is verified on a

number of numerical examples.

Keywords- Newton's method, Iteration function, Order of convergence, Function evaluations, Efficiency index.

I. INTRODUCTION

**In many branch of science and engineering, the nonlinear and transcendental problems of the form 𝑓(𝑥) = 0, are
**

complex in nature. Since the exact solution of the problems are not always possible by the usual algebraic process,

therefore numerical iterative methods such as Newton, secant methods are often used to obtain the approximate solution

of such problems. Though these methods are very effective, but there are some limitations that they do not give the result

as fast as required and takes several iterations or some time methods fails. There are so many methods developed on the

improvement of quadratically convergent Newton’s method so as to get a better convergence order than Newton. This

paper is concerned with the iterative methods for finding a simple root α, i.e. 𝑓(𝛼) = 0, and 𝑓′(𝛼) ≠ 0 of 𝑓(𝑥) = 0,

where f : R → R, be the continuously differentiable real function.

Now we consider the problem of finding a real zero of a function 𝑓: 𝐼 ⊂ 𝑅 𝑅. It can be determined as a fixed point

of some iteration function 𝑔 by means of the one-point iteration method 𝑥𝑛+1 = 𝑔(𝑥𝑛 ), 𝑛 = 0, 1, ⋯, where 𝑥0 is the

starting value, The best known and the most widely used example of these types of methods is the classical Newton's

method given by

𝑓(𝑥 𝑛 )

𝑥𝑛+1 = 𝑥𝑛 − 𝑛 = 0, 1, ⋯ (1)

𝑓ʹ 𝑥 𝑛

**It converges quadratically to simple zeros and linearly to multiple zeros. In the literature, some of its modifications
**

have been introduced in order to accelerate it or to get a method with a higher order of convergence at the expense of

additional evaluations of functions, derivatives and changes in the points of iterations. If we consider the definition of

efficiency index as 𝑝1/𝑚 where 𝑝 is the order of the method and 𝑚 is the number of functions evaluations required by the

method (units of work per iteration), then the efficiency index of this method is 1.414. All these modifications are in the

direction of increasing the local order of convergence to increase the efficiency index. The method developed by

Weerakoon et. al. [1], called as trapezoidal Newton's method or arithmetic mean Newton's method, suggests for some

other variants of Newton's method. Frontini et. al. [9] developed new modifications of Newton’s method to produce

iterative methods with third order of convergence and efficiency index 1.442. With the same efficiency index, Ozban [2],

and Traub [23] developed a third order method requiring one function and two first derivatives evaluations per iteration.

Chen [10] described some new iterative formulae having third order convergence. Ostrowski [7] developed both third

and fourth order methods each requiring evaluations of two functions and one derivative per iteration. Neta [19]

developed a family of sixth order methods which requires evaluations of three functions and one first derivative per

iteration. Sharma et. al. [22] developed a one parameter family of sixth order methods based on Ostrowski fourth order

multipoint method. Each family required three evaluations of the given function and one evaluation of the derivative per

iteration. Chun [6] presented a one parameter family of variants of Jarratt’s fourth order method for solving nonlinear

equations. It is shown there that the order of convergence of each family member is improved from four to six even

though it adds one evaluation of the function at the point iterated by Jarratt’s method per iteration. Kou et al. [11–13]

presented a family of new variants of Chebyshev–Halley methods and also an improvement of Jarratt method. These new

methods have sixth order of convergence although they only add one evaluation of the function at the point iterated by

Chebyshev–Halley method and Jarratt method. Parhi et. al. [20] developed a sixth order method for nonlinear equations,

by extending a third order method of Weerakoon et. al. [1] requires evaluations of two functions and two first derivatives

per iteration.

**@IJAERD-2017, All rights Reserved 587
**

International Journal of Advance Engineering and Research Development (IJAERD)

Volume 4, Issue 9, September-2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

II. DEFINITIONS

**Definition 1: If the sequence {𝑥𝑛 /𝑛 ≥ 0} tends to a limit α in such a way that
**

𝑥 𝑛 +1 −𝛼

lim𝑥 𝑛 →𝛼 =𝐶 (2)

(𝑥 𝑛 − 𝛼 )𝑝

**for some 𝐶 ≠ 0 and 𝑝 ≥ 1, then the order of convergence of the sequence is said to be 𝑝, and 𝐶 is known as asymptotic
**

error constant.

When 𝑝 = 1, 𝑝 = 2 or 𝑝 = 3, the sequence is said to convergence lineally, quadratically and cubically respectively. The

value of 𝑝 is called the order of convergence of the method which produces the sequence {𝑥𝑛 : 𝑛 ≥ 0}. Let 𝑒𝑛 = 𝑥𝑛 − 𝛼

then the relation 𝑒𝑛+1 = 𝐶𝑒𝑛 𝑝 + 𝑂(𝑒𝑛 𝑝+1 ) is called the error equation for the method, 𝑝 being the order of convergence.

Definition 2: Efficiency index is simply defined as 𝑝1/𝑚 where 𝑝 is the order of the method and 𝑚 is the number of

functions evaluations required by the method (units of work per iteration).

Therefore, the efficiency index of Newton´s method is 1.414 and iterative methods with order of convergence three has

efficiency index 1.442.

III. DESCRIPTION OF THE METHODS

**Let α be a simple zero of a sufficiently differentiable function 𝑓 and consider the numerical solution of the equation
𝑓**

𝑥 = 0, then

𝑥

𝑓(𝑥) = 𝑓(𝑥𝑛 )+ 𝑥𝑛

𝑓´(𝑡)dt. (3)

**Approximating 𝑓′ by 𝑓´(𝑥𝑛 ) on the interval [𝑥𝑛 , 𝑥], we get the value (𝑥 − 𝑥𝑛 )𝑓′(𝑥𝑛 ) for the integral in (3) and then
**

putting 𝑥 = 𝛼, we get, 0 ≈ 𝑓(𝑥𝑛 ) + ( 𝛼 − 𝑥𝑛 )𝑓ʹ 𝑥𝑛 , therefore, an approximation for α, known as Newton’s method, is

given by 𝑥𝑛+1 = 𝑥𝑛 − 𝑓(𝑥𝑛 ) 𝑓ʹ 𝑥𝑛 , 𝑛 = 0, 1, ⋯. On the other hand, if we approximate the integral in (3) by the

trapezoidal rule and then putting 𝑥 = 𝛼, we obtain, 0 ≈ 𝑓 𝑥𝑛 + (1/2)(𝛼 − 𝑥𝑛 )(𝑓ʹ 𝑥𝑛 + 𝑓´(𝛼)). Therefore, an

approximation 𝑥𝑛+1 for α is given by

2𝑓(𝑥 𝑛 )

𝑥𝑛+1 = 𝑥𝑛 − .

𝑓ʹ(𝑥 𝑛 )+𝑓ʹ(𝑥 𝑛 +1 )

Approximating the (𝑛 + 1)𝑡 value by the Newton's method on the right-hand side of the above equation, we have,

2𝑓 (𝑥 𝑛 )

𝑥𝑛+1 = 𝑥𝑛 − , where 𝑧𝑛+1 = 𝑥𝑛 − 𝑓(𝑥𝑛 )/𝑓ʹ(𝑥𝑛 ) (4)

𝑓ʹ(𝑥 𝑛 )+𝑓ʹ(𝑧 𝑛 +1 )

for 𝑛 = 0, 1,2, ⋯, the trapezoidal Newton's method of Weerakoon et. al. [1]. Rewriting equation (4) as

𝑓(𝑥 𝑛 )

𝑥𝑛+1 = 𝑥𝑛 − (𝑓ʹ 𝑥 , 𝑛 = 0, 1, ⋯,

𝑛 +𝑓ʹ 𝑧 𝑛 +1 )/2

and further we rewrite as:

𝑓(𝑥 𝑛 )

𝑧𝑛 = 𝑥𝑛 − (𝑓ʹ 𝑥 , 𝑛 = 0, 1, ⋯, (5)

𝑛 +𝑓ʹ 𝑦𝑛 )/2

**So, this variant of Newton’s method can be viewed as obtained by using arithmetic mean of 𝑓ʹ 𝑥𝑛 and 𝑓ʹ 𝑦𝑛 instead of
𝑓**

ʹ 𝑥𝑛 in Newton̒s method defined by (1) which was called as arithmetic mean Newton’s method.

3.1. New Variant of Newton’s Method

In (5) if we use the harmonic mean instead of arithmetic mean we get

𝑓(𝑥 )

𝑦𝑛 = 𝑥𝑛 − 𝑓ʹ 𝑥𝑛 , (6)

𝑛

1 1 1

𝑧𝑛 = 𝑥𝑛 − 2 𝑓(𝑥𝑛 ) + 𝑓ʹ . (7)

𝑓ʹ 𝑥 𝑛 𝑦𝑛

Again

**@IJAERD-2017, All rights Reserved 588
**

International Journal of Advance Engineering and Research Development (IJAERD)

Volume 4, Issue 9, September-2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

𝑓(𝑧 )

𝑥𝑛+1 = 𝑧𝑛 − 𝑓ʹ 𝑧𝑛 , 𝑛 = 0,1,2, ⋯ (8)

𝑛

**Now using the linear interpolation on two points (𝑥𝑛 , 𝑓ʹ 𝑥𝑛 ) and (𝑦𝑛 , 𝑓ʹ 𝑦𝑛 ), we get,
**

𝑥 − 𝑥𝑛 𝑥− 𝑦𝑛

𝑓ʹ 𝑥 ≈ 𝑦 𝑓ʹ 𝑦𝑛 + 𝑥 𝑓ʹ 𝑥𝑛 (9)

𝑛 − 𝑥𝑛 𝑛 − 𝑦𝑛

𝑧𝑛 − 𝑥 𝑛 𝑧 −𝑦

Thus, we approximate 𝑓ʹ 𝑧𝑛 as: 𝑓ʹ 𝑧𝑛 ≈ 𝑓ʹ 𝑦𝑛 + 𝑥𝑛 − 𝑦𝑛 𝑓ʹ 𝑥𝑛 , then

𝑦𝑛 − 𝑥 𝑛 𝑛 𝑛

1

𝑓ʹ 𝑧𝑛 ≈ 2𝑓ʹ 𝑦 2𝑓ʹ 𝑥𝑛 𝑓ʹ 𝑦𝑛 − 𝑓ʹ 𝑥𝑛 ² + 𝑓ʹ 𝑦𝑛 ² . (10)

𝑛

Therefore the proposed method can be written as follows:

𝑓(𝑥 ) 1 1 1

𝑦𝑛 = 𝑥𝑛 − 𝑓ʹ 𝑥𝑛 , 𝑧𝑛 = 𝑥𝑛 − 𝑓(𝑥𝑛 ) + 𝑓ʹ , (11)

𝑛 2 𝑓ʹ 𝑥 𝑛 𝑦𝑛

2𝑓 𝑧 𝑛 𝑓ʹ 𝑦𝑛

𝑥𝑛+1 = 𝑧𝑛 − 2𝑓ʹ . (12)

𝑥 𝑛 𝑓ʹ 𝑦𝑛 − 𝑓ʹ 𝑥 𝑛 ²+ 𝑓ʹ 𝑦𝑛 ²

Clearly this method requires evaluations of only two functions f and two derivative f´ and no second order derivative of f.

IV. CONVERGENCE ANALYSIS

**Theorem 1: Let 𝛼 ∈ 𝐼 be a simple zero of a sufficiently differentiable function f: 𝐼 ⊂ 𝑅 𝑅 for an open interval 𝛪. If 𝑥0
**

is sufficiently close to α, then the methods defined by (12) has six order convergence.

Proof. Since 𝛼 ∈ 𝐼 is a simple zero of 𝑓, then, we have,

1

𝑓(𝑥𝑛 ) = 𝑓ʹ(𝛼) [ 𝑒𝑛 +𝐶2 𝑒𝑛2 +𝐶3 𝑒𝑛3 +O(𝑒𝑛4 )], where 𝐶𝑗 = 𝑓 (𝑗 ) (α)/𝑓ʹ(𝛼), (13)

𝑗!

𝑓ʹ(𝑥𝑛 ) = 𝑓ʹ(α) [1 + 2𝐶₂ 𝑒𝑛 + 3𝐶₃𝑒𝑛2 + 4𝐶₄ 𝑒𝑛3 + 𝑂(𝑒𝑛4 )]. (14)

**Now from equations (13), (14), we have, 𝑓(𝑥𝑛 ) 𝑓ʹ 𝑥𝑛 = 𝑒𝑛 − 𝐶2 𝑒𝑛2 + (2𝐶22 − 2𝐶3 )𝑒𝑛3 + 𝑂(𝑒𝑛4 ). Therefore, from the
**

first equation of (11), we get, 𝑦𝑛 = α + C₂𝑒𝑛2 + (2𝐶₃-2𝐶22 )𝑒𝑛3 +O(𝑒𝑛4 ). Now expanding 𝑓′(𝑦𝑛 ) about α, we get,

𝑓ʹ(𝑦𝑛 ) = 𝑓ʹ(𝛼)[1 + 2𝐶22 𝑒𝑛2 + 4𝐶2 (𝐶3 − 𝐶22 )𝑒𝑛3 + 𝑂(𝑒𝑛4 )]. (15)

Substituting the value of equations (13), (14) and (15) in second equation of (11), we get,

1 1 1

𝑧𝑛 = 𝛼 + 𝑒𝑛 − 2 𝑒𝑛 + 𝐶2 𝑒𝑛2 + 𝐶3 𝑒𝑛3 + 𝑂 𝑒𝑛4 2 + 1+2𝐶 2 𝑒 2 +4𝐶 2 3 4

1+2𝐶 2 𝑒𝑛 +3𝐶 3𝑒 𝑛 +4𝐶 4 𝑒𝑛3 +𝑂 𝑒𝑛4 2 𝑛 2 (𝐶3 −𝐶2 )𝑒𝑛 +𝑂(𝑒𝑛 )

1

⇒ 𝑧𝑛 = 𝛼 + 2 𝐶3 𝑒𝑛3 + 𝑂 𝑒𝑛4 .

Again

𝑓ʹ 𝑥𝑛 𝑓ʹ 𝑦𝑛 = 𝑓ʹ 𝛼 2

[1 + 2𝐶2 𝑒𝑛 + 2𝐶22 + 3𝐶3 𝑒𝑛2 + 4(𝐶2 𝐶3 + 𝐶4 )𝑒𝑛3 + 𝑂(𝑒𝑛4 )],

𝑓ʹ 𝑥𝑛 2

= 𝑓ʹ 𝛼 2

[1 + 4𝐶2 𝑒𝑛 + 4𝐶22 + 6𝐶3 𝑒𝑛2 + (12𝐶2 𝐶3 + 8𝐶4 )𝑒𝑛3 + 𝑂(𝑒𝑛4 )],

𝑓ʹ 𝑦𝑛 2

= 𝑓ʹ 𝛼 2

[1 + 4𝐶22 𝑒𝑛2 + (8𝐶2 𝐶3 − 8𝐶23 )𝑒𝑛3 + 𝑂(𝑒𝑛4 )].

𝑓(𝑧 𝑛 )

Therefore from equation (10), we have, 𝑓ʹ 𝑧𝑛 ≈ 𝑓ʹ 𝛼 [1 − 2𝐶2 𝐶3 𝑒𝑛3 + 𝑂(𝑒𝑛4 )]. Hence from 𝑥𝑛+1 = 𝑧𝑛 − 𝑓ʹ , we get,

𝑧𝑛

1 1 1

𝑥𝑛+1 = 𝛼 + 2 𝐶3 𝑒𝑛3 + 𝑂 𝑒𝑛4 − 𝑓 𝛼 + 2 𝐶3 𝑒𝑛3 + 𝑂 𝑒𝑛4 [1 − 2𝐶2 𝐶3 𝑒𝑛3 + 𝑂(𝑒𝑛4 )]−1 .

𝑓ʹ 𝛼

**Using Taylor’s expansion and the fact that 𝑓 𝛼 = 0, we get,
**

3

𝑒𝑛+1 = − 4 𝐶2 𝐶32 𝑒𝑛6 + 𝑂 𝑒𝑛7 .

**@IJAERD-2017, All rights Reserved 589
**

International Journal of Advance Engineering and Research Development (IJAERD)

Volume 4, Issue 9, September-2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

**This shows that method defined by (12) has sixth order convergence.
**

Remark: If second order derivative or third order derivative is be zero at the root then the order of convergence increases

up to seven or eight.

V. NUMERICAL RESULTS AND CONCLUSION

In this section, we presented the results of some numerical tests to compare the efficiency of the proposed method. In

Table 1, we give the number of iterations (N) and the number of function evaluations (NOFE) required satisfying the

stopping criterion. PM denotes proposed method. Kou and Li is the method [13], an improvement of Jarratt method.

Gupta denotes for [20] Parhi and Gupta, A sixth order method for nonlinear equations. Numerical computations have

been carried out in MATLAB. The stopping criterion has been taken as |𝑥𝑛+1 – α|+ |f (𝑥𝑛+1 )| < 10−14 . In Table 1 for

simple roots following test functions have been used.

**Table 1 - Comparison with existing sixth order methods
**

N NOFE

F(𝑥) 𝑥0

Kou and Li Gupta PM Kou and Li Gupta PM

(a) -0.7 17 33 4 68 132 16

1 2 2 2 8 8 8

3 2 3 2 8 12 8

(b) 0.3 4 4 4 16 16 12

2 2 2 2 8 8 8

3 2 2 2 8 8 8

(c) 0.5 4 5 4 16 20 16

2 2 2 2 8 8 8

3 2 2 2 8 8 8

(d) 0.3 2 3 2 8 12 8

1 2 2 2 8 8 8

(e) 0.3 2 2 2 8 8 8

0.5 2 2 2 8 8 8

0.7 3 2 2 12 8 8

(f) 0.1 5 4 4 20 16 16

2.5 2 2 2 8 8 8

3.5 3 3 3 12 12 12

(g) 0.8 3 3 3 12 12 12

1.5 3 4 3 12 16 12

(h) 2 2 2 2 8 8 8

3 2 2 2 8 8 8

4 3 3 3 12 12 12

**(i) 1 180 9 57 720 36 228
**

3.5 5 6 5 20 24 20

4.5 8 11 9 320 44 36

(a) 𝑥³ + 4 𝑥² - I0, α = 1.365230013414097,

(b) sin²𝑥 - 𝑥² + 1, α = - 1.404491648215341,

(c) 𝑥³-10 α = 2.154434690031884,

(d) 𝑥³ - 𝑒 −𝑥 α = 0.772882959149210,

(e) 𝑥 sin (1/𝑥) - 0.2 𝑒 −𝑥 , α = 0.363715708657122,

(f) (𝑥 - 1)³ - 1, α = 2,

(g) 𝑥 10 − 1, α=1

(h) 𝑥 3 − 𝑒 −𝑥 − 3𝑥 + 2, α = 0.257530285439861

(i) (𝑥 − 2)23 – 1, α = 3.

Thus the proposed sixth order method for finding simple real roots of nonlinear equations, is free from second order

derivative of the given function, as required in the family of Chebyshev–Halley type methods. Method proposed in this

paper requires evaluations of two functions and evaluations two first order derivatives per iteration. The convergence

analysis of the method is performed to show that the order of convergence of the method is six. The high order

convergence is also corroborated by numerical tests

**@IJAERD-2017, All rights Reserved 590
**

International Journal of Advance Engineering and Research Development (IJAERD)

Volume 4, Issue 9, September-2017, e-ISSN: 2348 - 4470, print-ISSN: 2348-6406

Method has the efficiency index equal to 1.5651, which is better to Newton’s method with efficiency index equal to

1.414 and the classical third order methods (1.442), such as Weerakoon and Fernando method, Chebyshev’s method,

Halley’s method and Super-Halley method, fifth order method (1.495) of Kou, Li, Wang [24]. When compared with the

sixth order methods of Parhi, Gupta, [20] and Kou and Li [13], proposed method behaves either similarly or better on the

examples considered.

REFERENCES

**[1] S. Weerakoon, T.G.I. Fernando, “A variant of Newton’s method with accelerated third-order convergence”, Appl.
**

Math. Lett. 13 (2000) 87–93.

[2] A.Y.Ozban , “Some new variants of Newton̒s method”, Applied Mathematics Letters 17, (2004), 677- 682.

[3] T. Lukic, N.M. Ralevie, “Geometric mean Newton̒s method for simple and multiple roots ”, Applied

Mathematics Letters 21,(2008) 30-36.

[4] M. Igarashi, “A termination criterion for iterative methods used to find the zeros of polynomials”, Math. Comp. 42,

165-171, (1984).

[5] C. Chun, “Iterative methods improving Newton’s method by the decomposition method”, Comput. Math. Appl. 50

(2005) 1559–1568.

[6] C. Chun, “Some improvements of Jarratt’s method with sixth-order convergence”, Appl. Math. Comput. 190 (2007)

1432–1437.

[7] M. Ostrowski, “Solution of Equations and Systems of Equations”, Academic Press Inc., 1966.

[8] D.M. Young, R.T. Gregory, “A Survey of Numerical Methods”, Dover, New York, 1988.

[9] M. Frontini, E. Sormani, “Some variant of Newton’s method with third-order convergence”, Appl. Math. Comput.

140 (2003) 419–426.

[10] Jinhai Chen, “Some new iterative methods with three-order convergence”, Appl. Math. Comput. 181 (2006) 1519–

1522.

[11] J. Kou, X. Wang, “Sixth-order variants of Chebyshev–Halley methods for solving non-linear equations”, Appl.

Math. Comput. 190 (2007) 1839–1843.

[12] J. Kou, “On Chebyshev–Halley methods with sixth-order convergence for solving non-linear equations”, Appl.

Math. Comput. 190 (2007) 126–131.

[13] J. Kou, Y. Li, “An improvement of Jarratt method”, Appl. Math. Comput. 189 (2007) 1816–1821.

[14] M. Grau, M. Noguera, “A variant of Cauchy’s method with accelerated fifth-order convergence”, Appl. Math. Lett.

17 (2004) 509–517.

[15] E. Halley, “A new, exact and easy method of finding the roots of equations generally, and that without any

previous reduction”, Phil. Roy. Soc. Lond. 18 (1964) 136–145.

[16] F.A. Potra, V. Ptak, “Non discrete induction and iterative processes, Research”, Notes in Mathematics, vol. 103,

Pitman, Boston, MA, 1984.

[17] J.M. Ortega, W.C. Rheinboldt, “Iterative Solution of Nonlinear Equations in Several Variables”, Academic Press,

New York, 1970.

[18] W. Gautschi, “Numerical Analysis: An Introduction, Birkhäuser”, 1997.

[19] B. Neta, “A sixth order family of methods for nonlinear equations”, Int. J. Comput. Math. 7 (1979) 157–161.

[20] S.K. Parhi, D.K. Gupta, “A sixth order method for nonlinear equations”, Applied Mathematics and Computation

203 (2008) 50–55

[21] J.M. Gutierrez, M.A. Herandez, “A family of Chebyshev–Halley type methods in Banach spaces”, Bull. Aust.

Math. Soc. 55 (1997) 113–130.

[22] J.R. Sharma, R.K. Guha, “A family of modified Ostrowski methods with accelerated sixth order convergence”,

Appl. Math. Comput. 190 (2007) 111–115.

[23] J.F. Traub, “Iterative Methods for the Solution of Equations”, Prentice Hall, Clifford, NJ, 1964.

[24] Jisheng Kou, Yitian Li, Xiuhua Wang, “Some modifications of Newton’s method with fifth order convergence”,

Journal of Computational and Applied Mathematics 209 (2009) 146-152.

@IJAERD-2017, All rights Reserved 591

- Mathematics CoursesUploaded bychrislake12
- Algorithm for Raman Backward PumpingUploaded byBharath Lagishetty
- neUploaded byعلاوي المدريدي
- COMPUTING ALL THE REAL AND COMPLEX ROOTS OF A POLYNOMIAL EQUATION OF DEGREE ‘N’ WITH REAL COEFFICIENTS BASED UPON BAIRSTOW’S METHOD USING C PROGRAMMING.Uploaded byDipak Majhi
- Mechanical-Nonlin 13.0 Ch01 OverviewUploaded byShaheen S. Ratnani
- OMN-201704-110696-3-exercises-v2Uploaded byDelger Amar
- The Newton Raphson Method_2017Uploaded byNajwaAinayaZawaid
- dfhUploaded byNeeraj Yadav
- vol1-28-13Uploaded bymaleckisale
- Lesson 1-CHE 358Uploaded bypercydziks
- Ch1-3.docUploaded byThasarathan Ravichandran
- SEC-EEE-305-lec-9Uploaded byShahadat Hussain Parvez
- In Haskell, Less is More_2016Uploaded bygerschgersch
- Thesis AdityavUploaded byUmmang Srivastava
- Me to Do Newton KrylovUploaded byJulio Cesar Barraza Bernaola
- pdf.pdfUploaded byhikol
- Course Gerdts Part2Uploaded bymCmAl
- simplex-1Uploaded bynarendra.naren12342389
- Numerical Methods_ Fixed Point IterationUploaded byMizanur Rahman
- ijsrp-p2498.pdfUploaded byIJSRP ORG
- Weighted Essentially Non-Oscillatory SchemesUploaded bymecharash
- DAY Wise Programs in matlab softwareUploaded bynav_vrg
- articol_1-1Uploaded byvrubio66
- Wang Etal 2003 CageoUploaded byIrwandi Irwandi
- Problem 1CUploaded byMunavvar
- GateUploaded byChandan Kumar Bera
- CALCULUS II Sequences and SeriesUploaded bythestudent007
- Module for GraeffeUploaded bykarlapangilinan
- A Stabilization Procedure for Soil-water Coupled Problems Using the Element-free Galerkin MethodUploaded byVietnhut Phan
- 02bracketingmethods-101108031223-phpapp02Uploaded byshamsukarim2009

- A Study on Different Failures of Composite Materials-IJAERDV04I0978320Uploaded byEditor IJAERD
- An Enhance Expert System for Diagnosis of Diabetes Using Fuzzy Rules Over PIMA Dataset-IJAERDV04I0996134Uploaded byEditor IJAERD
- Analysis of a Structure With Magneto-rheological Fluid Damper-IJAERDV04I0917914Uploaded byEditor IJAERD
- An Analysis of Water Governance in India- Problems and Remedies-IJAERDV04I0953541Uploaded byEditor IJAERD
- A Critical Review on Flow, Heat Transfer Characteristics and Correlations of Helically Coiled Heat Exchanger-IJAERDV04I0972560Uploaded byEditor IJAERD
- A Review- On Solid Waste Management in Smart Cities-IJAERDV04I0922901Uploaded byEditor IJAERD
- Analytic Study of Phase Shift Crystal Structure and Temperature Dependent Dielectric Properties of Modified Synthesis One System Ceramics Using BNT-BZT-IJAERDV04I0937657Uploaded byEditor IJAERD
- A Study on Tall Structure With Soft Stories at Various Level by Non-Linear Analysis-IJAERDV04I0928305Uploaded byEditor IJAERD
- A Study to Determine the Effectiveness of Psychoneurobics on Memory Among High School Children Aged 14 to 16; A Pilot Study-ijaerdv04i0950904Uploaded byEditor IJAERD
- An Improved Mobility Aware Clustering Based MAC Protocol for Safety Message Dissemination in VANET-IJAERDV04I0970094Uploaded byEditor IJAERD
- Analysis of Vendor’s for Machine Tool Manufacturing Industries With Fuzzy Inference Decision Support System- Modelling Tool-IJAERDV04I0977668Uploaded byEditor IJAERD
- A Review on Solar Photovoltaic Powerplant-ijaerdv04i0992895Uploaded byEditor IJAERD
- Antecedents of the Students’ Acceptance of Online Courses- A Test of UTAUT in the Context of Sri Lankan Higher Education-IJAERDV04I0991102NUploaded byEditor IJAERD
- An Efficient and Secure AMDMM Routing Protocol in MANET-IJAERDV04I0874842Uploaded byEditor IJAERD
- A Survey on Different Techniques of CBIR-IJAERDV04I0921177Uploaded byEditor IJAERD
- A Survey on Performance Evaluation of VPN-IJAERDV04I0324072Uploaded byEditor IJAERD
- A Novel Design “Binary to Gray Converter” With QCA Nanotechnology-IJAERDV04I0999722Uploaded byEditor IJAERD
- A Review on Optimization of Bus Driver Scheduling-IJAERDV04I0373755 (1)Uploaded byEditor IJAERD
- A Review on Mood Prediction Based Music System-IJAERDV04I0355925Uploaded byEditor IJAERD
- A Combined Approach WNN for ECG Feature Based Disease Classification-IJAERDV04I0932888Uploaded byEditor IJAERD
- A Study on Speed Breakers-IJAERDV04I0363450Uploaded byEditor IJAERD
- A Survey on Content Based Video Retrieval Using Mpeg-7 Visual Descriptors-ijaerdv04i0399438Uploaded byEditor IJAERD
- A Review Pneumatic Bumper for Four Wheeler Using Two Cylinder-IJAERDV04I0342284Uploaded byEditor IJAERD
- Design of 5-Bit Flash ADC Through Domino Logic in 180nm, 90nm, And 45nm Technology-IJAERDV04I0819867Uploaded byEditor IJAERD
- A SURVEY ON NEW HORIZONS FOR HEALTH THROUGH MOBILE TECHNOLOGIES-IJAERDV04I0334966.pdfUploaded byEditor IJAERD
- A SURVEY ON CONTENT BASED VIDEO RETRIEVAL USING MPEG-7 VISUAL DESCRIPTORS-IJAERDV04I0399438.pdfUploaded byEditor IJAERD
- A Review of Studies on Ultrasonic Welding-IJAERDV04I0977419Uploaded byEditor IJAERD
- A Concept-Based Approach for Entity Matching-IJAERDV04I0965828Uploaded byEditor IJAERD