0 Up votes0 Down votes

2 views3 pagesDec 25, 2017

© © All Rights Reserved

PDF, TXT or read online from Scribd

© All Rights Reserved

2 views

© All Rights Reserved

- Basic Calculus
- STQP2034 Tutorial 3
- Goal Plot 4
- Numerical Analysis and Computer Programming
- DLS
- Lecture6 SS
- Ch2Introduction to Polynomials
- Lesson Plan Numec
- Power Flow Example.xls
- CubicEquation.xls
- PGDTez
- Assg5 (1)
- Numerical Methods by Jain & Iyengar
- wafwqa
- 129120899 Syllabus for 1st Year
- PHY_F313
- 777_1
- Cube of a Binomial.docx
- soil structure.pdf
- Civil Syllabus

You are on page 1of 3

Equations

Apichat Neamvonk

Department of Mathematics, Faculty of Science,

Burapha University, Chonburi, Thailand.

Email: Apichat [AT] buu.ac.th

_________________________________________________________________________________

ABSTRACT— A Modified Regula Falsi method based on classic Regula Falsi method or False Position method for

solving nonlinear equations is proposed in this paper. The method is verified on a number of test examples and

numerical results obtained shows that the proposed method is very effective with respect to the classic Regula Falsi

method and the other methods.

_________________________________________________________________________________

1. INTRODUCTION

In practical problem of finding roots of a nonlinear equation where good initial estimates of the roots are known,

there are several of computationally efficient algorithms available which can be programmed for using on a computer.

However, in which earlier information on the location of the root of difficult problems are poor because the methods

often fail to converge. So, this paper is an attempt to investigate for a method which based on classic Regula Falsi

method. We consider the nonlinear equation

f ( x ) 0, (1)

where f is a continuously differentiable on [ a, b] and has at least one root, r , in [ a, b] . The well-known

quadratically convergent Newton method and its variants are iterative formula generally used for finding a root of (1).

But, these methods may fail to converge in case the initial point is far from root or the derivative vanishes in the vicinity

of the root. One of the oldest and best well known of these methods is Regula Falsi method (RF) in [2] which for solving

(1) consists of successive application of the following two statements:

af ( b ) b ( f ( a )

(i) Setup an initial interval [ a, b] including the root, r , take c f (b ) f ( a ) as an approximation of r where c is

the root of the linear interpolation polynomial of f in [ a, b] .

(ii) Replace the interval [ a, b] with [ a, c ] if f ( a ) f (c ) 0 or with [c, b] if f ( a ) f (c ) 0 .

The iterative process is repeated until one stopping criterion is attained. For example, the interaction is continued

either one or both of the convergence criteria are satisfied ci 1 ci or f (c) where is small positive

numbers. Some modifications overcoming these difficulties have been discussed in [1,2]. Dowell and Jarratt [2] proposed

modifications of Regula Falsi method to increase its asymptotic rate of convergence from linear to super-linear.

2. MODIFIED METHOD

Let r be a root of the nonlinear equation (1) in [ a, b] and f ( a ) f (b) 0 to guarantee that r is a simple root of (1)

af ( b ) b ( f ( a )

in [ a, b] . We start with compute an approximation point of the root (1), c f (b ) f ( a ) which straight line, L , joining the

points (a, f (a)) and (b, f (b)) intersecting the x-axis by RF. By the position of root r , we have four main cases:

case 1: Figure 1 (top left) both b, c, d are same side

case 2: Figure 1 (bottom left) both a, d are same side but b, c are different side

where point d

(1 k ) af ( b ) bf ( a )

(1 k ) f ( b ) f ( a ) for case 1, 2 is intersecting between line L and y bkf(ab ) ( x a) ,

case 3: Figure 1 (top right) both a, c, d are same side

Asian Journal of Applied Sciences (ISSN: 2321 – 0893)

Volume 03 – Issue 04, August 2015

case 4: Figure 1 (bottom right) both a, c are same side but b, d are different side

(1 k ) bf ( a ) af ( b ) kf ( a )

where point d (1 k ) f ( a ) f ( b ) for case 3, 4 is intersecting between line L and y f (a) ba

( x a) .

case 1 case 3

case 2 case 4

Figure 1: Four cases of the new approximation point, d which are case 1 (top left), case 2 (bottom left),

case 3 (top right) and case 4 (bottom right).

3. ALGORITHM

A modified Regula Falsi will have four steps:

(i) Set [ a, b] is an initial interval which has at least one root in the interval,

af ( b ) b ( f ( a )

(ii) compute c f (b ) f ( a )

(1 k ) af ( b ) bf ( a )

(ii) if f ( a ) f (c ) 0 set k , compute d

2 f (c)

b c (1 k ) f ( b ) f ( a ) and

if f (d ) f ( a ) 0 set b d (case 1)

else set b c and a d (case 2)

(1 k ) bf ( a ) af ( b )

else if f ( a ) f (c ) 0 set k , compute d

0.5 f ( c )

b c (1 k ) f ( a ) f ( b ) and

if f ( d ) f (a ) 0 set a d (case 3)

else set a c and b d . (case 4)

(iv) if f (d ) then stop

else set i i 1 and go to step (ii).

Asian Journal of Applied Sciences (ISSN: 2321 – 0893)

Volume 03 – Issue 04, August 2015

4. RESULTS

Table 1 presents comparison of the iteration number between Regula Falsi (RF), IRF from [1] and the present work

(MRF) with 1 10 .

10

Table 1: The number of iteration of RF, IRF and MRF methods for specifics precision

Iteration of

Equation Initial interval xn

RF IRF MRF

xe x 1 0 1,1 22 7 6 0.5671433083

11x 1 0

11

0.1,0.9 33 9 8 0.8041330975

e x 7 x 30 1 0

2

2.8,3.1 32 7 6 3.0000000000

1

x

sin( x) 1 0 1.3, 0.5 14 6 6 -0.6294463362

x 2x 5 0

3

2,3 21 6 5 2.0945515532

1

x

1 0 0.5,1.5 33 6 5 1.0000000000

x 2 x 10 x 20 0

3 2

0, 2 14 7 6 1.3688081078

5. CONCLUSION

We presented a class of Regula Falsi methods for finding simple zeros of nonlinear equations. In this paper, an

algorithm MRF is developed for computational purposes. The algorithm is tested on a number of numerical examples and

the results obtain up to the desire accuracy 1 10 are compared with the other methods. It is observed that our

10

method takes less number of iterations and more effective in comparison with these methods.

6. ACKNOWLEDGEMENT

We would like to thank the Faculty of Science, Burapha University support through funds for research .

7. REFERENCES

[1] Chen, J., Li, W. “An improved exponential regula falsi methods with quadratic convergence of both diameter and

point for solving nonlinear equations”, Appl. Numer. Math., vol. 57, pp.80–88, 2007.

[2] Dowel, M., Jarratt, P., “A modified regula falsi method for computing the root of an equation”, BIT 12, pp.168–174,

1971.

[3] Naghipoor J., Ahmadian S. A. and Soheili Ali R., “An Improved Regula Falsi Method for Finding Simple Zeros of

Nonlinear Equations”, App. Math. Sci., vol. 2, no. 8, pp.381-386, 2008.

[4] Parida P.K. and Gupta D.K., “A cubic convergent iterative method for enclosing simple roots of nonlinear

equations”, Appl. Math. and compu., vol. 187, pp.1544-1551, 2007.

- Basic CalculusUploaded bySajin S
- STQP2034 Tutorial 3Uploaded bySabariah Othman
- Goal Plot 4Uploaded byJoneth García
- Numerical Analysis and Computer ProgrammingUploaded byAbhishek
- DLSUploaded bySubhajit Goswami
- Lecture6 SSUploaded byAlper Karacakaya
- Ch2Introduction to PolynomialsUploaded byStar Pudding
- Lesson Plan NumecUploaded byAnonymous u7cQyr3QY
- Power Flow Example.xlsUploaded bySamsiah Cw
- CubicEquation.xlsUploaded byHenry Poudel
- PGDTezUploaded byAbhj Sa
- Assg5 (1)Uploaded byKhoi Phan Fof
- Numerical Methods by Jain & IyengarUploaded byAnurag Kumar
- wafwqaUploaded byZiyvo
- 129120899 Syllabus for 1st YearUploaded byGhettoopressed
- PHY_F313Uploaded byAnkit Goyal
- 777_1Uploaded byAKHIL PASULA
- Cube of a Binomial.docxUploaded byLJ Bejarin
- soil structure.pdfUploaded byAshok Mache
- Civil SyllabusUploaded byajay
- ch 6 hwUploaded byGadis Elektrik
- Ex Tt 2sx Summer2012Uploaded byGeorge Turcas
- Cv Ahmad El-AjouUploaded byDr-Ahmad El Ajou
- MATH253_Final_2011W1Uploaded byexamkiller
- SGN2206LectureNew2Uploaded byssosloa
- Chapter 3Uploaded byAnusha Mani
- Computational scienceUploaded byravikumar rayala
- FemUploaded byZeevan 123
- art089.pdfUploaded byDaniel Rosero
- EE GATE SyllabusUploaded byJeba Antony

- Block Lu FactorizationUploaded byJubayer Ahmed
- Nonlinear Systems ScilabUploaded byCarlos Soza Ross
- Resolution in FOLUploaded byManish
- rungekuttaUploaded byJeremy Lai
- Adding+Subtracting PolynomialsUploaded byGladys Gahona
- 2.Gaussian Elimination With PivotingUploaded bypercydziks
- An Optimization PrimerUploaded byCmpt Cmpt
- 31 1 Plynml ApproxUploaded byEbookcraze
- Diff & IntegrUploaded byAji Surya
- D1 Linear Programming TermsUploaded byboostoberoi
- numerical methodsUploaded byapi-296698256
- 10.1_A Classifying Polynomials_E_Preferred - Copy.pdfUploaded byJack Tomagos
- Assignment 2Uploaded bysiddharthloganathan
- Partial FractionsUploaded bySaket Jain
- CL244_HW2 and Quiz1 KeyUploaded byArindam Mohanta
- MATA33_Mid_2010WUploaded byexamkiller
- PolynomialsUploaded byriniwidadi
- Casaseminar Eno Weno SchemeUploaded bynavala_pra
- Numerical Methods Solved ExamplesUploaded byChristed aljo barroga
- Numerical MethodsUploaded byjbiz2biz
- Benders 1962Uploaded byMohamedKadry
- Example of Numerical Analysis QuestionsUploaded byBurak Örs
- 232689521-CHE555-Lesson-Plan.pdfUploaded byAisyah Sarjuni
- Analytical Numerical AnalysisUploaded byrajadazzle
- 1437563215 Polynomials Chap 2Uploaded byjeet
- Fuzzy Expert SystemsUploaded byajuklm88
- m5 HeuristicsUploaded byThilina Munasinghe
- c9-3Uploaded byVinay Gupta
- Model CheckingUploaded byHitesh Kapuriya
- Chap09_8up- Initial Value Problems for ODEsUploaded byagcore

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.