7.22. Linear Algebra II (Mandatory)

7.22. Linear Algebra II (Mandatory)

Figure 7.22: Connection Map. MA122 Linear Algebra II

7.22.1. Justification ↑ Back to top

This course deepens advanced concepts of linear algebra, focusing on inner product spaces, advanced linear transformations, matrix decompositions, and computational applications. It develops skills to analyze complex algebraic structures and apply matrix methods to problems in data science, signal processing, and optimization.

7.22.2. Generales Goals ↑ Back to top

  1. Master inner product spaces and their properties
  2. Apply advanced matrix decompositions (SVD, QR)
  3. Analyze linear transformations in inner product spaces
  4. Solve approximation and least squares problems

7.22.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.22.4. Content ↑ Back to top

7.22.4.1. Numerical Linear Algebra (16 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Strang, 2016; Lay et al., 2016)

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.22.4.2. Computational Arithmetic and Error Analysis (16 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Strang, 2016; Lay et al., 2016)

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

Bibliography: (Strang, 2016; Lay et al., 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.22.4.4. Numerical Methods for Ordinary Differential Equations (ODEs) (16 hours) [Skills ABET-1] ↑ Back to top

Bibliography: (Strang, 2016; Trefethen and III, 1997)

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

Strang, G. (2016). Introduction to Linear Algebra. Wellesley-Cambridge Press, 5th edition.

Lay, D. C., Lay, S. R., and McDonald, J. J. (2016). Álgebra Lineal y sus Aplicaciones. Pearson, 5th edition.

Trefethen, L. N. and III, D. B. (1997). Numerical Linear Algebra. SIAM.

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

Scan to open on your phone