M3 Numerical Methods — Formula Sheet
1. Newton-Raphson Method
xn+1=xn−f′(xn)f(xn)
Yaad rakho:
New x=Old x−DerivativeFunction
2. Regula-Falsi Method
Pehle interval (a,b) choose karo such that:
f(a)f(b)<0
Formula:
x=f(b)−f(a)af(b)−bf(a)
Equivalent form:
x=a−f(b)−f(a)f(a)(b−a)
Phir f(x) ka sign check karke a ya b replace karte hain.
3. Newton Forward Interpolation
Kab? Jab required x, table ke beginning ke paas ho.
y=y0+uΞy0+2!u(u−1)Ξ2y0+3!u(u−1)(u−2)Ξ3y0+⋯
Where:
u=hx−x0
and
h=x1−x0
Pattern:
u,u(u−1),u(u−1)(u−2)
Matlab Forward = minus pattern.
4. Newton Backward Interpolation
Kab? Jab required x, table ke end ke paas ho.
y=yn+u∇yn+2!u(u+1)∇2yn+3!u(u+1)(u+2)∇3yn+⋯
Where:
u=hx−xn
Pattern:
u,u(u+1),u(u+1)(u+2)
Matlab Backward = plus pattern.
π₯ Forward vs Backward trick
Forward → beginning → u−1,u−2
Backward → end → u+1,u+2
5. Trapezoidal Rule
Given:
∫abf(x)dx
Step size:
h=nb−a
Formula:
I=2h[y0+yn+2(y1+y2+⋯+yn−1)]
Coefficient pattern
1,2,2,2,…,2,1
6. Simpson's 1/3 Rule
Condition:
n=even
Step size:
h=nb−a
Formula:
I=3h[y0+yn+4(y1+y3+y5+⋯)+2(y2+y4+y6+⋯)]
⭐ Coefficient pattern
1,4,2,4,2,4,…,1
Easy trick:
Odd positions → 4
Even positions → 2
7. Simpson's 3/8 Rule
Condition:
n=multiple of 3
Like:
n=3,6,9,12,…
Step size:
h=nb−a
Formula:
I=83h[y0+yn+3(y1+y2+y4+y5+⋯)+2(y3+y6+y9+⋯)]
⭐ Coefficient pattern
1,3,3,2,3,3,2,…,1
Easy trick:
Every third interior point → 2
Remaining interior points → 3
8. Runge-Kutta Fourth Order — First Order
Given differential equation:
dxdy=f(x,y)
We calculate four values:
k1=hf(xn,yn)
k2=hf(xn+2h,yn+2k1)
k3=hf(xn+2h,yn+2k2)
k4=hf(xn+h,yn+k3)
Finally:
yn+1=yn+61(k1+2k2+2k3+k4)
π₯ RK4 memory trick
Remember:
1,2,2,1
because final formula:
6k1+2k2+2k3+k4
9. Runge-Kutta Fourth Order — Second Order
Suppose:
dx2d2y=f(x,y,dxdy)
Pehle put:
z=dxdy
Then second-order equation ko two first-order equations mein convert karo:
dxdy=z
and
dxdz=f(x,y,z)
Ab RK4 simultaneously dono par lagta hai.
For y:
k1=hzn
and for z:
l1=hf(xn,yn,zn)
Then:
k2=h(zn+2l1)
l2=hf(xn+2h,yn+2k1,zn+2l1)
Then:
k3=h(zn+2l2)
l3=hf(xn+2h,yn+2k2,zn+2l2)
Then:
k4=h(zn+l3)
l4=hf(xn+h,yn+k3,zn+l3)
Finally:
yn+1=yn+6k1+2k2+2k3+k4
and
zn+1=zn+6l1+2l2+2l3+l4
π§ One-Page Memory Table
| Method | Formula / Main Trick |
|---|
| Newton-Raphson | xn+1=xn−f′(xn)f(xn) |
| Regula-Falsi | x=f(b)−f(a)af(b)−bf(a) |
| Newton Forward | u=(x−x0)/h, minus pattern |
| Newton Backward | u=(x−xn)/h, plus pattern |
| Trapezoidal | 2h[1,2,2,…,2,1] |
| Simpson 1/3 | 3h[1,4,2,4,2,…,1], n even |
| Simpson 3/8 | 83h[1,3,3,2,3,3,2,…,1], n multiple of 3 |
| RK4 First Order | k1,k2,k3,k4, final weights 1,2,2,1 |
| RK4 Second Order | Put z=y′, then use k's + l's |
⭐ Sabse important formulas
Exam ke liye agar priority banaoge, to especially ye patterns pakke rakho:
Newton-Raphson: Function/Derivative
Forward: −1,−2,−3
Backward: +1,+2,+3
Trapezoidal: 1,2,2,2,1
Simpson 1/3: 1,4,2,4,2,1
Simpson 3/8: 1,3,3,2,3,3,1
RK4: 1,2,2,1
Next best step is har method ka ek RGPV-level numerical solve karna, kyunki formula dekhna easy hai but exam mein question se h,n,u,k1,k2 etc. kaise nikalte hain wahi main part hai.
Comments
Post a Comment