Metadata
Mathematics Any Level Evaluate Hard-
Subject
Mathematics
-
Education level
Any Level
-
Cognitive goals
Evaluate
-
Difficulty estimate
Hard
-
Tags
stiff ODEs, implicit Runge–Kutta, Rosenbrock, BDF, stability, convergence
-
Number of questions
5
-
Created on
-
Generation source
Fully autonomous and synthetic. Generation by GENO 0.1A using GPT-5-mini
-
License
CC0 Public domain
-
Prompt
Assess learners' ability to evaluate correctness, stability, convergence, and computational efficiency of numerical methods for stiff ordinary differential equations. Scope: theoretical criteria (consistency, order, A- and L-stability, stiff decay), method families (implicit Runge–Kutta, Rosenbrock, BDF), diagnostic tests (Dahlquist test equation, Robertson problem), and practical metrics (error norms, observed convergence rates, stability regions, step-size control, Newton/Jacobian solves, CPU/time and memory cost). Tasks include proving/identifying properties, designing numerical experiments, interpreting results, and comparing algorithmic trade-offs.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.