Scribd
Upload
40 views

Presented By: James C. Neo, M.Engg

This document discusses open and bracketing root-finding methods. Open methods use formulas requiring a single starting value or two non-bracketing starting values, which can sometimes diverge from the true root during computation. However, when open methods converge, they usually do so much more quickly than bracketing methods. The document then introduces the simple fixed-point iteration method.

Uploaded by

James Neo
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views

Presented By: James C. Neo, M.Engg

This document discusses open and bracketing root-finding methods. Open methods use formulas requiring a single starting value or two non-bracketing starting values, which can sometimes diverge from the true root during computation. However, when open methods converge, they usually do so much more quickly than bracketing methods. The document then introduces the simple fixed-point iteration method.

Uploaded by

James Neo
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Presented by: James C. Neo, M.Engg.

• In contrast, the open methods described


in this chapter are based on formulas
that require only a single starting value
of x or two starting values that do not
necessarily bracket the root. As such,
they sometimes diverge or move away
from the true root as the computation
progresses (Fig. 6.1b). However, when
the open methods converge (Fig. 6.1c),
they usually do so much more quickly
than the bracketing methods.
SIMPLE FIXED-POINT ITERATION
End Lecture

You might also like