7.26. Calculus IV (Mandatory)

7.26. Calculus IV (Mandatory)

Figure 7.26: Connection Map. MA211 Calculus IV

7.26.1. Justification ↑ Back to top

The nature of the course is theoretical-practical; its purpose is to develop a conceptual and methodological framework aimed at providing a solid mathematical foundation for understanding all natural phenomena. It includes the following thematic units: Sequences in \(R^n\), \(C\), \((R^m, R)\). Directional derivatives and implicit differentiation. Isometries of \(R^n\), conics, and quadric surfaces. Vector fields.

7.26.2. Generales Goals ↑ Back to top

  1. Understand the concepts of vector fields and differential operators
  2. Apply line and surface integrals to physical problems
  3. Master the fundamental theorems of vector calculus
  4. Solve problems of flux, circulation, and vector potentials

7.26.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)

7.26.4. Content ↑ Back to top

7.26.4.1. Numerical Differentiation and Integration (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Marsden and Tromba, 2003; Stewart, 2016)

Topics

  1. Finite difference approximations (forward, backward, central)
  2. Richardson extrapolation
  3. Newton-Cotes formulas (Trapezoidal rule, Simpson's rule)
  4. Gaussian quadrature
  5. Error analysis for numerical integration

Learning Outcomes

  1. Compute derivatives of functions using finite difference schemes [Usage]
  2. Apply Richardson extrapolation to improve the accuracy of numerical approximations [Usage]
  3. Implement numerical integration rules (Trapezoidal, Simpson, Gaussian) [Usage]
  4. Compare the accuracy and efficiency of different numerical integration methods [Assessment]
  5. Analyze the error for numerical differentiation and integration formulas [Assessment]
7.26.4.2. Numerical Methods for Ordinary Differential Equations (ODEs) (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Marsden and Tromba, 2003; Stewart, 2016)

Topics

  1. Euler's method and its variants (forward, backward)
  2. Runge-Kutta methods
  3. Multistep methods (Adams-Bashforth, Adams-Moulton)
  4. Stability and convergence analysis for ODE solvers
  5. Systems of ODEs and higher-order ODEs

Learning Outcomes

  1. Implement basic ODE solvers (Euler, Runge-Kutta) [Usage]
  2. Analyze the stability and convergence properties of ODE numerical methods [Assessment]
  3. Select an appropriate numerical method for a given ODE based on stability and accuracy requirements [Assessment]
  4. Solve systems of ODEs and convert higher-order ODEs to first-order systems [Usage]
7.26.4.3. Interpolation and Function Approximation (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Marsden and Tromba, 2003; Stewart, 2016)

Topics

  1. Polynomial interpolation (Lagrange, Newton forms)
  2. Spline interpolation (cubic splines)
  3. Least squares approximation
  4. Runge's phenomenon and Chebyshev nodes
  5. Error analysis for interpolation

Learning Outcomes

  1. Construct interpolating polynomials using different methods [Usage]
  2. Implement cubic spline interpolation [Usage]
  3. Apply least squares method for data fitting [Usage]
  4. Explain Runge's phenomenon and strategies to mitigate it [Familiarity]
  5. Analyze the error of an interpolation scheme [Assessment]
7.26.4.4. Roots Finding and Basic Numerical Optimization (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Marsden and Tromba, 2003; Stewart, 2016)

Topics

  1. Bisection method and fixed-point iteration
  2. Newton's method and secant method for root finding
  3. Convergence analysis and order of convergence
  4. Gradient descent for univariate optimization
  5. Rate of convergence and stopping criteria

Learning Outcomes

  1. Implement root-finding algorithms (bisection, Newton, secant) and analyze their convergence [Usage]
  2. Classify the order of convergence of iterative methods [Assessment]
  3. Apply gradient descent to solve simple univariate optimization problems [Usage]
  4. Design appropriate stopping criteria for iterative methods [Usage]

7.26.5. Bibliography ↑ Back to top

Marsden, J. E. and Tromba, A. J. (2003). Cálculo Vectorial. Pearson, 5th edition.

Stewart, J. (2016). Cálculo de una variable: Trascendentes tempranas. Cengage Learning, 8th edition.

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

Scan to open on your phone