# Gradient method problems - steepest conjugate etc.

• Jan 1st 2009, 03:01 AM
trante
Gradient method problems - steepest conjugate etc.
I have three questions as a take home exam in my course. (Worried)

(Problems in the jpeg file)
• Jan 1st 2009, 03:18 AM
mr fantastic
Quote:

Originally Posted by trante
I have three questions as a take home exam in my course. (Worried)

(Problems in the jpeg file)

Has your instructor said you can get help with this take home exam? The thread is closed pending further information (you can pm me).
• Jan 1st 2009, 04:48 AM
mr fantastic
Quote:

Originally Posted by trante
I have three questions as a take home exam in my course. (Worried)

(Problems in the jpeg file)

Quote:

Originally Posted by trante
She noted that we can even ask to our graduate friends for help. This work will effect our grades %5.

[snip]

• Jan 1st 2009, 06:23 AM
TheMasterMind
Quote:

Originally Posted by trante
I have three questions as a take home exam in my course. (Worried)

(Problems in the jpeg file)

2. get $\displaystyle x_{k+1}$ from $\displaystyle x_k$ you must use $\displaystyle Q$ to evaluate $\displaystyle g_k$ and $\displaystyle Qg_k$
• Jan 2nd 2009, 01:41 PM
trante
Steepest descent
*Q1 Show the direction vectors are perpendicular to each other in the Steepest Descent Method;
that is
$\displaystyle g_{k+1}^t * g_k=0$

I know that in steepest descent, the algorithm makes zigzags.
If one vector is A and the other is B.
And the angle between them is $\displaystyle \theta$.
In vector multiplication $\displaystyle A*B=AB*cos \theta$
Because of $\displaystyle cos(90)=0$ the answer is 0.

But how can i relate it with steepest descent??