Scribd Logo
Upload

Welcome to Scribd!

  • Metode Fibonacci

    Uploaded by

    Wahyu Hidayatillah
    27 views2 pages
    This document contains two tables comparing the Fibonacci and Golden Section methods for numerical integration. The Fibonacci table shows 8 iterations calculating the function f(x)=x^2+2x at points a, b, c, etc. The Golden Section table shows the same calculations over 8 iterations. A second set of columns f and g in each table show additional calculations at each iteration.

    Original Description:

    metode fibonacci

    Original Title

    metode fibonacci

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains two tables comparing the Fibonacci and Golden Section methods for numerical integration. The Fibonacci table shows 8 iterations calculating the function f(x)=x^2+2x at points a, b, c, etc. The Golden Section table shows the same calculations over 8 iterations. A second set of columns f and g in each table show additional calculations at each iteration.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    27 views2 pages

    Metode Fibonacci

    Uploaded by

    Wahyu Hidayatillah
    This document contains two tables comparing the Fibonacci and Golden Section methods for numerical integration. The Fibonacci table shows 8 iterations calculating the function f(x)=x^2+2x at points a, b, c, etc. The Golden Section table shows the same calculations over 8 iterations. A second set of columns f and g in each table show additional calculations at each iteration.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 2

    f(x) x^2+2x

    F0 f1 f2 f3 f4 f5
    1 1 2 3 5 8
    Fibonacci
    iterasi a b c d e
    1 -3 5 0.054545 1.945455 0.112066
    2 -3 1.945455 -1.109091 0.054545 -0.988099
    3 -3 0.054545 -1.836364 -1.109091 -0.300496
    4 -3 -1.109091 -2.272727 -1.836364 0.619835
    5 -3 -1.836364 -2.563636 -2.272727 1.444959
    6 -3 -2.272727 -2.709091 -2.563636 1.920992
    7 -3 -2.563636 -2.854545 -2.709091 2.439339
    8 -3 -2.709091 -2.854545 -2.854545 2.439339

    Metode Golden Section

    iterasi a b c d e
    1 -3 5 0.056000 1.944000 0.115136
    2 -3 1.944000 -1.111392 0.055392 -0.987592
    3 -3 0.055392 -1.832840 -1.111768 -0.306377
    4 -3 -1.111768 -2.278695 -1.833072 0.635062
    5 -3 -1.833072 -2.554234 -2.278839 1.415642
    6 -3 -2.278839 -2.724516 -2.554322 1.973957
    7 -3 -2.554322 -2.829751 -2.724571 2.347989
    8 -3 -2.724571 -2.894786 -2.829785 2.590215
    f6 f7 f8 f9 f10
    13 21 34 55 89

    f g
    7.675702 8
    0.112066 4.945455
    -0.988099 3.054545
    -0.300496 1.890909
    0.619835 1.163636
    1.444959 0.727273
    1.920992 0.436364
    2.439339 0.290909

    f g
    7.667136 8
    0.113852 4.944000
    -0.987508 3.055392
    -0.305990 1.888232
    0.635429 1.166928
    1.415918 0.721161
    1.974146 0.445678
    2.348113 0.275429

    You might also like