Numeric Methods/Teng ikkiga bo'lish
v2
BSC-001ROOT · FINDER / MK-1
Numerical root finding / 001

Teng ikkiga bo'lish

Oraliqni teng ikkiga bo'lib, tenglama ildizini kafolatli tarzda yaqinlashtiring.

f(a) · f(b) < 0Ildizni qamrab olish sharti
Method map3 ta oddiy qadam
01
Qamrab olingf(a) va f(b) ishoralarini tekshiring
02
Markazni topingc = (a + b) / 2 ni hisoblang
03
Yarmini qoldiringildiz bor tomonni tanlang
Input / Parametrlar

Masalani sozlang

01

f(x) — funksiya — ildizini topmoqchi bo'lgan tenglama. Masalan: x^3 + x - 1

f(x)=x3+x−1f(x) = x^3 + x - 1
ε

Aniqlik — oraliq uzunligi shu qiymatdan kichik bo'lganda to'xtaymiz.

Formula yozish namunasi
Natija / Root—hisoblash kutilmoqda
Iteratsiyalar—
Plot / f(x)

Grafikda ko'ring

02
-0.120.190.50.811.12-1.398-0.62010.15810.93631.714XYO(0,0)
  • f(x)
  • [a, b]
  • c
  • f(x) = 0
Trace / Iterations

Har bir qaror ko'rinadi

03

Hali hisoblash yo'q
Chap tomondagi parametrlarni kiriting, so'ng tugmani bosing.

Bisection · O(log₂((b−a)/ε)) qadamXato ≤ (b − a) / 2ⁿ