## Mei C3 Coursework Newton Raphson Failure Configuring

Does it still count as a failure if 0 is the closest integer to both roots, but newton-raphson can only find one root for input 0? It still finds the other root, but not with the input of the closest integer to the root.

For example, would this equation count as a failure?

x^3+7x^2-0.231x-0.231I don't quote understand the question. Can you rephrase?

0 is the closest integer to two of the roots and -7, to the other.(Original post by**couruthim**)

Does it still count as a failure if 0 is the closest integer to both roots, but newton-raphson can only find one root for input 0? It still finds the other root, but not with the input of the closest integer to the root.

For example, would this equation count as a failure?

x^3+7x^2-0.231x-0.231- Community Assistant
**Very Important Poster**

Newton Raphson will converge to one root depending on which basin of attraction your initial guess in. What do you expect? For it to converge to one root the first time and then do the exact same thing and have it converge to the other root? I'm not understanding.

(Original post by**couruthim**)

Does it still count as a failure if 0 is the closest integer to both roots, but newton-raphson can only find one root for input 0? It still finds the other root, but not with the input of the closest integer to the root.

6

Maurice Yap 6946 – Core 3 Mathematics Coursework – 4752/02 Methods for Ada!ced Mathematics

Using numerical methods to find roots of and solve polynomial equations

This report will explore and compare the advantages and disadvantages of three different numerical methods used to solve polynomial equations, where analytical methods cannot easily be used. It will explore instances where, for some reason, they fail and also examine their ease, efficiency and usefulness in solving polynomial equations.

Change of sign decimal search method

The change of sign! method can be used to find an approximation of a root to an equation to a specified accuracy, using a decimal search."olynomial equations can be illustrated graphically as the function y # f$x%, as shown below in figure &. The points where the curve intersects the x'axis are the real roots of the equation f$x% #(, because the x'axis is where y # (. If the curve crosses this line, the values for f$x% when x is slightly larger and smaller than the root will be positive and negative, either way round $given that the values chosen for x are not beyond any other roots%.) logical and systematic way to use this to solve an equation to a certain degree of accuracy is a decimal search, where having already identified integer intervals where roots occur, the interval is divided into ten, and f$x% for each of the ten new values for x is found. ) search for a change of sign $* or '% is conducted and the process is repeated in the interval where the change of sign occurs until the level of accuracy desired is achieved. )fter this, the same technique is applied to find the other roots and thereby solving the equation.

+xample of an application of the change of sign method

or example, consider solving the following equation, by first finding the greatest root to five significant figures-

6

x

5

−

9

x

4

−

4

x

3

−

20

x

+

26

=

0

It is shown in figure & that there are three roots to this equation. That which is labelled root c! will be attempted to be found.

## One thought on “Mei C3 Coursework Newton Raphson Failure Configuring”