Homework for Numerical Methods II

    Homework #1 Due Feb 6
        Greenspan Chapter 6 # 1, 3, 6
    Homework #2 Due Feb 25
        Iserles Chapter 7 # 1, 3, 6, 8
    Homework #3 Due Apr 3
        Iserles Chapter 10 # 3, 4, 5, 7
    Homework #4 Due Apr 24
        Greenspan Chapter 7 # 1, 7, 12
        Burden & Faires Chapter 12.2 # 7

        State and prove a discrete version of the convolution
        theorem g*h <=> G(f)H(f) given as 12.0.9 in Numerical
        Recipies by Press, Teukolsky, Vetterling and Flannery.

    Homework #5 Due May 8
        Half of programming assignment #3 will be counted as
        this homework assignment.