7.27. Numerical Analysis I (Mandatory)

7.27. Numerical Analysis I (Mandatory)

Figure 7.27: Connection Map. MA221 Numerical Analysis I

7.27.1. Justification ↑ Back to top

This course introduces fundamental numerical methods for solving mathematical problems through computational algorithms. It develops skills for implementing and analyzing numerical methods in linear algebra, nonlinear equations, and interpolation, with emphasis on error analysis and numerical stability.

7.27.2. Generales Goals ↑ Back to top

  1. Understand fundamentals of computational arithmetic and error analysis
  2. Implement numerical methods for linear systems of equations
  3. Solve nonlinear equations using iterative methods
  4. Apply function interpolation and approximation techniques

7.27.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.27.4. Content ↑ Back to top

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

Bibliography: (Burden et al., 2016; Chapra and Canale, 2015)

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.27.4.2. Numerical Linear Algebra (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Burden et al., 2016; Chapra and Canale, 2015)

Topics

  1. LU decomposition and its applications
  2. QR decomposition and least squares problems
  3. Singular Value Decomposition (SVD) and its applications
  4. Condition number and numerical stability of linear systems
  5. Iterative methods for linear systems (Jacobi, Gauss-Seidel, Conjugate Gradient)

Learning Outcomes

  1. Implement LU and QR decomposition algorithms for solving linear systems [Usage]
  2. Explain the geometric and algebraic meaning of the Singular Value Decomposition [Familiarity]
  3. Use SVD for applications such as matrix approximation and principal component analysis [Usage]
  4. Analyze the stability of a linear system using its condition number [Assessment]
  5. Select and implement an appropriate iterative method for solving large, sparse linear systems [Assessment]
7.27.4.3. Roots Finding and Basic Numerical Optimization (20 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Burden et al., 2016; Chapra and Canale, 2015)

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

Bibliography: (Burden et al., 2016; Chapra and Canale, 2015)

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

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

Chapra, S. C. and Canale, R. P. (2015). Métodos Numéricos para Ingenieros. McGraw-Hill, 7th edition.

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

Scan to open on your phone