Cheg 258 - Lecture Notes - Jan. 26, 2000
Announcements
Class notes
Scanned Notes
The main points of the lecture were
- How to avoid overflow errors
- Ill-conditioned problems
Goals:
After this class you should be able to:
- Devise an algorithm which avoids underflow and overflow errors
- Identify ill-conditioned problems
Reading
- The class notes, Ch. 2 of Hanna, and Ch. 3 of Kahaner.
Questions of the Day
- Kahaner proposes to divide or multiply a quantity by a large number to avoid overflow/underflow errors.
Can you come up with another way of doing this in computing the binomial coefficient?
- A quadratic function is non-linear in x. Why is fitting a parabola to three points a linear problem?
Matlab Example Codes
example 4
-
Homework Exercises (Due Feb. 2, 2000)
problem 4
solution
David.T.Leighton.1@nd.edu