- ES Español (Latinoamérica)

- EN English

7.28. Real Analysis I (Mandatory)
- Semester: 5th Sem. Credits: 5
- Hour of this course: Theory: 3 hours; Practice: 4 hours;
- Syllabus:
- htmlonly

Español (Latinoamérica)

English - Prerrequisites:
- MA112 Calculus II (3rd Sem)
- ID101 Technical and professional English I (3rd Sem)
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
- Understand the structure of real numbers and their properties
- Analyze convergence of sequences and numerical series
- Master concepts of limits and continuity of functions
- 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
- 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
- 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]
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
- 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
- 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]
7.28.4.3. Interpolation and Function Approximation (20 hours) [Skills ABET-1] ↑ Back to top
Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)
Topics
- Polynomial interpolation (Lagrange, Newton forms)
- Spline interpolation (cubic splines)
- Least squares approximation
- Runge's phenomenon and Chebyshev nodes
- Error analysis for interpolation
Learning Outcomes
- 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]
7.28.4.4. Numerical Differentiation and Integration (20 hours) [Skills ABET-1] ↑ Back to top
Bibliography: (Rudin, 1976; Bartle and Sherbert, 2011)
Topics
- 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
- 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]
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.