Direct Iteration Method

1 Page
134 Views
Unlock Document

Department
Mechanical Engineering
Course
ME 303
Professor
Serhiy Yarusevych
Semester
Summer

Description
Convergence of the direct iteration method The x = g(x) rearrangement that we choose can have a strong effect on convergence of the iteration. We can show graphically that the iteration will converge only if the function g(x) on dg the right hand side satisfiedx <1 near the root. dg (i) <1 dx y y=x (slope=1) y=x y=g(x) y y=g(x) length=x2 root root P g(x ) 1 0 x1 x2 x x1 Calculations: 1) guess x1 2) compute g(x 1 3) x2= g(x1), i.e., the length corresponding 2o x equals to the length given b1 g(x ), as shown on the sketch above. Thus, the point P(x=x new y=g(xold) falls on the line y=x. In this case, repeating the process moves P along y=x toward
More Less

Related notes for ME 303

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit