General
Bisection
Newton-Raphson
Secant
Lagrange
100

What is the primary purpose of numerical analysis?

The numerical approximation of problems when symbolic manipulation is difficult/impossible

100

For the Bisection method to work, what conditions must the initial guesses satisfy?

a and b must be on opposite sides of the root (i.e opposite signs)

100

what are the two things you need for this method

the function and its derivative

100

Why is the secant method considered a variation of the NR method

Instead of using the derivative you use the secant line

100

What is the purpose of Lagrange polynomials

They are used for polynomial interpretation

200

Main purpose of the algorithms we learned today

Finding the root/zero of the equation

200

Main advantage of the Bisection Method

If there is a root between the two guesses it will eventually converge

200

Main advantage of NR method

Calculation time

200

What is a secant

A line that intersects a curve at 2 points

200

If you have a set of N+1 data points, what degree is your polynomial

N degree

300

What is the core mathematical theorem that the Bisection method relies on?

IVT

300

Each step of the NR method finds the root of what

the tangent line of the function at the given point

300

Advantage of Secant over NR method

the derivative is not required

400

In each iteration of the Bisection method, how are the new points a,b calculated?

Diff signs: b = x

Same signs: a = x

400

Under what condition (in relation to the derivative) will the NR method fail

If the tangent is parallel or nearly parallel to the x axis, or if there is a stationary point nearby 

400

What is the iterative formula of this method?

x_n = x_(n-2)-f(x_n-2)*((x_n-1)-(x_n-2))/(f(x_(n-1)-f(x_n-2))

500

Using your code (or logic) if the user inputs the values of a=1 and b = 5 to the function (x-3.4)(x-8) and the tolerance is 1e-6, what are the number of iterations that must be done?

22

500

What is the iterative formula of this method

x_n+1 = x_n -f(x_n)/f'(x_n)

500

Potential issue of secant method in a concave graph

One of the endpoints can become fixed, slowing the process down or even making it fail