Exercises — Direction fields and Euler's method — visual - numerical intuition first
4.6.2 · D4· Maths › Ordinary Differential Equations › Direction fields and Euler's method — visual - numerical int
Kisi bhi problem ko haath lagaane se pehle, yeh rahe wo sabhi symbols jo tumhein milenge, seedhe saadhe shabdon mein:
Ab jo symbols define ho gaye hain, poora method sirf teen moves mein hai:
Do aur shorthand pieces hain jinpe hum poori tarah rely karte hain — inhe use karne se pehle define karo:
Aakhir mein, ek vocabulary piece jo har ek step mein Euler jo chhoti si error karta hai usse naam deti hai — aur yeh kahan se aati hai:
Level 1 — Recognition
L1.1 Slope padho
Recall Solution
"Kisi point par slope" ka matlab hai: us point ko mein plug karo. Yahan . par dash slope par upar ki taraf tilt karta hai (45° line). ✔
L1.2 Ek Euler step
Recall Solution
par khade raho. Slope . Step: , par. Dhyaan do yeh ka Euler approximation hai — thoda undershoot. ✔
Level 2 — Application
L2.1 Do steps haath se
Recall Solution
Step 0 par: slope . , . Step 1 par: slope . , . Exact solution hai, toh . Euler undershoot karta hai. Figure s02 (neeche) yeh do seedhe tangent steps (coral, dashed) dikhata hai jo sahi curve (slate solid) se neeche rehte hain. ✔
Figure s02 — ki sahi curve ke against coarse vs fine Euler walk. Slate solid curve exact solution hai. Coral dashed path circle markers ke saath wala do-step Euler walk hai jo par khatam hota hai; green dashed path square markers ke saath wala chaar-step walk hai jo par khatam hota hai; sahi endpoint hai. Dono Euler paths curve se neeche baithe hain, aur finer (green) wala zyada closely hug karta hai.

L2.2 Finer step, same problem
Recall Solution
Chaar baar chalo, har landing point par slope recompute karte hue:
- :
- :
- :
- : Coarse se zyada ke paas: aadha karne se error shrink hota hai, bilkul behaviour ki tarah. Figure s02 upar mein, yeh chaar-step walk green square-marker path hai — iske chhote, zyada frequent steps sahi curve ko coarse do-step walk se kahin zyada tightly hug karte hain. ✔
L2.3 Ek step jo left move karta hai
Recall Solution
Negative ka matlab sirf yeh hai ki hum left chalte hain. Formula unchanged rehta hai. par khade raho: slope . , par. ✔
Level 3 — Analysis
L3.1 Over-shoot ya under-shoot?
Recall Solution
Euler har point par tangent line ke saath chalta hai. Concave-down curve ke liye, curve apni tangents se neeche bend karti hai, toh tangent step sahi curve se upar land karta hai: Euler over-shoot karta hai. (Parent ke convex example ka mirror, jahan ne tangents ko neeche rakha aur Euler under-shoot kiya.) Figure s01 (neeche) sahi solution (slate) ko frown ki tarah dikhata hai; start point se coral tangent step iske upar shoot karta hai, aur butter double-arrow over-shoot gap ko mark karta hai. ✔
Figure s01 — Kyun concave-down solution Euler ko over-shoot karaati hai. Slate solid curve neeche ki taraf bend karta hai (). Lavender start point se, coral dashed tangent step curve ke upar ek point par overshoot karta hai; butter double-headed arrow Euler ki landing (coral) aur sahi value (green) ke beech vertical over-shoot gap measure karta hai.

L3.2 Error scaling predict karo
Recall Solution
Euler ka global error hai — ke proportional ( yaad karo: error seedhi line ke neeche, toh aadha karne se woh aadhi ho jaati hai). ✔ (Yeh first-order method hai; RK4 se compare karo, jahan aadha karne se error se cut hoti hai.)
L3.3 Truncation contributions count karo
Recall Solution
(a) Steps . (b) Per step local error . Accumulated . formula se cross-check: global . Same. ✔
Level 4 — Synthesis
L4.1 Euler ko exact separable solution se compare karo
Recall Solution
(a) Separate karo: . ke saath, , toh aur . (b) : . : . (c) Error . Euler convex exponential ko under-shoot karta hai (). ✔
L4.2 Anjaan step size back out karo
Recall Solution
par slope: . Euler kehta hai : Phir . ✔
Level 5 — Mastery
L5.1 Improved (Heun) vs plain Euler — higher order ka pehla taste
Recall Solution
. Predictor step: at . . Dono slopes average karo:
- Plain Euler ek step: (error ).
- Heun: (error ). Leaving-slope aur arriving-slope ko average karne se leading term cancel ho jaata hai — yahi seed idea hai RK4 ke peeche. ✔
L5.2 Ek stiff problem ko blow up hote dekho
Recall Solution
Update: .
- Magnitude explode karta hai aur sign har step flip karta hai, jabki sahi answer quietly ki taraf decay karta hai. Kyun: explicit Euler ki par stability require karti hai . Yahan , jiska size hai, toh errors grow karti hain. Isko fix karne ke liye chhota ya implicit method chahiye — Stability and Stiff Equations dekho. ✔
L5.3 Solution exist bhi karta hai kahan?
Recall Solution
(a) jab : solution finite time mein blow up kar jaata hai. Existence sirf par guaranteed hai — yahi finite-time-escape hai jo Existence and Uniqueness (Picard–Lindelöf) warn karta hai ki smooth ke liye bhi ho sakta hai. (b) Euler ke dono taraf khushi se finite numbers return karta hai aur koi warning nahi deta — woh bas step karta rehta hai. Numerically:
- :
- : Values tezi se badhti hain lekin finite rehti hain; method vertical asymptote "dekh" nahi sakta. Lesson: existence hamesha analytically check karo — numerics nahi karengi. ✔
L5.4 Euler converge kyun guarantee karta hai?
Recall Solution
Convergence proof ke liye ko mein Lipschitz hona chahiye: ek constant exist karta hai ki Yeh kya deta hai: agar do nearby curves close start karti hain, toh ODE unhe factor se zyada tezi se door nahi fling kar sakta. Toh tiny per-step local truncation errors (upar define ki gayi, seedhi Taylor's Theorem se) controlled tarike se accumulate hoti hain explode karne ke bajaye, aur total (constant) se bounded hota hai. Yahi Lipschitz condition hai jo Existence and Uniqueness (Picard–Lindelöf) pehle se ek single solution curve exist karne ke liye use karta hai. Kya todta hai: (L5.3) globally Lipschitz nahi hai — iska -slope without bound grow karta hai — toh guarantee void hai aur solution infinity tak escape kar sakta hai. Koi Lipschitz bound nahi, koi convergence promise nahi. ✔
Recall summary
Recall Rapid self-test
One-step Euler formula ::: Error ke liye ka kya matlab hai? ::: Error constant ; aadha karo toh error aadhi hoti hai (first order) Local truncation error kya hai aur kahan se aati hai? ::: One-step slip , wo term jo Taylor's theorem rakhta hai lekin Euler chhod deta hai; size curve ke baare mein kya batata hai? ::: Yeh neeche ki taraf bend karta hai (concave, ek frown); Euler over-shoot karta hai Test equation mein kya hai? ::: Ek growth/decay rate; decay karta hai, grow karta hai Explicit Euler ki par stability condition ::: par wo condition jo convergence guarantee kare ::: Lipschitz in : ke liye Heun ka one-step value :::
Connections
- Separable First-Order ODEs — exact benchmarks (L4.1).
- Taylor's Theorem — local truncation error ka source jo L3 aur L5.4 mein use hua.
- Runge-Kutta Methods (RK4) — higher-order idea jo L5.1 mein Heun se preview hua.
- Existence and Uniqueness (Picard–Lindelöf) — Lipschitz bound (L5.4) aur finite-time blow-up (L5.3).
- Stability and Stiff Equations — L5.2 mein explosion.