newton-raphson method electrical engineering majors authors: autar kaw, jai paul transforming...

25
Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul http://numericalmethods.eng.u sf.edu Transforming Numerical Methods Education for STEM Undergraduates 06/13/22 1 http:// numericalmethods.eng.usf.edu

Upload: ralph-patrick

Post on 16-Jan-2016

228 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Newton-Raphson Method

Electrical Engineering Majors

Authors: Autar Kaw, Jai Paul

http://numericalmethods.eng.usf.eduTransforming Numerical Methods Education for STEM

Undergraduates

04/21/23 1http://

numericalmethods.eng.usf.edu

Page 2: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Newton-Raphson Method

http://numericalmethods.eng.usf.edu

Page 3: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Newton-Raphson Method

)(xf

)f(x - = xx

i

iii 1

f ( x )

f ( x i )

f ( x i - 1 )

x i + 2 x i + 1 x i X

ii xfx ,

Figure 1 Geometrical illustration of the Newton-Raphson method. http://numericalmethods.eng.usf.edu3

Page 4: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Derivation

f(x)

f(xi)

xi+1 xi

X

B

C A

)(

)(1

i

iii xf

xfxx

1

)()('

ii

ii

xx

xfxf

AC

ABtan(

Figure 2 Derivation of the Newton-Raphson method.4 http://numericalmethods.eng.usf.edu

Page 5: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Algorithm for Newton-Raphson Method

5 http://numericalmethods.eng.usf.edu

Page 6: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Step 1

)(xf Evaluate symbolically.

http://numericalmethods.eng.usf.edu6

Page 7: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Step 2

i

iii xf

xf - = xx

1

Use an initial guess of the root, , to estimate the new value of the root, , as

ix

1ix

http://numericalmethods.eng.usf.edu7

Page 8: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Step 3

0101

1 x

- xx =

i

iia

Find the absolute relative approximate error asa

http://numericalmethods.eng.usf.edu8

Page 9: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Step 4

Compare the absolute relative approximate error with the pre-specified relative error tolerance .

Also, check if the number of iterations has exceeded the maximum number of iterations allowed. If so, one needs to terminate the algorithm and notify the user.

s

Is ?

Yes

No

Go to Step 2 using new estimate of the

root.

Stop the algorithm

sa

http://numericalmethods.eng.usf.edu9

Page 10: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

3843 ln10775468.8ln10341077.210129241.11

RRT

http://numericalmethods.eng.usf.edu10

Example 1Thermistors are temperature-measuring devices based on the principle that the thermistor material exhibits a change in electrical resistance with a change in temperature. By measuring the resistance of the thermistor material, one can then determine the temperature.

Figure 3 A typical thermistor.

For a 10K3A Betatherm thermistor, the relationship between the resistance, R, of the thermistor and the temperature is given by

where T is in Kelvin and R is in ohms.

Thermally conductive epoxy coating

Tin plated copper alloy lead wires

Page 11: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

http://numericalmethods.eng.usf.edu11

Example 1 Cont.For the thermistor, error of no more than ±0.01oC is acceptable. To find the range of the resistance that is within this acceptable limit at 19oC, we need to solve

and

Use the Newton-Raphson method of finding roots of equations to find the resistance R at 18.99oC.

a) Conduct three iterations to estimate the root of the above equation.

b) Find the absolute relative approximate error at the end of each iteration and the number of significant digits at least correct at the end of each iteration.

3843 ln10775468.8ln10341077.210129241.115.27301.19

1RR

3843 ln10775468.8ln10341077.210129241.115.27399.18

1RR

Page 12: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

http://numericalmethods.eng.usf.edu12

Example 1 Cont.

3384 10293775.2ln10775468.8ln10341077.2)( RRRf

11000 12000 13000 14000 15000

0.00006

0.00004

0.00002

0.00002

Entered function on given interval

Figure 4 Graph of the function f(R).

Page 13: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

04/21/23

http://numericalmethods.eng.usf.edu13

12946 107230.1

105383.315000

R

8

5

1

0/

001

R

f

RfRR

12000 14000 16000 18000 20000

0.00005

0.00005

0.0001

Entered function on given interval with guess and estimated root

Example 1 Cont.

Figure 5 Graph of the estimate of the root after Iteration 1.

Initial guess: 150000 R

Iteration 1The estimate of the root is

15.862%

10012946

1500012946

a

The absolute relative approximate error is

The number of significant digits at least correct is 0.

Page 14: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

04/21/23

http://numericalmethods.eng.usf.edu14

13078 109906.1

106140.212946

R

8

6

2

1/

112

R

f

RfRR

12000 14000 16000 18000 20000

0.00005

0.00005

0.0001

Entered function on given interval with guess and estimated root

Example 1 Cont.

Figure 6 Graph of the estimate of the root after Iteration 2.

Iteration 2The estimate of the root is

The absolute relative approximate error is

The number of significant digits at least correct is 1.

%

a

0041.1

10013078

1294613078

Page 15: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

04/21/23

http://numericalmethods.eng.usf.edu15

13078 109710.1

102914.113078

R

8

8

2/

223

f

RfRR

12000 14000 16000 18000 20000

0.00005

0.00005

0.0001

Entered function on given interval with guess and estimated root

%0050097.0

10013078

1307813078

a

Example 1 Cont.

Figure 7 Graph of the estimate of the root after Iteration 3.

Iteration 2The estimate of the root is

The absolute relative approximate error is

The number of significant digits at least correct is 3.

Page 16: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Advantages and Drawbacks of Newton

Raphson Method

http://numericalmethods.eng.usf.edu

16 http://numericalmethods.eng.usf.edu

Page 17: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Advantages

Converges fast (quadratic convergence), if it converges.

Requires only one guess

17 http://numericalmethods.eng.usf.edu

Page 18: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Drawbacks

18 http://numericalmethods.eng.usf.edu

1. Divergence at inflection pointsSelection of the initial guess or an iteration value of the root that is close to the inflection point of the function may start diverging away from the root in ther Newton-Raphson method.

For example, to find the root of the equation .

The Newton-Raphson method reduces to .

Table 1 shows the iterated values of the root of the equation.

The root starts to diverge at Iteration 6 because the previous estimate of 0.92589 is close to the inflection point of .

Eventually after 12 more iterations the root converges to the exact value of

xf

0512.01 3 xxf

2

33

113

512.01

i

iii

x

xxx

1x

.2.0x

Page 19: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Drawbacks – Inflection Points

Iteration Number

xi

0 5.0000

1 3.6560

2 2.7465

3 2.1084

4 1.6000

5 0.92589

6 −30.119

7 −19.746

18 0.2000 0512.01 3 xxf

19 http://numericalmethods.eng.usf.edu

Figure 8 Divergence at inflection point for

Table 1 Divergence near inflection point.

Page 20: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

2. Division by zeroFor the equation

the Newton-Raphson method reduces to

For , the denominator will equal zero.

Drawbacks – Division by Zero

0104.203.0 623 xxxf

20 http://numericalmethods.eng.usf.edu

ii

iiii xx

xxxx

06.03

104.203.02

623

1

02.0or 0 00 xx Figure 9 Pitfall of division by zero or near a zero number

Page 21: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Results obtained from the Newton-Raphson method may oscillate about the local maximum or minimum without converging on a root but converging on the local maximum or minimum.

Eventually, it may lead to division by a number close to zero and may diverge.

For example for the equation has no real roots.

Drawbacks – Oscillations near local maximum and minimum

02 2 xxf

21 http://numericalmethods.eng.usf.edu

3. Oscillations near local maximum and minimum

Page 22: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Drawbacks – Oscillations near local maximum and minimum

22 http://numericalmethods.eng.usf.edu

-1

0

1

2

3

4

5

6

-2 -1 0 1 2 3

f(x)

x

3

4

2

1

-1.75 -0.3040 0.5 3.142

Figure 10 Oscillations around local minima for .

2 2 xxf

Iteration Number

0123456789

–1.0000 0.5–1.75–0.30357 3.1423 1.2529–0.17166 5.7395 2.6955 0.97678

3.002.255.063 2.09211.8743.5702.02934.9429.2662.954

300.00128.571 476.47109.66150.80829.88102.99112.93175.96

Table 3 Oscillations near local maxima and mimima in Newton-Raphson method.

ix ixf %a

Page 23: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

4. Root JumpingIn some cases where the function is oscillating and has a number of roots, one may choose an initial guess close to a root. However, the guesses may jump and converge to some other root.

For example

Choose

It will converge to instead of

-1.5

-1

-0.5

0

0.5

1

1.5

-2 0 2 4 6 8 10

x

f(x)

-0.06307 0.5499 4.461 7.539822

Drawbacks – Root Jumping

0 sin xxf

23 http://numericalmethods.eng.usf.edu

xf

539822.74.20 x

0x

2831853.62 x Figure 11 Root jumping from intended location of root for

. 0 sin xxf

Page 24: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

Additional ResourcesFor all resources on this topic such as digital audiovisual lectures, primers, textbook chapters, multiple-choice tests, worksheets in MATLAB, MATHEMATICA, MathCad and MAPLE, blogs, related physical problems, please visit

http://numericalmethods.eng.usf.edu/topics/newton_raphson.html

Page 25: Newton-Raphson Method Electrical Engineering Majors Authors: Autar Kaw, Jai Paul  Transforming Numerical Methods Education

THE END

http://numericalmethods.eng.usf.edu