Assignments:
- Do all the examples in the first Maple tutorial entitled
Basics.
October 3
- 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.
October 5
(Because you should always read sections as we cover the material,
normally I do not post reading assignments.)
Since Maple is a required component of
this course, you should be finished or nearly finished with Assignment 1 by
now.
- Do this problem on truncation error.
(requires Acrobat Reader)
October 6
- Section 0.7 – Polynomial Nested Form /
Truncation Error.
October 6
- Do all the examples in the second Maple tutorial entitled
Solutions of Equations.
October 7
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.
- Read Section 1.1. (We began the topic on Friday, and I will post an
assignment for it on Monday.)
October 7
- Section 1.1 – Bisection Method.
October 10
You won't be able to do some of these problems until after Wednesday's
lecture.
- Write the Maple code for the
Bisection Method.
October 12
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 (model) for writing the codes for other methods and
for the first programming assignment.
- Section 1.2(a) – False Position.
October 13
- Do all the examples in the 8th Maple tutorial entitled
Formatted Printing and Plot Options.
October 13
Then change your Maple code for the bisection method so that it uses
formatted printing.
- Section 1.2(b) – Modified Linear
Interpolation.
October 13
- Section 1.4 – Müller's Method.
October 14
- Section 1.3 – Newton's Method.
October 14
-
Program Assignment 1.
Due Wednesday, Oct. 26.
(Posted Monday, Oct. 17)
Read this document before beginning this
assignment.
- You should have the bisection code (see Assignments 7 & 8)
running properly before you attempt this program assignment.
- You should also study the pseudocode for Newton's method
(Assignment 13) and use formatted printing as explained in
Assignment 10. Print each x and f to 12 decimal
places.
- Review the Rules Regarding
Programming Projects before working on this assignment.
-
Here are the
results
you should obtain from the first 3 iterations of Part I.
Do NOT proceed to Part II until Part I works correctly.
- Section 1.5 – Fixed Point Method.
October 19
- Section 1.5 – Fixed Point Method with
Aitken Acceleration.
October 20
EXAM 1 CONTENT ENDS HERE. . .
THE FINAL EXAM CONTENT BEGINS HERE. . .
EXAM 2 CONTENT BEGAN HERE. . .
- Section 3.2 – Newton-Gregory Interpolating
Polynomials.
October 27
- Do this example that shows how to use Maple to generate an
interpolating polynomial through
points.
October 28
Start reading Section 5.2, especially
over the Trapezoidal Rule.
- Sections 5.2 & 5.3 – Proper Integrals:
Trapezoidal Rule and Simpson's Rules.
October 31
We will cover Richardson Extrapolation on
Wednesday.
Note: This is a running assignment -- do the problems on
this sheet as we cover the material.
- Section 5.2 – Code for the Trapezoidal
Rule.
November 2
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.
November 3
- Section 5.3: Simpson's – 3/8 Rule.
November 4
-
Program Assignment 2.
Due Wednesday, November 16 (Week 7).
Posted and handed out Friday, November 4 (Week 5).
You should have the trapezoidal rule (see Assignment 20)
and Simpson's–1/3 rule (see Assignment 21) running properly
before you attempt this program assignment.
You will use it as a template (model) for this project.
Read this document.
Click here to see an animation of
a rotating turbine rotor created using Maple.
- Do all the examples in the third
Maple Tutorial
entitled Derivatives and Integrals.
November 7
Recall that Assignment 19 is a running assignment.
- Section 5.6 – Gauss Quadrature.
November 9
EXAM 2 CONTENT ENDED HERE.
- Section 5.1 – Numerical
Differentiation.
November 10
- If you didn't do them in Assignment 10, do all the examples in this
Maple tutorial entitled
Formatted
Printing and Plot Options.
November 16
- Chapter 6 (a) – Implicit Euler Method.
November 17
- Chapter 6 – Numerical Solutions of ODEs.
November 18
This is a running assignment.
- Write this
Maple code for Euler's Method.
November 18
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.
- Additional Programs for Solving IVPs.
November 23
This is a running assignment.
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. Be careful not to do that! Too often I
see students leave entire pages blank on the final exam (indicating that
they probably did not do the assigned homework), and consequently end up
seriously hurting 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.
-
Program Assignment 3.
Due Thursday, Dec. 8 (Week 10).
posted on Monday morning, Nov. 28 (actually Sunday evening)
See Assignments 27, 29, 30, and 31.
Also read this document Programming
Requirements.
Here are the formulas for the
Classical Runge-Kutta method.
See some of the results for the
sample problem in Part I.
- Section 6.3: Runge-Kutta-Fehlberg
and Runge-Kutta-Verner Methods.
November 30
- Section 2.1 – Matrix Introduction.
December 1
- Section 2.2 – Gauss Elimination.
December 5
- Section 2.2(b) – LU Decomposition.
December 7
- Read and do these Maple
examples for solving a system of linear equations.
December 8
- Determinants and Existence-Uniqueness of
Solutions.
December 8
- Section 2.2(d) – Homogeneous Systems.
December 9
- Section 2.3 – Matrix Inversion.
December 9
- Section 2.3(b) – More on Determinants and
Singular Matrices.
December 9
- Section 2.5 – The Jacobi Method and
the Gauss-Seidel Method.
December 12
THE FINAL EXAM CONTENT ENDS HERE.
Click here for detailed information about the
final exam.
This info was posted several weeks ago.
|
Course Policy
