Explore BrainMass

# Convergence to a Fixed Point of a Function and Matlab Program for the Newton-Raphson Method.

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

1. Let g: R&#8594;R+ be such a function that g&#8712; C^1(R) and for all x &#8712; R, -1 <g'(x) < 0.
Show that the sequence Xn+1 : = g(Xn) converges to the unique fixed point of the function g, regardless of chioce Xo &#8712; R.
[ Note : Observe that the domain of function g is not a compact interval.]

2. Write a matlab program (Newton - Raphson ) for finding the root of the function f(x) = x^5 - 2x^3 + x + 2. Be as much accurate as you as you can. To proceed, store this function in an m-file, say f.m, and its derivative in df.m. Label the whole procedure newt.m.

https://brainmass.com/math/computing-values-of-functions/fixed-point-function-matlab-program-newton-raphson-51292

#### Solution Preview

Please see the attached file for the complete solution.
Thanks for using BrainMass.

1. let g: R→R+ be such a function that g∈ C^1(R) and for all x ∈ R, -1 <g'(x) < 0.
Show that the sequence Xn+1 : = g(Xn) converges tp the unique fixed point of the ...

#### Solution Summary

Convergence to a Fixed Point of a Function and Matlab Program for the Newton-Raphson Method are investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

\$2.49