Logged out
Access All our Essays in an Instant
Swap your work for FREE access, or pay £4.99 for instant access
Hange of sign, Newton-Raphson and the rearrangement method and are going to use them to find roots of different equations, and hence
Member rating:
(1 vote)
| Words:
| Submitted: Tue Jun 20 2006
Page Preview
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
INTRODUCTION For my investigation, I will analyse the use three methods which are called the: change of sign, Newton-Raphson and the rearrangement method and are going to use them to find roots of different equations, and hence compare the merits and flaws of the methods with each other. I will analyse which is the best in terms of factors such as a speed of convergence and ease of use with available software and hardware.cocb 1. For Change of sign method (Decimal search) I use these equations: 2. For Newton-Raphson method (Fixed point iteration) I use these equations: -3ex +2x3+6=0 x3-2x2-2x+3=0 3. For Rearranging f(x) = 0 in the form x = g(x), I use these equations: In my course work, I will use computer (hardware) and Autograph (plot the graph), and Microsoft Excel (spreadsheet), Microsoft Word. ...
Get instant access
- Instant, unlimited access to our documents in full
- Swap your work for free access, or pay £4.99
- To see the full version of this document and 149,979 others
