CS323: Numerical Analysis and Computing
44 study materials · 8 sections
CS323: Numerical Analysis and Computing provides a comprehensive introduction to numerical algorithms, optimization, and differential equations. The course bridges the gap between theoretical mathematics and practical computation, emphasizing the implementation of algorithms using Python, NumPy, and SciPy. Students explore how finite precision arithmetic affects real-world applications in computer vision, machine learning, and data analysis.
Course Sections
Introduction to Python and Numerical Computing
Key concepts: Dynamic Typing · List Comprehension · Direct vs. Iterative Methods · Big-O Notation · Asymptotic Analysis
Foundational concepts of Python programming for scientific computing and the motivation behind numerical methods.
Error Analysis and Floating-Point Arithmetic
Key concepts: Machine Epsilon · Floating-point Representation · Catastrophic Cancellation · Absolute and Relative Error
Exploration of how computers represent real numbers and the resulting inaccuracies in calculations.
Linear Algebra Foundations for Computing
Key concepts: Vector Span and Independence · Matrix-Vector Multiplication · Column Space and Null Space · Sparse Matrices
A refresher on vector and matrix algebra with a focus on computational implementation.
Norms, Condition Numbers, and Stability
Key concepts: Vector Norms (L1, L2, L-infinity) · Induced Matrix Norms · Condition Number · Numerical Stability
Measuring the magnitude of vectors/matrices and the sensitivity of linear systems to perturbations.
Solving Linear Systems: Direct Methods and LU
Key concepts: Gaussian Elimination · LU Decomposition · Partial and Full Pivoting · Iterative Refinement
Techniques for solving Ax=b using Gaussian elimination and matrix factorizations.
Iterative Methods and Least Squares
Key concepts: Jacobi Method · Gauss-Seidel Method · Diagonal Dominance · Least Squares (Normal Equations)
Solving large-scale systems and overdetermined problems where an exact solution may not exist.
Root-Finding Algorithms
Key concepts: Bisection Method · Newton's Method · Secant Method · Fixed-Point Iteration · Order of Convergence
Numerical techniques for finding the zeros of nonlinear functions.
Polynomial Interpolation and Approximation
Key concepts: Lagrange Interpolation · Newton Basis and Divided Differences · Chebyshev Points · Piecewise Polynomials (Splines) · Horner's Method
Constructing functions that pass through a specific set of data points.
Source Materials
Study CS323: Numerical Analysis and Computing on Lykke
This course page is free to open: signed out, you can read its first two sections, and signing in, on any plan, opens the rest. The free Lykke Chrome extension syncs your own Canvas courses, so ChatGPT, Claude and Muse can answer from your classes and deadlines. It only reads Canvas.
Add the free extensionSign in to open every section