Numerical Dungeon#

Learning numerical methods from textbooks alone gets dull. Clear 5 stages and absorb the core concepts hands-on.

Rules#

• 3 HP — wrong answers cost 1 HP. Game over at 0!
• XP — correct answers grant XP. Later stages reward more.
• Difficulty — Stages 1–2 are basics, 3–4 cover core theory, 5 is the final boss.

Each stage starts with a concept explanation, then a quiz. Wrong answers come with detailed explanations—treat them as learning opportunities.

---

---

Going Deeper, Stage by Stage#

After clearing the dungeon, dive deeper into each topic:

Stage 1: CFL Condition#

The CFL condition ties directly to the concept of domain of dependence. The numerical propagation speed must outpace the physical one. Implicit schemes have no CFL limit, but you pay by solving nonlinear systems.

Stage 2: Numerical Diffusion#

Reducing numerical diffusion calls for high-order schemes, but Godunov's theorem requires nonlinear limiters. Common limiters: minmod, van Leer, superbee, MC limiter.

Stage 3: Godunov's Theorem#

This theorem catalyzed modern schemes like TVD, ENO, and WENO. Its essence: "nonlinearity is the key to high order + stability."

Stage 4: Riemann Problem#

Standard tests like Sod, Lax, and Shu–Osher validate Riemann solvers. See this blog's From the Riemann Problem to Godunov-Type Schemes.

Stage 5: Multiphase Pressure Oscillation#

Abgrall's condition is the starting point of multiphase numerical analysis. Check actual code in 5-Equation Model Implementation Guide.