Scribd Logo
Upload

Welcome to Scribd!

  • Fixed Point and Roc: Er. Sudip Rana

    Uploaded by

    Spidy
    13 views10 pages
    The document discusses different numerical methods for finding roots of equations, including Newton-Raphson, fixed point iteration, and bisection. It notes some drawbacks of Newton-Raphson, such as requiring derivatives and accurate initial guesses. It then gives an example of using fixed point iteration to find a root of x^3+x^2-1 correct to four decimal places. Finally, it asks the reader questions about using these methods to find specific roots and lists features for comparing the various root-finding algorithms.

    Original Description:

    Original Title

    Fixed Point

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses different numerical methods for finding roots of equations, including Newton-Raphson, fixed point iteration, and bisection. It notes some drawbacks of Newton-Raphson, such as requiring derivatives and accurate initial guesses. It then gives an example of using fixed point iteration to find a root of x^3+x^2-1 correct to four decimal places. Finally, it asks the reader questions about using these methods to find specific roots and lists features for comparing the various root-finding algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views10 pages

    Fixed Point and Roc: Er. Sudip Rana

    Uploaded by

    Spidy
    The document discusses different numerical methods for finding roots of equations, including Newton-Raphson, fixed point iteration, and bisection. It notes some drawbacks of Newton-Raphson, such as requiring derivatives and accurate initial guesses. It then gives an example of using fixed point iteration to find a root of x^3+x^2-1 correct to four decimal places. Finally, it asks the reader questions about using these methods to find specific roots and lists features for comparing the various root-finding algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 10

    FIXED POINT AND ROC Er.

    Sudip rana
    DRAWBACKS OF NEWTON RAPHSON
    1. It requires the derivatives of f(x), if complicated then this method will tend to fail.
    2. It requires a very accurate initial value or initial guess x. Must be near the root
    you need to approximate. Otherwise it may diverge or oscillate.
    3. Division by zero problem can occur.
    4. In case of multiple roots, this method converges slowly.
    5. If the tangent is parallel or nearly parallel to the x-axis, then the method does not
    converge
    6. If root jumping occurs the root may be other than desired root.
    FIXED POINT ITERATION METHOD
    ALGORITHM
    FIND THE ROOT OF X^3+X^2-1 CORRECT UPTO
    FOUR DECIMAL PLACES.
    0.5 0.81650

    0.81650 0.74196

    0.74196 0.75761

    0.75761 0.75429

    0.75429 0.75500

    0.75500 0.75485

    0.75485 0.75488
    QUESTION
    1. Find a real root of x^2-x-1=0 correct upto 3 decimal place (ans -0.61802)
    2. Find a real root of sinx+3x-2=0 correct upto 3 decimal place (ans 0.50523)
    3. Find the square root of 17 correct upto 4 decimal place. (ans 4.1231)
    RATE(ORDER) OF CONVERGENCE.
    QUICK GLANCE(COMPARISON)
    features bisection Regular falsi secant Fixed point Newton
    raphson
    type Closed bracket closed open open open

    No. of guess 2 2 2 1 1

    convergence Slow but slow fast fast faster


    steady
    accuracy good good good good good

    programming easy easy easy easy easy

    approach Mid point interpolation interpolation modification Taylor series

    Rate of linear linear superlinear linear quadratic


    convergence

    You might also like