Scribd
Upload
8 views3 pages

Numerical Methods Formulas

Uploaded by

Apurv Musandi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views3 pages

Numerical Methods Formulas

Uploaded by

Apurv Musandi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Numerical Methods Important Formulas

1. Bisection Method

- Main Concept:
Find the root of the equation f(x) = 0 by repeatedly bisecting the
interval and selecting a subinterval in which the root must lie.

- Formula:
x_mid = (a + b)/2

- Update:
If f(a) * f(x_mid) < 0, then root lies between a and x_mid.
Else, root lies between x_mid and b.

------------------------------------------------------------

2. Runge-Kutta 4th Order Method

- Main Formula:
y_(n+1) = y_n + (1/6)(k1 + 2k2 + 2k3 + k4)

- Where:
k1 = h * f(x_n, y_n)
k2 = h * f(x_n + h/2, y_n + k1/2)
k3 = h * f(x_n + h/2, y_n + k2/2)
k4 = h * f(x_n + h, y_n + k3)

h = step size.

------------------------------------------------------------

3. One Segment Trapezoidal Rule

- Main Formula:
Integration from a to b of f(x) dx is approximately (b - a)/2 * [f(a) +
f(b)]

It approximates the area under the curve as a trapezoid.

------------------------------------------------------------

4. Lagrange Interpolation Polynomial (for 3 Data Points)

- Given points (x0, y0), (x1, y1), (x2, y2).

- Main Formula:
P(x) = L0(x) * y0 + L1(x) * y1 + L2(x) * y2

- Where:
L0(x) = (x - x1)(x - x2) / (x0 - x1)(x0 - x2)
L1(x) = (x - x0)(x - x2) / (x1 - x0)(x1 - x2)
L2(x) = (x - x0)(x - x1) / (x2 - x0)(x2 - x1)
------------------------------------------------------------

You might also like