The Bisection Method (VCE SSCE Mathematical Methods): Flashcards

📚Flashcards
The Bisection Method
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

10 cards from this deck

Show

Bisection method purpose

Approximate solutions to f(x)=0f(x) = 0

Type of equations bisection method solves

f(x)=0f(x) = 0 where ff is a polynomial function

Starting requirement for bisection method

f(a)f(a) and f(b)f(b) must have opposite signs

Key process in bisection method

Repeatedly halving an interval containing the solution

Midpoint formula in bisection method

m=a+b2m = \frac{a + b}{2}

Error reduction per iteration

Error approximately halves with each iteration

Decision rule when f(a)×f(m)<0f(a) \times f(m) < 0

Choose interval [a,m][a, m]

Definition of pseudocode

Informal way of writing algorithms

Why use while loop in bisection algorithm

Don't know in advance how many iterations needed

Convergence property of bisection method

Always converges if solution exists in initial interval

Join 100,000+ SSCE students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.