Lecture14 - False-Position(point Method Why bother with another method • The bisection method is simple and guaranteed to converge(single root

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: False-Position (point) Method Why bother with another method? • The bisection method is simple and guaranteed to converge (single root) • But the convergence is slow and non- monotonic! • The bisection method is a brute force method and makes no use of information about the function False-Position Method y(x) x secant line x* x l x u Straight line (linear) approximation to exact curve * Equation for the secant: y= f(x l ) + k (x-x l ) o x y x u ,f(x u ) x l ,f(x l ) False-point method x r ,0 • Root for the secant line : y= 0 = f(x l ) + k(x r,-x l ) ⇒ x r = x l - f(x l )/k = x l- f(x l ) (x u-x l )/[f(x u ) - f(x l )] Or: ( )( ) ( ) ( ) u l r u u u l f x x x x x f x f x- =-- Derivation ( ) ( ) ( ) ( ) u l u r u l u r f x f x f x f x slope k x x x x-- = = =-- Algorithm for False-Position Method 1. Start with [ x l , x u ] with f ( x l ) . f ( x u ) < 0 (still need to bracket the root) 2. Draw a straight line to approximate the root 3. Check signs of f ( x l ) . f ( x r ) and f ( x r ) . f ( x u ) so that [ x l , x u ] always bracket the root Maybe less efficient than the bisection method for highly nonlinear functions ) ( ) ( ) )( ( ) ( u l u l u u r r x f x f x x x f x x x f--- = ⇒ = no yes False-point Method Flowchart If f(xm)f(xl) < 0 then xu = xr else xl = xr Solution obtaind xr If f(xr) ? = 0 or abs(xr - pxr) < tolerance Input xl & xu f(xl)*f(xu) < 0 Start end xr =xu - f(xu)(xl -xu)/(f(xl) - f(xu)) 0000274 99999315 2 2 3 999856 2 4 000576 999856 2 2 3 99698 2 3 01207 9968 2 2 3 9375 2 2 2461 9375 2 2 3 2 1 x f x x x iter r r u l . . . . . . . . . . . . . . . . ) (---- Hand Calculation Example [ ] [ ] 2 3 2 x , x estimeates initial 3 x 2 x x f Example u l 2 . , . ) ( : = =-- = False- Position 1. Find root of Manning ' s equation 2. Some other functions ( 29 ( 29 S 2h b bh n 1 Q f(h) 1/2 2/3 5/3 = +- = Examples: False-Position x e ) x ( f 2 x 2 =- =- 1 x 3 x ) x ( f 3 = +- = Linear interpolation False- position (Regula- Falsi) Linear Interpolation Method False-Position Method Manning Equation >> false_position( 'manning' ) enter lower bound xl = 0 enter upper bound xu = 10 allowable tolerance es = 0.00001 maximum number of iterations maxit = 50 False position method has converged...
View Full Document

This note was uploaded on 09/05/2011 for the course EGM 3344 taught by Professor Raphaelhaftka during the Spring '09 term at University of Florida.

Page1 / 26

Lecture14 - False-Position(point Method Why bother with another method • The bisection method is simple and guaranteed to converge(single root

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online