7 sample documents related to MATH 651

• 

  view
  assignment5.pdf

  Colorado State MATH 651
  

  Math 651, Assignment 5 Due Friday, November 17 Overview In this assignment, you will program the quasi-Newton algorithm developed in class and then use your program to explore a series of test problems. Your program should have the option of using a
  http://www.math.colostate.edu/~estep/education/651/assignment5.pdf
   
• 

  view
  assignment4.pdf

  Colorado State MATH 651
  

  Math 651, Assignment 4 Due Monday, October 23 1. Show that the xed point iteration for g(x) = 1/(1 + x2 ) converges on any nite interval [a, b] that contains [0, 1]. 2. Show that the xed point iteration for g(x) = .5 sin(x1 + x2 ) 1/(2 + x1 + x2 ) c
  http://www.math.colostate.edu/~estep/education/651/assignment4.pdf
   
• 

  view
  assignment1.pdf

  Colorado State MATH 651
  

  Math 651, Assignment 1 Due Wednesday, September 6 1. Determine r1 and r2 such that xs belongs to L1 (0, 1) for s < r1 and to L2 (0, 1) for s < r2 respectively. 2. Draw rough sketches of the Lagrange nodal basis polynomials for P 3 (a, b) with nodes x
  http://www.math.colostate.edu/~estep/education/651/assignment1.pdf
   
• 

  view
  assignment6.pdf

  Colorado State MATH 651
  

  Math 651, Assignment 6 Due Friday, December 1 1. Compute a quadrature formula for a and b to get Q(f ) = b a f (x) dx by using the cubic Hermite interpolant of f at (b a)2 ba (f (a) + f (b) (f (b) f (a) 2 12 and determine the degree of precis
  http://www.math.colostate.edu/~estep/education/651/assignment6.pdf
   
• 

  view
  equation146.pdf

  Colorado State MATH 651
  

   
  http://www.math.colostate.edu/~estep/education/651/equation146.pdf
   
• 

  view
  assignment7.pdf

  Colorado State MATH 651
  

  Math 651, Assignment 7 Due Wednesday, December 13 1. Write down the formulas defining the Gauss quadrature formula using 9 nodes for approxi1 mating -1 f (x) dx. Hint: this formula has precision 17. 2. Solve these equation using your code for solvin
  http://www.math.colostate.edu/~estep/education/651/assignment7.pdf
   
• 

  view
  quasinewtonalgorithm.pdf

  Colorado State MATH 651
  

  Algorithm for Quasi-Newton Method Input f = function xold = initial guess maxnewt = maximum number of Newton iterations tol = tolerance for stopping criteria = parameter determining required amount of decrease in function value = amount by which st
  http://www.math.colostate.edu/~estep/education/651/quasinewtonalgorithm.pdf