CS417, Fall 2019

CS417 Outline

Fall 2019

General Information

Below are the modules that comprise the course content.

Each module consists of a series of activities.

  • Not every assigned activity requires you to submit something for grading. Nonetheless, you are expected to do them all.

  • If no due date is specified, you are supposed to complete the assigned activity by the end of the final day allotted for that entire module.

KEYS TO SUCCESS IN THIS COURSE:

  1. READ THE SYLLABUS

    The syllabus lays out the basic course policies. It tells you what you must
    do to earn a passing grade. It tells you how to get in touch with me if you
    run into problems.

  2. HAVE A SCHEDULE

    You have some freedom to schedule your own time in this course, but you
    DO need to set up a schedule. Do not forget that this course exists and that
    you are registered for it. Do not think you can repeatedly set it aside for
    days at a time and make up the time later.

  3. IF YOU DON’T UNDERSTAND SOMETHING, ASK QUESTIONS

    You can ask questions in the course Forums. You can contact me through email.
    You can contact me during office hours. You will find information on these
    options in the syllabus and Course Orientation module.

    Some people are too shy to ask questions. Some are too proud to ask
    questions. Part of being educated is knowing how to exploit your available
    information resources. In this course, I am one of those resources.

Upcoming Events
1 Online Orientation and Course Introductions 08/24/2019 - 08/29/2019

Overview

In this pseudo-module, we will discuss course organization, policies, and mechanics. We will review the CS 417 course website structure, and get set up for the semester to come.

We will take a brief look at the major themes and areas of emphasis that we will discuss during the coming semester. This will include a review of prerequisite mathematics (mainly, Calculus) and programming (namely, principles from CS 250). We will discuss the basics of Python 3 with particular emphasis on:

Objectives

  1. Identify requirements, protocols, policies, and expectations for CS 417.
  2. Discuss and utilize select tools for communication, collaboration, and documentation.
  3. Discuss course themes and their relation to computational methods.

Relevance

You must understand the fundamentals of the tools used any course to be successful. An understanding of expectations for participation, assignment submission, and time management skills is foundational in all academic endeavors.

Activities

Getting Started

  1. lecture Read lecture notes: Syllabus
  2. lecture Read lecture notes: Introduction & Overview
  3. lecture Read lecture notes: Discussion Board Guidance

The Fun Part of Module 1

  1. asst Do assignment: Personal Introduction Post Due: 08/29/2019
  2. lecture Read lecture notes: The Beginning
  3. lecture Read lecture notes: Unfamiliar Notation & Math Review (Notebook)
  4. lecture Read lecture notes: Unfamiliar Notation
  5. lecture Read lecture notes: Deriving the Quadratic Formula
  6. lecture Read lecture notes: Converting to Base 2
  7. asst Do assignment: Complete Homework 0 Due: 09/03/2019
  8. asst Do assignment: Review Homework 0 Solution Due: 09/05/2019, 1:00PM EDT
2.1 Real Numbers & Machine Numbers & Rounding 08/30/2019 - 09/05/2019

Overview

In mathematics the impact finite precision is oft dismissed as an artifact of rounding. In most–if not all cases–the solution is to use more decimal places or signifigant digits until precision errors are within an “acceptable threshold” (a nebulous phrase). In this module, we will discuss how to measure and analyze finite precision errors arise from representing a single numerical quantity.

Objectives

After this module students will be able to:

  1. Discuss the impact of finite precision on machine representation of floating-point values.
  2. Apply mathematical analysis to examine (i.e., quantify) the magnitudes that can be represented with a finite number of mantissa and exponent bits.
  3. Compare the error that arises in finite representation using the well known absolute error and relative error formulae.
  4. Explain the difference between absolute and relative error, and discuss how absolute and relative error are mathematically linked.

Relevance

When developing software of any size machine precision is a consideration. The impact may be something seemingly inconsequential (e.g., a rounding error of less than one cent). Machine precision can result in interesting impacts (e.g., a solar system simulation may compute planets spiraling into the Sun).

Activities
  1. lecture Read lecture notes: Converting to Base 2
  2. lecture Read lecture notes: Review of Machine Precision
  3. lecture Read lecture notes: Finite Precision Error - Base 2
  4. lecture Read lecture notes: Finite Precision Error - Generalized
  5. asst Do assignment: Complete Homework 1 Due: 09/09/2019
  6. asst Do assignment: Review Homework 1 Solution Due: 09/12/2019, 1:00PM EDT
2.2 Rounding & Finite Arithmetic 09/06/2019 - 09/10/2019

Overview

In this module, we will continue our discussion of finite precision and its impact on arithmetic operations. The propagation of error through arithmetic operations will be our primary focus.

Objectives

After this module students will be able to:

  1. Discuss the impact of finite precision on error propagation in arithmetic operations involving two operands.
  2. Examine the impact of finite precision on error propagation in arithmetic operations involving three or more operands and one operation (e.g., addition, subtraction, multiplication, and division).
  3. Examine the impact of finite precision on error propagation in arithmetic operations involving three or more operands and combinations of two or more operations).

Relevance

When developing software of any size rounding is a consideration. The impact may be something seemingly inconsequential (e.g., a rounding error of less than one cent). Machine precision can result in interesting impacts (e.g., a solar system simulation may compute planets spiraling into the Sun).

Activities
  1. lecture Read lecture notes: Review Finite Precision
  2. lecture Read lecture notes: Arithmetic Error
  3. asst Do assignment: Complete Homework 2 Due: 09/18/2019
  4. asst Do assignment: Review Homework 2 Solution Due: 09/20/2019, 1:00PM EDT
2.3 Condition of a Problem 09/10/2019 - 09/18/2019

Overview

In this module, we will continue our discussion of finite precision and its impact on numerical computations. The propagation of error and the resulting behavior on computations will be our primary focus.

Objectives

After this module students will be able to:

  1. Discuss the sensitivity of computations to errors in input resulting from finite precision.
  2. Quantify (i.e., examine/model) through *Condition Number*s the sensitivity of computations to errors in input resulting from finite precision.
  3. Explain (through mathematical analysis) when a problem is ill-conditioned or well-conditioned.
  4. Leverage the results of Condition Number analysis to develop alternative methods of computation when a problem is ill-conditioned.

Relevance

Error propagation can result in interesting impacts (e.g., a solar system simulation may compute planets spiraling into the Sun). The ability to quantify the impact of a small change in input on a computation is foundational when building (or selecting) numerical methods (and algorithms)

Activities
  1. lecture Read lecture notes: Conditioning
  2. lecture Read lecture notes: Condition Number Examples
  3. lecture Read lecture notes: Read Chapter 1 Section 4 pages 10-12
  4. asst Do assignment: Complete Homework 3 Due: 09/25/2019
2.4 Unit Summary 09/19/2019 - 09/27/2019

Overview

This module serves as a review of Chapter 1. We will revisit finite precision, arithmetic error, and conditioning of problems. This summary module also serves to force another review of requisite principles from Calculus.

Objectives

After this module students will be able to:

  1. Summarize the techniques discussed in this unit.
  2. Combine the techniques discussed in this unit to examine non-trivial problems.
  3. Utilize various principles from Calculus (e.g., differentiation, integration, limits, sequences, and series) in combination without becoming overwhelmed.
Activities
  1. lecture Read lecture notes: Chapter 1 Closing Thoughts
  2. lecture Read lecture notes: Some Trigonometry (Thinking Assignment)
  3. lecture Read lecture notes: Some Trigonometry Typed (Thinking Assignment)
  4. asst Do assignment: Review Homework 3 Solution Due: 09/26/2019, 1:00PM EDT
  5. exam Take the exam: Exam 1: Chapter 1 09/26/2019 - 09/27/2019
3 Chapter 2 Approximation
3.1 Introduction to Approximation 09/28/2019 - 10/02/2019

Overview

Approximation has numerous applications throughout all disciplines. This can be something as simple as plotting data in Excel and computing a line of best fit or something more domain specific (e.g., transforming raw data for use in A.I. applications. In this Module we will explore Least Squares Approximation at an introductory level in preparation for a more rigorous and thorough derivation in later modules.

Objectives

After this module students will be able to:

  1. Locate and review web-based resources covering Least Squares Approximation at an introductory level.
  2. Explain how approximation methods can be employed for trend analysis for simple data (e.g., grade projection and price analysis).
  3. Manually (i.e., by hand on paper) build a solution for discrete data.

Relevance

To apply approximation methods to discrete (and later continuous) data, one must analyze (possibly) unfamiliar mathematical notation. Application of approximation methods requires a solid foundation in linear algebra.

Activities
  1. lecture Read lecture notes: Least Squares - A Whirlwind Introduction
  2. lecture Read lecture notes: Least Squares - A Quick First Example
  3. lecture Read lecture notes: Least Squares - Quadratic Example
  4. lecture Read lecture notes: Least Squares - More Formal Notation
  5. lecture Read lecture notes: A Tedious Problem?
  6. asst Do assignment: Implement a Matrix Solver
  7. asst Do assignment: Start working on CPU Temperature Semester Project
3.2 Approximation Proper 10/03/2019 - 10/19/2019

Overview

The previous module discussed the XTX|XTY method for computing polynomial approximation functions for discrete data. This Module will formalize the process and discuss how to generalize Least Squares approximation to both discrete and continuous data sets.

Objectives

After this module students will be able to:

  1. Explain the differences between the Riemann Integral and Riemann-Stieltjes Integral.
  2. Apply the weighted L2-Norm, properties of inner products, derivatives, and integrals to explain derivations of Least Squares Approximation.
  3. Explain the impact of basis functions.
  4. Manually (i.e., by hand on paper) build a solution for continuous functions/data.
  5. Discuss the motivation for a single Least Squares notation to reconcile the discrete and continuous cases.
  6. Explain how the [XTX|XTY] and [Ac|b] notations are related.
  7. Construct a mathematical proof to show [XTX|XTY] is equivalent to [Ac|b] for discrete data.

Relevance

There are many applications in which one must approximate a combination of discrete and continuous data sets. This includes applications in A.I (e.g., hill climbing), Medical Imaging, and Aerospace applications.

Activities
  1. lecture Read lecture notes: Least Squares Derivation
  2. lecture Read lecture notes: Least Squares Examples
  3. lecture Read lecture notes: Least Squares Closing Thoughts
  4. lecture Read lecture notes: Reconcile the XTX|XTY and Ab Methods
  5. asst Do assignment: Continue working on CPU Temperature Semester Project Due: 12/06/2019
  6. asst Do assignment: Complete Homework 4 Due: 10/23/2019
  7. asst Do assignment: Complete Homework 5 Due: 10/23/2019
  8. exam Take the exam: Complete Exam 2 10/31/2019 - 11/01/2019

Reference Materials

  1. video Integration by Parts DI Method
4 Selected Topics
4.1 Chapter 3: Linear Interpolation 10/20/2019 - 11/17/2019

Overview

Interpolation has applications throughout many (if not all) disciplines. This can be something as simple as resizing an image in GNU Image Manipulation Program (GIMP). Interpolation can also be viewed as a complement to approximation. Just like approximation, we need to find a function of best fit. However, interpolation has a stronger invariant: the computed interpolation function must pass through all input points.

Objectives

After this module students will be able to:

  1. Locate and review web-based resources covering interpolation at an introductory level.
  2. Explain how interpolation methods can be employed for trend analysis for simple data (e.g., price analysis and temperature analysis).
  3. Summarize the differences between approximation and interpolation.
  4. Apply Lagrange Interpolation and Newton Interpolation.
  5. Apply piecewise linear interpolation (e.g., in the Semester Project).
  6. Compute interpolation error.
  7. Compare interpolation error to approximation error.

Relevance

To apply interpolation methods to discrete data, one must analyze (possibly) unfamiliar mathematical notation. Interpolation has applications in various everyday activities (e.g., photo editing, video upscaling, and mesh generation).

Activities

Semester Project

  1. asst Do assignment: Continue working on CPU Temperature Semester Project

Interpolation Methods

  1. lecture Read lecture notes: Interpolation - The Beginning
  2. lecture Read lecture notes: Lagrange Interpolation
  3. lecture Read lecture notes: Newton’s Method

Interpolation Error (Guest Lecture by Christos)

  1. lecture Read lecture notes: Interpolation Error Derivation

Interpolation Taking Stock

  1. lecture Read lecture notes: Taking Stock
  2. asst Do assignment: Complete Homework 6 Due: 11/25/2019

Piecewise Interpolation

  1. lecture Read lecture notes: Piecewise Interpolation & Cubic Splines
4.2 Chapter 4: Non-Linear Solvers

Overview

There exist many problems that can not be solved analytically. Such problems include finding zeroes (i.e., solutions), computing derivatives, and evaluating integrals. In this module we will discuss for first problem (i.e., computing numerical solutions to equations).

Objectives

After this module students will be able to:

  1. Discuss the requirements for each of the Bisection method, False Position (Regula False) method, Secant method, and Newton’s method.
  2. Manipulate provided pseudocode and refine it into a form suitable for implementation in a selected language (e.g., C, C++, Python 3, or Rust).
  3. Identify the considerations inherent in converting pseudocode (theory) into usable code (application)–with particular emphasis on the impact of finite precition.

Relevance

There exist various numerical methods for solving problems, including finding zeroes of a function, performing numerical integration, and performing numerical differentiation. The ability to select the appropriate method, interpret pseudocode, and design an implementation (using best an appropriate language) is foundational when building numerical software.

Activities
  1. lecture Read lecture notes: Non-Linear Solvers
  2. lecture Read lecture notes: Solver Examples
  3. asst Do assignment: (Cancelled) Complete Homework 7
  4. lecture Read lecture notes: Solver Discussion Notes

Final Exam

  1. exam Take the exam: Complete the Final Exam 12/09/2019, 7:00PM EST - 12/12/2019, 11:59PM EST
5 Future Work

Overview

Computational Methods and Software covers a broad range of topics. In this course, we covered a few selected topics. This section contains resources and references for topics not covered this semester.

Activities

Reference Materials

  1. text Templates for the Solution of Linear Systems
6 Special Events and Dates
Activities
  1. Review the academic calendar.

All times in this schedule are given in Eastern Time.

Symbol Key
lecture Read:
slides Slides :
event Event or important date
text Read
lab Do lab:
asst Assignment:
exam Take the
activity Do:
recitation In your recitation section:
construct Under construction: