Assignments will be posted below
AS we cover the material.
 Do all the examples in the first Maple tutorial entitled
Basics.
January 13
 Do not use the shortcut menu buttons in the left
panel of Maple. Rather, manually type the commands as
they appear in the Maple examples.
 You should work all assigned Maple examples immediately to
help you prepare for the programming assignments.
 There may be Maple related questions on exams
(see the course policy).
Kettering has made Maple amply available on many PCs throughout the AB.
Read Sections 0.1, 0.4, and 0.6.
January 13
(Because you should always read sections as we cover the material,
normally I do not post reading assignments.)
 Repeat the example I worked in class but pretend you are a 3digit
rounding computer. January 15
 Do this problem on truncation error.
(requires Acrobat Reader)
January 15
 Section 0.7 – Polynomial Nested Form /
Truncation Error.
January 15
Since the use of Maple is required in this course, you should be
finished with Assignment 1 by now.
Read Sections 1.1 and 1.2. Also play with Maple.
January 17
 Section 1.1 – Bisection Method.
January 21
 Write the Maple code for the
Bisection Method.
January 22
NOTE: Do this immediately, and play with the code by changing the
starting interval, the tolerance, even the function. You will use this
code as the template for writing the codes for other methods and for our
first programming assignment.
 Do all the examples in the 8th Maple tutorial entitled
Formatted Printing and Plot Options.
January 22
Then change your Maple code for the bisection method so that it uses
formatted printing.
From now on we will use the
printf command for printing.
 Section 1.2(a) – False Position.
January 24
 Do all the examples in the second Maple tutorial entitled
Solutions of Equations.
January 24
You should complete Assignment 1 before doing this one.
Remember that these assignments will acquaint (or reacquaint) you with
Maple and prepare you for the programming assignments.
 Section 1.3 – Newton's Method.
January 24

Program Assignment 1.
Due Friday, February 7 at the beginning of class.
(Posted Monday, January 27)
Read this document before beginning this
assignment.
 You should have the codes for the bisection method and false
position (see Assignments 6–8)
running properly before you attempt this program assignment.
 You should also study the pseudocode for Newton's method
(Assignment 10) and use formatted printing as explained in
Assignment 7.
 Review the Rules Regarding
Programming Projects before working on this assignment.
 Section 1.5 – Fixed Point Method.
January 28
 Section 1.5(b) – Fixed Point Method with
Aitken Acceleration.
January 29
THE FINAL EXAM CONTENT BEGINS HERE. . .
Click here for more details.
 Section 3.2 – NewtonGregory Interpolating
Polynomials.
February 4
You should rework Exam 1 immediately after it is returned.
(Recall that a score below 60% is an F. See the course policy.)
 Do this example that shows how to use Maple to generate an
interpolating polynomial through
points.
February 10
Review Monday's notes and read Sections 5.2 and 5.3 before Tuesday's lecture. February 10
 Sections 5.2 & 5.3 – Proper Integrals:
Trapezoidal Rule and Simpson's Rules.
February 11
Note: This is a running assignment — do the problems on
this sheet as we cover the material.
 Write the Maple code for the trapezoidal rule.
February 11
NOTE: Do this immediately, and play with the code by changing the
number of subintervals, the limits of integration, even the integrand
f(x).
You will use this code as the template (model) for writing the codes for
other methods and for the second programming assignment.
 Section 5.3: Simpson's – 1/3 Rule.
February 12
 Section 5.3: Simpson's – 3/8
Rule.
February 14

Program Assignment 2.
Due Wednesday, Feb. 26 (Week 7).
Posted Feb, 16.
You should have the trapezoidal rule code (see Assignment 17)
running properly before you attempt this program assignment.
You will use it as a template (model) for this project.
Read this document before
beginning this assignment.
Click here to see an animation of
a rotating turbine rotor created using Maple.
Recall that Assignment 16 is a running assignment.
 Do all the examples in the third
Maple Tutorial
entitled Derivatives and Integrals.
February 17
 Section 5.6 – Gauss Quadrature.
February 18
 Section 5.1 – Numerical Differentiation.
February 22
START READING CHAPTER 6.
 Chapter 6 (a) – Implicit Euler Method.
February 28
 Chapter 6 – Numerical Solutions of ODEs.
February 28
This is a running assignment.
 Write this
Maple code for
Euler's Method.
March 4
NOTE: Do this immediately, and play with the code by changing the
nodal stepsize, the interval endpoints, the IC, even the ODE. Use it to
check your work on some of the homework problems.
You will use this code as the template (model) for writing the codes for
other methods and for the third project.
 Review the Maple tutorial entitled
Formatted
Printing and Plot Options.
March 4
 Turn your Maple code for the Euler method (see Assignment 26)
into the code for:
 the modified Euler method, and
 the classical Runge–Kutta method.
March 5
Don't forget that Assignment 25
is a running assignment.

Program Assignment 3.
Due Tuesday, March 18 (Week 10) at the beginning of class.
Posted Thursday, March 6.
Also read this document Programming Requirements.
See some of the results for the
sample problem in Part I.
BEWARE: The math faculty have observed that during the final 3
to 4 weeks
of a term, many students have a tendency to: 1) skip class more, and 2) let
their studies in math courses slide as they complete term projects or term
papers in other courses. Be careful not to do that! I often
see students leave entire pages blank on the final exam (indicating that
they probably did not do the assigned homework), and they consequently
seriously hurt their course grade. Remember that the final exam is worth
30% of the course grade, so make sure you continue to study and do all the
assigned homework.
 Section 6.3: RungeKuttaFehlberg
and RungeKuttaVerner Methods.
March 10
We will discuss the RunkaKuttaFehlberg method on Tuesday.
 Additional Programs for Solving IVPs.
March 10
START READING CHAPTER 2.
 Section 2.1 – Matrix Introduction.
March 11
 Section 2.2 – Gauss Elimination.
March 12
On Friday I will finish the example I started on Wed.
 Section 2.2(b) – LU Decomposition.
March 14
Recall that Program Assignment 3 is due
Tuesday (Week 10) at the beginning of class.
 Read and do these Maple
examples for solving a system of linear equations.
March 17
 Determinants and Existence–Uniqueness of Solutions.
March 18
 Section 2.2(d) – Homogeneous Systems.
March 18
 Section 2.3(b) – More on Determinants and
Singular Matrices.
March 19
Recall: Have you read the information about
our final exam under the Announcements at the top of this web page?
 Section 2.3 – Matrix Inversion.
March 19
 Section 2.4 – Vector & Matrix Norms.
March 21
 Section 2.4(c) – Residuals, Condition
Number, and IllConditioned Matrices.
March 21
 Section 2.5 – The Jacobi Method and
the GaussSeidel Method.
March 24
THE FINAL EXAM CONTENT ENDS HERE.
Click here for detailed information about the
final exam and for the crib sheet I will give you.
This info was posted several weeks ago.
