Homework assignments for Math 304

Zhonggang Zeng

Homework 01
    Section 1.1:    #8, 11(a), 12
     Section 1.2:    #1(a,c,h), 2
     Section 1.3:    #6, 7
      
Homework 02
    Section 2.1:    #6, 7, 10, 11, 12
     Suggestion:  Recreate the bisection program yourself
      
Homework 03
    Section 2.2:    #1, 3, 8, 11(a,b)
      
Homework 04
    Section 2.3:    Write the secant method program
     page 75:      #6(d,e,f), 12, 13(b,c), 14(a,c)
     page 86:      #4(a), 6
      
Homework 05
    Section 2.4:    #11, Write a program for the method,
     and find an example to compare with Newton's iteration.
     Write Lagrange interpolation program
     P119, #1, 2(b,c)
      
Homework 06
    Section 3.3:    #1(a,b,c), 2(a,b,c)
     Find the interpolation polynomial by solving appropriate
     equations (show pencil work), compare with the polynomial
     generated by Hermite program.

     Find a polynomial p(x) that fits the following data

             x      f(x)    f'(x)     f"(x)
             1.1    2.3     -2.5      ---
             1.3    4.5     -2.8      ---
             1.5    ---      2.2      5.8
      
Homework 07
    #1. For given data (x_0,y_0), (x_1,y_1), ... , (x_n, y_n)
     and f'(x0)=z0, define a quadratic spline function that fits the data.
     Construct the necessary equations that would determine the 
     quadratic spline.
     #2. Write a program, using your equations in problem #1 to compute
     the coefficients of the quadratic spline. Use your results to
     draw graph of the spline.
      
Homework 08
    #1. Simplify the 3*n equations and find an efficient method
     for solving quadratic spline problem.
     #2. Section 4.1, #16
     #3. For following data:
          f(2.1)=7.1, f(2.5)=6.7, f'(2.5)=1.4
     find a two point formula that approximate f'(2.1)
      
Homework 09
     Write two programs, one for composite trapizoidal rule, one
     for composite Simpson's rule
     Section 4.4, 1(a,b,c,d), 2(a,b,c,d)
     and compare with Maple integration results.
      
Homework 10
     1.   Finish the Gaussian elimination program with scaling
     2.   Count the flops for backward substitution.
      
Homework 12
     1.   Write a program for Jacobi's iterative method.
      
Homework 13
     Section 7.3, For systems 1(e), 1(f), estimate the number
      of steps that guarentees accuracy of 10^(-5). For 1(e), estimate
      Jacobi method, for 1(f), estimate Gauss-Saidel method.