Help with Newton root approximation proof

In summary: Next, use the theorem of mathematical induction:If ##x_n## is a positive number for some number ##n>0##, then ##x_{n+1} = x_n##. Therefore, by the hypothesis, ##x_1 = x_0##.
  • #1
zzmanzz
54
0

Homework Statement



Suppose we have:
## f(x) = x^2 - b ##
## b > 0 ##
## x_0 = b ##

And a sequence is defined by:
## x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i) } ##

prove
## \forall i \in N ( x_i > 0 ) ##

Homework Equations



The Attempt at a Solution


a)Here I tried solving for ## x_1 ## as:
## b > 0 ## given in problem
## x_1 = b - \frac{(b^2 - b)}{2b} = b - \frac{1}{2} b - \frac{1}{2} ##
## x_1 = \frac{1}{2} b -\frac{1}{2} = \frac{1}{2} (b - 1) ##

I think I made a mistake here because it looks like x_1 can be negative which doesn't make sense in real root approximation. I understand that this sequence converges to ## \sqrt(b) ## but I'm not sure how to prove that every value is positive. Thanks for the help
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
zzmanzz said:

Homework Statement



Suppose we have:
## f(x) = x^2 - b ##
## b > 0 ##
## x_0 = b ##

And a sequence is defined by:
## x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i) } ##

prove
## \forall i \in N ( x_i > 0 ) ##

Homework Equations



The Attempt at a Solution


a)Here I tried solving for ## x_1 ## as:
## b > 0 ## given in problem
## x_1 = b - \frac{(b^2 - b)}{2b} = b - \frac{1}{2} b - \frac{1}{2} ##
You have a sign error in the line above.
zzmanzz said:
## x_1 = \frac{1}{2} b -\frac{1}{2} = \frac{1}{2} (b - 1) ##

I think I made a mistake here because it looks like x_1 can be negative which doesn't make sense in real root approximation. I understand that this sequence converges to ## \sqrt(b) ## but I'm not sure how to prove that every value is positive. Thanks for the help
 
  • #3
zzmanzz said:

Homework Statement



Suppose we have:
## f(x) = x^2 - b ##
## b > 0 ##
## x_0 = b ##

And a sequence is defined by:
## x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i) } ##

prove
## \forall i \in N ( x_i > 0 ) ##

Homework Equations



The Attempt at a Solution


a)Here I tried solving for ## x_1 ## as:
## b > 0 ## given in problem
## x_1 = b - \frac{(b^2 - b)}{2b} = b - \frac{1}{2} b - \frac{1}{2} ##
## x_1 = \frac{1}{2} b -\frac{1}{2} = \frac{1}{2} (b - 1) ##

I think I made a mistake here because it looks like x_1 can be negative which doesn't make sense in real root approximation. I understand that this sequence converges to ## \sqrt(b) ## but I'm not sure how to prove that every value is positive. Thanks for the help
Try a proof by induction.
 
  • #4
zzmanzz said:

Homework Statement



Suppose we have:
## f(x) = x^2 - b ##
## b > 0 ##
## x_0 = b ##

And a sequence is defined by:
## x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i) } ##

prove
## \forall i \in N ( x_i > 0 ) ##

Homework Equations



The Attempt at a Solution


a)Here I tried solving for ## x_1 ## as:
## b > 0 ## given in problem
## x_1 = b - \frac{(b^2 - b)}{2b} = b - \frac{1}{2} b - \frac{1}{2} ##
## x_1 = \frac{1}{2} b -\frac{1}{2} = \frac{1}{2} (b - 1) ##

I think I made a mistake here because it looks like x_1 can be negative which doesn't make sense in real root approximation. I understand that this sequence converges to ## \sqrt(b) ## but I'm not sure how to prove that every value is positive. Thanks for the help

First: carry out a complete simplification of the expression for ##x_{i+1}##, by using the explicit forms for ##f## and ##f'##.

BTW: Positivity of ##x_i## holds for any ##x_0 > 0##, not just for ##x_0 = b##.
 

Related to Help with Newton root approximation proof

1. How does Newton's root approximation method work?

Newton's root approximation method is an algorithm for finding the roots of a polynomial function. It works by using an initial guess for the root and then iteratively improving that guess until it converges to the actual root. This is done by using the tangent line at the current guess to find a new, closer guess for the root.

2. What is the proof for Newton's root approximation method?

The proof for Newton's root approximation method is based on the Intermediate Value Theorem and the Mean Value Theorem. It can be shown that as the number of iterations approaches infinity, the sequence of guesses will converge to the actual root of the polynomial function.

3. How accurate is Newton's root approximation method?

Newton's root approximation method can be very accurate, especially when the initial guess is close to the actual root. However, it is not guaranteed to find the exact root and the accuracy can vary depending on the function and the initial guess. It is important to also consider potential rounding errors in the calculations.

4. Can Newton's root approximation method be used for all types of functions?

No, Newton's root approximation method is most commonly used for polynomial functions. It can also be used for other types of functions, but the convergence and accuracy may not be as reliable.

5. Are there any limitations or drawbacks to using Newton's root approximation method?

One limitation of Newton's root approximation method is that it may not always converge to the actual root, especially if the initial guess is not close enough. It is also computationally intensive and may require a large number of iterations for complex functions. Additionally, it can be sensitive to the choice of initial guess and may give different results for different initial guesses.

Similar threads

  • Calculus and Beyond Homework Help
Replies
9
Views
796
  • Calculus and Beyond Homework Help
Replies
5
Views
484
Replies
1
Views
717
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
664
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
486
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
10
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
590
Back
Top