Unformatted text preview: A has α on the main diagonal, α 2 on the diagonal just above the main diagonal, and 0 elsewhere. In each case, ﬁnd values of α and starting vectors x for which the iteration converges. (Hint: in case (ii), think of matrix norms). 3. Suppose you want to ﬁnd the minimum of the function f ( x,y ) = (cos( x )1) 2 + ( x + y + 7) 2 . Write down the Newton scheme for doing this (I am not asking you to run it or to analyze its convergence, just to write down the equations; you do not have to invert the matrices either). 1...
View
Full Document
 Fall '08
 Rieffel
 Math, Numerical Analysis, Tail recursion, main diagonal, Consider iterations

Click to edit the document details