4.8.27 · D1 · Maths › Numerical Methods › Systems of ODEs — RK4 for systems
Jab kai saari quantities saath-saath change hoti hain aur har ek ki rate of change baaki sabke upar depend karti hai, toh hum unhe ek single list mein stack kar dete hain jise vector kehte hain, aur us list ko ek akele moving object ki tarah treat karte hain. Phir wahi four-slope averaging trick (RK4) jo ek quantity ke liye kaam karti hai, poori list ke liye bhi kaam karti hai — kuch bhi naya invent nahi karna padta.
Is page pe zero prior notation assume kiya gaya hai. Hum har ek symbol ek-ek karke build karte hain jis par parent note 4.8.27 rely karta hai, taaki jab aap wahan recipe padho, page par har ek mark ka matlab pehle se pata ho.
t aur ek "quantity jo change hoti hai"
t seedha time hai. Ek quantity jaise y ek aisa number hai jiska har moment par alag value hota hai — socho ek swing ki height. Hum y ( t ) likhte hain: "y ka value time t par".
Picture karo ek akela dot jo clock tick karne ke saath ek vertical line par slide karta hai. t = 0 par woh kisi height par baitha hai; ek moment baad woh move kar chuka hai. Yahi motion is sab ke baare mein hai.
Hume yeh kyun chahiye: poora topic isi ke baare mein hai ki predict karein ki dot aage kahan hoga — yeh jaante hue ki woh abhi kahan hai aur kitni tez move kar raha hai.
y ′ (padho "y prime")
y ′ ka matlab hai "==y abhi kitni tez change ho rahi hai==" — iska rate of change . Agar y ek height hai, toh y ′ vertical speed hai (upar = positive, neeche = negative).
y ′ literally ek slope kyun hai
y ko time t ke against ek graph par plot karo. Curve upar-neeche jaati hai. Kisi bhi ek instant par, itna zoom in karo ki curve ek straight line jaisi lage — us choti line ki steepness (slope) hi y ′ hai. Steep-upar = bada positive y ′ ; flat = zero; steep-neeche = negative.
Hume yeh kyun chahiye: ek ODE ek aisi rule hai jo hume slope batati hai. Agar hume har jagah slope pata ho, toh hum aage badh sakte hain aur poori curve trace kar sakte hain — woh aage badhna hi numerical method hai.
f ( t , y )
f ek machine hai: isko current time t aur current value y doh, aur yeh us moment par slope y ′ wapas deta hai. Toh equation y ′ = f ( t , y ) ka matlab hai: "rate of change wahi hai jo machine kehti hai, yeh dekhte hue ki hum kahan aur kab hain."
Worked example Ek slope-rule ko zor se padhna
y ′ = − y kehta hai "jitna zyada upar ho, utni tez neeche giroge" (slope tumhari value ka negative hai). y ′ = y kehta hai "jitna upar ho, utni tez charhoge" — woh runaway growth exactly e t hai.
Hume yeh kyun chahiye: ek ODE (Ordinary Differential Equation) exactly aisi hi ek rule hoti hai. Isse "solve" karne ka matlab hai woh moving value y ( t ) dhundhna jiska slope hamesha wahi ho jo f demand karta hai.
Definition Starting point
t 0 start time hai (aksar 0 ). y 0 wahan jaana hua value hai. Milke y ( t 0 ) = y 0 dot ko move shuru karne se pehle ek jagah pin karta hai.
Intuition Sirf ek slope-rule kyun kaafi nahi hai
Rule f motion ki shape deta hai lekin woh kahan se shuru hota hai nahi. Kai curves ka same slope pattern hota hai, bas upar-neeche shift hoke — jaise parallel hillsides. Initial value batata hai ki aap unme se kaunsi par ho . Ek slope-rule plus ek starting point ko IVP (Initial Value Problem) kehte hain.
h
h ek time-hop ka size hai jo hum lete hain. Har ek instant par y jaanne ki jagah, hum isse t 0 , t 0 + h , t 0 + 2 h , … par jaanne se khush hain — jaise h ke gap par footprints.
Chota h = chote careful steps = zyada accurate lekin slow. Subscript n in y n ka matlab hai "n steps ke baad ki value", toh y n ≈ y ( t 0 + nh ) .
Hume yeh kyun chahiye: computers infinitely many instants store nahi kar sakte, toh hum curve ko length h ke discrete hops mein chalte hain. h choose karna accuracy aur work ke beech trade karta hai — yeh theme hai Local vs Global Truncation Error ka.
y
Jab hum kai quantities saath track karte hain — unhe y 1 , y 2 , … , y n bulao — hum unhe ek column list mein stack karte hain:
y = ( y 1 , y 2 , … , y n ) T .
Bold y signal karta hai "yeh ek poori list hai, na ki ek number". Chota superscript T (transpose) bas matlab hai "khadi column ki tarah likha hua".
Intuition Alag-alag numbers ki jagah ek
list kyun
Predator aur prey, ya position aur velocity, saath-saath move karte hain: har ek ki rate doosre par depend karti hai. Unhe ek list mein rakhne se hum keh sakte hain "poori whole state ko ek hop mein advance karo" ek hi stroke mein — aur, sabse zaroori baat, yeh ensure karta hai ki hum unhe ek saath advance karein, kabhi bhi ek ko advance nahi karte jab doosra stale ho.
Number n batata hai kitni quantities hain (dimension ). n = 1 ordinary scalar case hai; n = 2 predator–prey ya ek pendulum hai.
Definition Vector slope-rule
f ek aisi machine hai jo time t aur poori list y leti hai, aur slopes ki ek list return karti hai — har quantity ke liye ek:
f ( t , y ) = ( f 1 , f 2 , … , f n ) , y i ′ = f i ( t , y 1 , … , y n ) .
Key point yeh hai: har f i saare y j dekh sakta hai. Yeh cross-dependence coupling kehlata hai.
Common mistake "Equations actually touch nahi karte, toh inhe alag-alag solve karo."
Kyun sahi lagta hai: y 1 ′ aur y 2 ′ alag lines par likhe hain. Kyun galat hai: kyunki f 1 mein y 2 ho sakta hai, y 2 ko freeze karke y 1 advance karna galat value feed karta hai. Fix: hamesha poori list ko saath , step by step advance karo. Yeh woh ek sabse zaroori habit hai jo parent note drill karta hai.
Order sabse bada prime-count hai. Akela y ′ → first-order . y ′′ (slope ka apna slope, yaani acceleration) → second-order .
Intuition Hume sirf first-order kyun chahiye
Ek second-order rule jaise y ′′ = g ( t , y , y ′ ) ko first-order system mein repackage kiya ja sakta hai derivative ko ek brand-new variable ka naam dekar:
u 1 = y , u 2 = y ′ .
Phir u 1 ′ = u 2 (value ki rate velocity hai) aur u 2 ′ = g ( t , u 1 , u 2 ) (velocity ki rate acceleration hai). Ek 2nd-order equation do 1st-order equations ban jaata hai — dekho Reducing higher-order ODEs to first-order systems .
Hume yeh kyun chahiye: iska matlab hai "RK4 for systems" secretly har ODE solve karta hai, kisi bhi order ka, ek baar reduce karne ke baad.
Definition Choti notation, clearly likhi
≈ matlab hai "approximately equal to " — hamare hops near-answers dete hain, exact nahi.
∫ t t + h … d s ek definite integral hai: ek hop mein exact accumulated change , t aur t + h ke beech slope curve ke neeche ka area. RK4 is area ka estimate karta hai kuch clever points par slope sample karke (wahi spirit jaise Simpson's Rule ).
O ( h 4 ) big-O hai: "error h 4 ke saath shrink hota hai." h halve karo aur error 2 4 = 16 se kam ho jaata hai. Dekho Local vs Global Truncation Error .
2 h , 6 h bas step ke fractions hain — recipe mein half-hops aur weighting divisor.
Recall
O ( h 4 ) headline number kyun hai
Question: agar aap step h halve karo, toh RK4 ka global error roughly kitna chhota ho jaata hai?
Answer ::: Lagbhag 2 4 = 16 times chhota — yahi matlab hai order-4 accuracy ka.
k i vectors
Har k i ek trial slope-list hai — vector slope f ko ek guessed state par evaluate kiya gaya. RK4 inhe chaar collect karta hai (start, do middles, end) aur ek weighted average 6 1 ( k 1 + 2 k 2 + 2 k 3 + k 4 ) leta hai.
Intuition Chaar peeks kyun, weighted
1 , 2 , 2 , 1
Starting slope se akele hop estimate karna (woh sasta Euler's method for systems hai) drift karta hai kyunki slope hop ke dauran change hoti hai. Beech mein aur end mein dobara dekhna, aur middles par zyada trust karna (weight 2 ), kaafi zyada error cancel karta hai — Taylor expansion ko h 4 tak match karta hai. Kyunki har k i ek list hai, agle peek par jaane se pehle poori list fill karni hogi.
vector rule f bold: coupling
reduction of higher order
exact integral over one hop
four probe slopes k1 to k4
Baayein taraf sab kuch ek single number ya idea hai; do boldings (y , f ) scalar story ko system story mein badal dete hain jo RK4 ko feed karta hai.
Ek symbol ka matlab padho woh ek picture se map karta hai; agar nahi, toh us section ko dobara padho.
y ( t ) ek moving quantity ka time t par value — ek dot jo ek line par slide karta hai.
y ′ y ki rate of change = kisi instant par uske graph ki slope.
f ( t , y ) slope-rule machine: time aur value input karo, slope output milo.
y ( t 0 ) = y 0 woh starting point jo select karta hai ki aap kaun si curve par ho (ek IVP).
h ek time-hop ka size; chhota = zyada accurate, zyada kaam.
y (bold)kai quantities ki ek stacked list jo ek moving object ki tarah treat ki jaati hai.
f ( t , y ) vector slope-rule; har component baaki sabpe depend kar sakta hai (coupling).
Coupling har equation ki rate doosre unknowns par depend karti hai, toh sabko saath advance karna hoga.
Order of an ODE sabse bada prime-count; second-order first-order system mein reduce hota hai.
Reduction trick u 1 = y , u 2 = y ′ set karo taaki u 1 ′ = u 2 , u 2 ′ = g ( t , u 1 , u 2 ) .
k i ek trial slope-list; RK4 chaar ka average karta hai weights 1 , 2 , 2 , 1 over 6 ke saath.
∫ t t + h f d s ek hop mein exact accumulated change, slopes sample karke estimate kiya gaya.
O ( h 4 ) h halve karne se global error lagbhag 16 × kam hoti hai.
Parent topic — Hinglish
RK4 for a single ODE — scalar method jise yeh symbols generalise karte hain.
Euler's method for systems — one-peek cousin, intuition build karne ke liye acha.
Reducing higher-order ODEs to first-order systems
Local vs Global Truncation Error — O ( h 4 ) ka matlab.
Simpson's Rule — 1 , 2 , 2 , 1 weights ke peeche ka sampling idea.
Stiff systems and stability — jahan step size h ulta padta hai.