Scribd Logo
Upload

Welcome to Scribd!

  • Saglaması

    Uploaded by

    Ilker Yuksek
    12 views2 pages
    The document presents an algorithm for numerically finding the root of a function f(x) using Newton's method of iterative approximation. It defines the Newton-Raphson function NwRf that takes a starting value x0, error tolerance ε, and maximum number of iterations as inputs and returns the root value and iteration steps. An example application of the algorithm finds the root of the function f(x) = x tan(x) - 4.9, starting from x0 = 8, with the root value converging to 9.884980873 after 8 iterations.

    Original Description:

    Original Title

    1

    Copyright

    © © All Rights Reserved

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document presents an algorithm for numerically finding the root of a function f(x) using Newton's method of iterative approximation. It defines the Newton-Raphson function NwRf that takes a starting value x0, error tolerance ε, and maximum number of iterations as inputs and returns the root value and iteration steps. An example application of the algorithm finds the root of the function f(x) = x tan(x) - 4.9, starting from x0 = 8, with the root value converging to 9.884980873 after 8 iterations.

    Copyright:

    © All Rights Reserved
    Flag for inappropriate content
    12 views2 pages

    Saglaması

    Uploaded by

    Ilker Yuksek
    The document presents an algorithm for numerically finding the root of a function f(x) using Newton's method of iterative approximation. It defines the Newton-Raphson function NwRf that takes a starting value x0, error tolerance ε, and maximum number of iterations as inputs and returns the root value and iteration steps. An example application of the algorithm finds the root of the function f(x) = x tan(x) - 4.9, starting from x0 = 8, with the root value converging to 9.884980873 after 8 iterations.

    Copyright:

    © All Rights Reserved
    Flag for inappropriate content
    of 2

    ‖ |

    d
    NwRf ((fnks , x0 , ε , iter)) ≔ ‖ fnks1 ((x)) ← ―― fnks ((x)) |
    ‖ dx |
    ‖ |
    x
    ‖ 0 ← x0 |
    ‖ |
    ‖ i ← 0 |
    ‖ step ← 0 |
    ‖ 0 |
    ‖ while i < iter ∧ |fnks ⎛x ⎞| ≥ ε| |
    ‖ | ⎝ ⎠|
    i | |
    ‖ ‖ ⎛x ⎞ | |
    ‖ ‖ fnks | |
    ⎝ i⎠
    ‖ ‖x ← x - ―――― | |
    ‖ ‖ i+1 i fnks1 ⎛ x ⎞ | |
    ‖ ‖ ⎝ i⎠
    | |
    ‖ ‖i←i+1 | |
    ‖ ‖ adim ← i | |
    ‖ ‖ i || |
    ‖ ‖ ――→ |
    ‖ return stack ⎛⎝[[ “nr” “x” “f(x)” ]] , augment ⎛⎝adim , x , fnks ((x))⎞⎠⎞⎠ |
    x0 ≔ 8 ‖ |

    f ((x)) ≔ x ⋅ tan ((x)) - 4.9


    ⎡ “nr” “x” “f(x)” ⎤
    ⎢ 0 8 -59.2976916418 ⎥
    ⎢ ⎥
    ⎢ 1 8.1597937647 -30.745353814 ⎥
    ⎢ 2 8.5137784576 -15.8744837044 ⎥
    ⎢ 3 9.256578169 -6.47180529 ⎥
    NwRf ⎛⎝f , x0 , 10 -50 , 40⎞⎠ = ⎢ ⎥
    4 9.9484780503 0.8451004516
    ⎢ ⎥
    ⎢ 5 9.887432088 0.031443407 ⎥
    ⎢ 6 9.8849843286 0.0000442646 ⎥
    ⎢ 7 9.884980873 8.7764462364 ⋅ 10 -11 ⎥
    ⎢ ⎥
    ⎣ 8 9.884980873 0 ⎦
    Guess Values

    x0 ≔ 2
    Saglaması:
    root ⎛⎝f ⎛⎝x0⎞⎠ , x0⎞⎠ = 9.884980873
    Constraints

    f ⎛⎝x0⎞⎠ ＝ 0 root ((f ((x)) , x , 2 , 9)) = ?

    solve , x
    float , 10
    Solver

    find ⎛⎝x0⎞⎠ = 4.0247483863 f ((x)) ――― → 25.3238726

    You might also like