7.28. Real Analysis I (Mandatory)

7.28. Real Analysis I (Mandatory)

Figure 7.28: Connection Map. MA222 Real Analysis I

7.28.1. Justification ↑ Back to top

The subject belongs to the area of Specific Studies; the nature of the course is theoretical-practical, and its purpose is oriented toward providing a solid mathematical foundation for understanding all natural phenomena. It includes the following thematic units: Countability. Sequences of real numbers. Topology of \(R\). Limit and continuity of real functions of a real variable. Derivation. Riemann-Stieltjes integral.

7.28.2. Generales Goals ↑ Back to top

  1. Understand the structure of real numbers and their properties
  2. Analyze convergence of sequences and numerical series
  3. Master concepts of limits and continuity of functions
  4. Develop skills in rigorous mathematical proof

7.28.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.28.4. Content ↑ Back to top

7.28.4.1. Computational Arithmetic and Error Analysis (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)

Topics

  1. Floating-point arithmetic and the IEEE standard
  2. Sources of error: truncation, rounding, and discretization
  3. Error propagation and condition number
  4. Stability of numerical algorithms
  5. Absolute, relative, and forward/backward error

Learning Outcomes

  1. Define the different types of errors in numerical computation (rounding, truncation, discretization) [Familiarity]
  2. Explain the principles of floating-point representation and arithmetic according to the IEEE standard [Familiarity]
  3. Calculate the absolute and relative error of an approximation [Usage]
  4. Analyze the propagation of errors in a sequence of arithmetic operations [Usage]
  5. Distinguish between the condition of a problem and the stability of an algorithm [Assessment]
  6. Compute the condition number of a simple problem (e.g., matrix-vector multiplication) [Usage]
7.28.4.2. Roots Finding and Basic Numerical Optimization (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)

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.28.4.3. Interpolation and Function Approximation (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)

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.28.4.4. Numerical Differentiation and Integration (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)

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.28.5. Bibliography ↑ Back to top

Rudin, W. (1976). Principles of Mathematical Analysis. McGraw-Hill, 3rd edition.

Bartle, R. G. and Sherbert, D. R. (2011). Introduction to Real Analysis. Wiley, 4th edition.

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

Scan to open on your phone