- ES Español (Latinoamérica)

- EN English

2.1. Numerical and Scientific Analysis (NSA)
This area covers the fundamental numerical methods and their analysis that form the foundation of computational mathematics. It focuses on the development, implementation, and analysis of algorithms for solving mathematical problems numerically, with a strong emphasis on understanding and controlling errors that arise from finite-precision arithmetic and discrete approximations. This knowledge is essential for all subsequent areas in computational mathematics, as it provides the tools to ensure that computed solutions are accurate, stable, and reliable.
2.1.1. NSA/Computational Arithmetic and Error Analysis (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- Floating-point arithmetic and the IEEE standard
- Sources of error: truncation, rounding, and discretization
- Error propagation and condition number
- Stability of numerical algorithms
- Absolute, relative, and forward/backward error
Learning Outcomes:
Core:
- Define the different types of errors in numerical computation (rounding, truncation, discretization) [Familiarity]
- Explain the principles of floating-point representation and arithmetic according to the IEEE standard [Familiarity]
- Calculate the absolute and relative error of an approximation [Usage]
- Analyze the propagation of errors in a sequence of arithmetic operations [Usage]
- Distinguish between the condition of a problem and the stability of an algorithm [Assessment]
- Compute the condition number of a simple problem (e.g., matrix-vector multiplication) [Usage]
2.1.2. NSA/Numerical Linear Algebra (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- LU decomposition and its applications
- QR decomposition and least squares problems
- Singular Value Decomposition (SVD) and its applications
- Condition number and numerical stability of linear systems
- Iterative methods for linear systems (Jacobi, Gauss-Seidel, Conjugate Gradient)
Learning Outcomes:
Core:
- Implement LU and QR decomposition algorithms for solving linear systems [Usage]
- Explain the geometric and algebraic meaning of the Singular Value Decomposition [Familiarity]
- Use SVD for applications such as matrix approximation and principal component analysis [Usage]
- Analyze the stability of a linear system using its condition number [Assessment]
- Select and implement an appropriate iterative method for solving large, sparse linear systems [Assessment]
2.1.3. NSA/Roots Finding and Basic Numerical Optimization (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- Bisection method and fixed-point iteration
- Newton's method and secant method for root finding
- Convergence analysis and order of convergence
- Gradient descent for univariate optimization
- Rate of convergence and stopping criteria
Learning Outcomes:
Core:
- Implement root-finding algorithms (bisection, Newton, secant) and analyze their convergence [Usage]
- Classify the order of convergence of iterative methods [Assessment]
- Apply gradient descent to solve simple univariate optimization problems [Usage]
- Design appropriate stopping criteria for iterative methods [Usage]
2.1.4. NSA/Interpolation and Function Approximation (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- Polynomial interpolation (Lagrange, Newton forms)
- Spline interpolation (cubic splines)
- Least squares approximation
- Runge's phenomenon and Chebyshev nodes
- Error analysis for interpolation
Learning Outcomes:
Core:
- Construct interpolating polynomials using different methods [Usage]
- Implement cubic spline interpolation [Usage]
- Apply least squares method for data fitting [Usage]
- Explain Runge's phenomenon and strategies to mitigate it [Familiarity]
- Analyze the error of an interpolation scheme [Assessment]
2.1.5. NSA/Numerical Differentiation and Integration (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- Finite difference approximations (forward, backward, central)
- Richardson extrapolation
- Newton-Cotes formulas (Trapezoidal rule, Simpson's rule)
- Gaussian quadrature
- Error analysis for numerical integration
Learning Outcomes:
Core:
- Compute derivatives of functions using finite difference schemes [Usage]
- Apply Richardson extrapolation to improve the accuracy of numerical approximations [Usage]
- Implement numerical integration rules (Trapezoidal, Simpson, Gaussian) [Usage]
- Compare the accuracy and efficiency of different numerical integration methods [Assessment]
- Analyze the error for numerical differentiation and integration formulas [Assessment]
2.1.6. NSA/Numerical Methods for Ordinary Differential Equations (ODEs) (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Topics:
Core
- Euler's method and its variants (forward, backward)
- Runge-Kutta methods
- Multistep methods (Adams-Bashforth, Adams-Moulton)
- Stability and convergence analysis for ODE solvers
- Systems of ODEs and higher-order ODEs
Learning Outcomes:
Core:
- Implement basic ODE solvers (Euler, Runge-Kutta) [Usage]
- Analyze the stability and convergence properties of ODE numerical methods [Assessment]
- Select an appropriate numerical method for a given ODE based on stability and accuracy requirements [Assessment]
- Solve systems of ODEs and convert higher-order ODEs to first-order systems [Usage]