4.8.26 · D4 · HinglishNumerical Methods

ExercisesStiff equations — implicit methods, backward Euler

2,409 words11 min read↑ Read in English

4.8.26 · D4 · Maths › Numerical Methods › Stiff equations — implicit methods, backward Euler

Shuru karne se pehle, ek shared picture. Is topic ka har method ek test problem par measure kiya jaata hai (yeh woh model ODE hai jiska true solution hum jaante hain). Jo number sab kuch decide karta hai use amplification factor kehte hain: woh number jo ko multiply karke deta hai. Agar uska size se kam ho, toh har step ko ki taraf shrink karta hai (achha, stable); agar se zyada ho, toh har step ko badhata hai (bura, blow up ho jaata hai).

Figure — Stiff equations — implicit methods, backward Euler

Neeche sab kuch bas yahi pooch raha hai: " kya hai, kya uska size se kam hai, aur yeh kya force karta hai?"


Level 1 — Recognition

(Ek formula padho, plug in karo, ek number batao. Abhi koi strategy nahi.)

Recall Solution L1.1

KYA: bas substitute karo. . YEH numbers kyun: step size aur decay ko ek dimensionless quantity mein bundle karta hai — stability test sirf isi ko dekhta hai. Kyunki , yeh step ko shrink karta hai: stable. ✅

Recall Solution L1.2

, toh . stable (actually yeh true value ke fast decay ko bilkul theek se pakadta hai). Yeh pehchanna ki forward Euler ka factor hai (na ki ) — yahi is rung ka poora point hai.

Figure — Stiff equations — implicit methods, backward Euler
Recall Solution L1.3

Backward Euler. Uski stable region (violet) right par ek chhoti disk ke bahar ka poora area hai, jo poori negative real axis ko contain karti hai — har negative stable hai. Forward Euler ki stable region (magenta) par centered radius ki ek disk hai; yeh sirf cover karti hai. ke baad forward Euler unstable ho jaata hai. Yahi backward Euler ki A-stability hai jo picture ke roop mein dikhayi gayi hai.


Level 2 — Application

(Method ko real mein run karo: derive karo, rearrange karo, iterate karo.)

Recall Solution L2.1

KYA: linear test problem par backward Euler deta hai. Rearrange kyun: ke andar aata hai, isliye hum use left side par le jaate hain — yahi implicit move ki defining step hai. True se compare karo — yeh bhi decay kar raha hai, direction sahi hai (first order hai, toh exact nahi).

Recall Solution L2.2

. Forward: . , . → badhta hai aur sign flip karta hai: unstable. Backward: . , → smoothly decay karta hai: stable. Fark poora factor mein hai: forward radius ki disk se bahar chala gaya; backward kabhi nahi ja sakta.

Recall Solution L2.3

KYA: . KYun: naye par evaluate hota hai, toh dono sides par hai — use collect karo. (Sanity check: steady state hai ; hum se ki taraf move kiye. ✅)


Level 3 — Analysis

(Ab conditions ke baare mein sochna hai, sirf numbers ke baare mein nahi.)

Recall Solution L3.1

Stability: . tak pahunchne ke liye: steps, sirf stable rehne ke liye, accuracy ke liye nahi. Yeh bound kyun: real axis par stable interval hai, yaani , jo deta hai.

Recall Solution L3.2

Maano . Kyunki aur , hame milta hai, toh . Isliye par koi upper bound nahi aata — yahi exactly unconditional stability ka matlab hai. Step sirf accuracy ke liye choose kiya jaata hai.

Recall Solution L3.3

Forward Euler ko fastest mode ke liye stability satisfy karni hai: . Steps . Backward Euler ka koi stability cap nahi; use karke steps milte hain. Ratio kam steps. Fast mode kyun dominate karta hai: explicit method ki stability smallest time scale se set hoti hai, chahe woh component numerically zero ho chuka ho — yahi stiffness ki definition hai.


Level 4 — Synthesis

(Ideas combine karo: backward Euler ke andar Newton, method comparison.)

Recall Solution L4.1

KYA: implicit equation hai . Newton kyun: simple iteration ko chahiye hogi, wahi stiff restriction jisse hum bhaag rahe hain; Newton ka aisa koi cap nahi. par: , . Direction ka ek aur check: ko se decay karna chahiye, aur indeed . ✅ (Aur Newton steps ke exact root ki taraf refine karte hain.)

Recall Solution L4.2

. Backward Euler: . Error . Trapezoidal: factor . Error — lagbhag chhota. Kyun: trapezoidal second-order hai; backward Euler first-order hai. Dono yahan stable hain, par trapezoidal zyada accurate hai — yeh yaad dilata hai ki stability aur accuracy alag-alag axes hain.


Level 5 — Mastery

(Design aur justify karo; open-ended reasoning.)

Recall Solution L5.1

(a) Stiff? Stiffness ratio — modes time scale ke 4 orders of magnitude span karte hain. Haan, strongly stiff. (b) Forward Euler steps: fastest mode se governed: . Steps . Prohibitive hai. (c) Choice: ek L-stable implicit method jaise backward Euler. Reason: fastest mode ka kisi bhi reasonable ke liye; backward Euler ka factor use ek step mein damp kar deta hai, jabki explicit method nahi kar sakta. sirf slow mode ki accuracy ke liye choose karo (jaise ), Newton se implicit equations solve karke.

Recall Solution L5.2

Define karo ( se multiply karke). par: , , ratio , toh ✅. par: , , ratio , toh ✅. Dono pass karte hain; tolerance (aur thoda aage bhi) permit karta hai. Yeh kyun matter karta hai: stability free hone par, ko size karne wali sirf yahi accuracy budget hai — exactly woh situation jo poore topic ne promise ki thi.

Recall Solution L5.3

A-stability L3.2 mein dikhayi gayi thi (poora left half-plane stable). Limit ke liye: Denominator bina bound ke badhta hai, toh factor vanish ho jaata hai. Dono conditions hold hoti hain → backward Euler L-stable hai. Trapezoidal se contrast karo, jiska factor ki taraf jaata hai (A-stable par L-stable nahi).


Recall Khud test karne ke liye ek-line summary

Sab kuch ek number par reduce hota hai ::: : padho, check karo, aur yaad rakho backward Euler ka left half-plane ke sabhi ke liye hota hai jabki forward Euler ka sirf ke around radius ki disk ke andar hota hai.


Connections

  • Parent topic
  • Forward Euler method
  • Region of absolute stability
  • A-stability and L-stability
  • Trapezoidal / Crank–Nicolson method
  • Newton's method for root finding
  • Runge–Kutta methods
  • Eigenvalues and time scales of linear systems