4
Flowchart Metode Bisection Mulai Definisikan a, b, p, tol, iter = 0 Fa = F(a) Fb = F(b) Fa * Fb >0 T Fa * Fb > 0 1 F iter = iter +1 p = (a + b)/2 |p – a| < tol T Fa * Fp <0 T F a = p Fa = Fp b = p Fb = Fp p, Fp 1 Seles ai

Flowchart 1

Embed Size (px)

DESCRIPTION

test

Citation preview

Flowchart Metode Bisection

Flowchart Metode Iterasi

Flowchart Metode Newton

Mulai

Definisikan Fungsi

a, b, p, tol, iter_max

iter = 0

Fa = F(a)

Fb = F(b)

Fa * Fb >0

T

Fa * Fb > 0

1

F

iter = iter +1

p = (a + b)/2

Fp = F(p)

|p a| < tol

iter > iter_max

T

Fa * Fp iter_max

xb = F(xb)

T

|xb xo| < tol

iter > iter_max

F

Definisikan Fungsi

iter = iter + 1

Mulai

xb = G(xo)

xo = xb

T

iter = 0

xo, tol, iter_max

EMBED Equation.3

iter = iter + 1

Fx = F(xo)

EMBED Equation.3 EMBED Equation.3

Selesai

xo = xb

_1285477483.unknown

_1285477702.unknown

_1285477356.unknown