7.40. Numerical Analysis III (Mandatory)

7.40. Numerical Analysis III (Mandatory)

Figure 7.40: Connection Map. MA326 Numerical Analysis III

7.40.1. Justification ↑ Back to top

Numerical Analysis 3 focuses on the computational solution of Ordinary Differential Equations (ODEs). In computational mathematics, many systems cannot be solved analytically; therefore, understanding the convergence, stability, and efficiency of numerical integrators is vital. This course covers from basic one-step methods to advanced Runge-Kutta schemes and the specialized treatment of stiff equations, which are critical in simulating chemical reactions, electrical circuits, and structural mechanics.

7.40.2. Generales Goals ↑ Back to top

  1. Understand the fundamental theory of numerical methods for Initial Value Problems (IVPs).
  2. Master the construction and analysis of high-order Runge-Kutta methods.
  3. Evaluate the stability and convergence of numerical schemes.
  4. Implement specialized algorithms for Stiff Differential Equations.

7.40.3. Contribution to Outcomes ↑ Back to top

ABET-1) An ability to identify, formulate, and solve broadly defined technical or scientific problems by applying knowledge of mathematics and science and/or technical topics to areas relevant to the discipline. (Usage)
ABET-3) An ability to develop and conduct experiments or test hypotheses, analyze and interpret data, and use scientific judgment to draw conclusions. (Usage)

7.40.4. Content ↑ Back to top

7.40.4.1. Numerical Solution of ODEs: Foundations (20 hours) [Skills ABET-1,ABET-3] ↑ Back to top

Bibliography: (Burden et al., 2016; Heath, 2002)

Topics

  1. Review of Existence and Uniqueness (Lipschitz continuity)
  2. Elementary methods: Euler, Heun, and Taylor series methods
  3. Error analysis: Local truncation error and Global error
  4. Consistency, Convergence, and Zero-stability

Learning Outcomes

  1. Formulate discrete approximations for continuous differential systems [Usage]
  2. Derive the local truncation error for basic one-step methods [Assessment]
  3. Analyze the impact of step size on numerical stability [Familiarity]
7.40.4.2. Runge-Kutta Methods (20 hours) [Skills ABET-1,ABET-3] ↑ Back to top

Bibliography: (Quarteroni et al., 2007; Butcher, 2016)

Topics

  1. General structure of Runge-Kutta (RK) methods
  2. Butcher Tableaus and order conditions
  3. Explicit and Implicit Runge-Kutta methods
  4. Adaptive step-size control: Runge-Kutta-Fehlberg (RK45)

Learning Outcomes

  1. Construct high-order RK methods using Butcher Tableaus [Usage]
  2. Implement adaptive algorithms to optimize computational cost [Assessment]
  3. Prove the order of convergence for specific RK schemes [Familiarity]
7.40.4.3. Linear Multi-step Methods (20 hours) [Skills ABET-1,ABET-3] ↑ Back to top

Bibliography: (Burden et al., 2016; Quarteroni et al., 2007)

Topics

  1. Adams-Bashforth and Adams-Moulton formulas
  2. Predictor-Corrector methods
  3. General Theory of Linear Multi-step methods (Dahlquist theorems)
  4. Comparison between RK and Multi-step methods

Learning Outcomes

  1. Develop multi-step codes for efficient long-term integration [Usage]
  2. Verify the root condition for zero-stability [Assessment]
  3. Select appropriate methods based on the trade-off between memory and accuracy [Familiarity]
7.40.4.4. Stiff Equations and Absolute Stability (20 hours) [Skills ABET-1,ABET-3] ↑ Back to top

Bibliography: (Heath, 2002; Butcher, 2016)

Topics

  1. Definition and characterization of Stiff Systems
  2. Linear Stability Analysis: The test equation and Stability Regions
  3. A-stability and L-stability
  4. Backward Differentiation Formulas (BDF) and Implicit methods for stiffness

Learning Outcomes

  1. Identify stiffness in physical systems through eigenvalue analysis [Assessment]
  2. Plot and interpret stability regions in the complex plane [Usage]
  3. Apply implicit solvers to overcome step-size restrictions in stiff problems [Assessment]

7.40.5. Bibliography ↑ Back to top

Burden, R. L., Faires, J. D., and Burden, A. M. (2016). Análisis Numérico. Cengage Learning, 10th edition.

Heath, M. T. (2002). Scientific Computing: An Introductory Survey. McGraw-Hill, 2nd edition.

Quarteroni, A., Sacco, R., and Saleri, F. (2007). Numerical Mathematics. Springer, 2nd edition.

Butcher, J. C. (2016). Numerical Methods for Ordinary Differential Equations. Wiley, 3rd edition.

Spotted a typo, an outdated course, a broken link, or have a suggestion? Let us know.

Scan to open on your phone