CS323: Numerical Analysis and Computing
44 study materials · 7 sections
CS323 provides a comprehensive introduction to numerical algorithms, focusing on practical implementation and real-world applications. The course begins with the fundamentals of computational error and floating-point arithmetic before diving into core topics like solving linear systems, root-finding, and polynomial interpolation. With a heavy emphasis on programming, students will use Python, NumPy, and SciPy to implement and analyze the performance of various numerical methods. This hands-on approach prepares students to tackle computational problems in fields like machine learning, data analysis, and computer vision.
Course Sections
Foundations of Numerical Computing
Key concepts: Floating-Point Arithmetic · Absolute and Relative Error · Machine Epsilon · Catastrophic Cancellation · Big-O Notation · Python Programming Basics · Vector Norms
This section introduces the core principles of numerical analysis. It covers why numerical methods are necessary by exploring the limitations of computer arithmetic, including floating-point representation and catastrophic cancellation. Key concepts like error analysis, Big-O notation for complexity, and a practical refresher on Python programming are also provided.
Numerical Linear Algebra: Vectors, Matrices, and Norms
Key concepts: Vector and Matrix Algebra · Vector Operations · Linear Independence · Column Space & Null Space · Vector Norms (L1, L2, L-infinity) · Matrix Norms · Condition Number
This section reviews the fundamental building blocks of numerical linear algebra. It covers the definitions and operations of vectors and matrices, key theoretical concepts like span and column space, and the crucial idea of norms for measuring the magnitude of vectors and matrices. Understanding norms is essential for analyzing error and the sensitivity of linear systems.
Solving Systems of Linear Equations (Ax=b)
Key concepts: Direct Methods · Iterative Methods · LU Factorization · Gaussian Elimination · Pivoting Strategies · Jacobi Method · Gauss-Seidel Method · Least Squares & Normal Equations · Computational Cost
This section explores the primary methods for solving systems of linear equations, a cornerstone of numerical computing. It contrasts direct methods like LU factorization with iterative methods such as Jacobi and Gauss-Seidel, analyzing their computational costs and stability. The section also covers the practical importance of pivoting and introduces least squares for solving overdetermined systems.
Midterm 1: Review and Assessment
Key concepts: Solving Linear Systems (Ax=b) · LU Factorization with Pivoting · Iterative Methods (Jacobi, Gauss-Seidel) · Matrix Conditioning · Least Squares Solutions · Computational Cost Analysis
This module consolidates all materials related to the first midterm, which assesses your understanding of numerical linear algebra. It includes a practice exam and solutions covering direct and iterative methods for solving Ax=b, matrix conditioning, computational complexity, and least squares. Use these resources to test your knowledge and prepare for the exam.
Root Finding for Nonlinear Equations
Key concepts: Root-Finding · Bisection Method · Fixed-Point Iteration · Newton's Method · Secant Method · Order of Convergence (Linear vs. Quadratic)
This section introduces iterative algorithms for solving nonlinear equations of the form f(x)=0, a common problem known as root-finding. It details and compares several fundamental methods, including the Bisection Method, Fixed-Point Iteration, Newton's Method, and the Secant Method. The focus is on understanding their mechanisms, convergence rates, and practical trade-offs.
Polynomial Interpolation and Approximation
Key concepts: Polynomial Interpolation · Monomial Basis · Lagrange Basis · Newton Basis · Horner's Method · Piecewise Interpolation · Interpolation Error · Chebyshev Points
This section covers techniques for constructing polynomials that pass through a given set of data points. It explores different bases for representing these polynomials, including the Monomial, Lagrange, and Newton bases, and analyzes their computational efficiency. The material also touches on piecewise interpolation and the use of Chebyshev points to minimize error.
Midterm 2: Review and Assessment
Key concepts: Root-Finding Methods (Newton's, Secant, Bisection) · Convergence Analysis · Polynomial Interpolation (Lagrange, Vandermonde, Newton) · Interpolation Error Analysis · Piecewise vs. Global Interpolation
This module provides a comprehensive review for the second midterm, focusing on root-finding and polynomial interpolation. It includes a practice exam and solutions that test the theoretical understanding and practical application of methods like Newton's, Secant, and various interpolation techniques (Lagrange, Vandermonde, piecewise). Key concepts like convergence rates and error analysis are heavily featured.
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