Recent content by pinodk

Never mind... i got it now... stupid me :frown:

I have looked at the formula listed, but i don't know quite how to use it... Suppose i have an inertia tensor in the center of mass like this \left(\begin{array}{c c c} 1&0&0\\0&1&0\\0&0&1\end{array}\right) The mass m is 2 kg, and the distance vector R is \left(\begin{array}{c}...

I had a sudden struck of enlightment... Is it really as simple as just taking d+h and and using as h in the matrix?

Homework Statement I have a cylinder, for which i want to find the inertia tensor. http://www.mip.sdu.dk/~pino/inertiacyl.JPG Where the rotational axis are either the x (red) or y (green). Homework Equations I know that the inertia tensor for a cylinder is of the form...

Oops, i should have posted this in the homework section,, don't know how to move it, so will repost there.

I have a cylinder, for which i want to find the inertia tensor. http://www.mip.sdu.dk/~pino/inertiacyl.JPG Where the rotational axis are either the x (red) or y (green). I know that the inertia tensor for a cylinder is of the form http://www.mip.sdu.dk/~pino/inertiamoment-cylinder.jpg...

Oh, ok, I didnt make a clear distinction between a convex and a concave function. I didnt have a clear definition of convex and concave, so it makes more sense now, given your definition, and concave is then the opposite, and so makes (1) true. thanks!

I would like to be sure in the following, not prove it, just have it confirmed... If a function f is convex, then it has 1.) only one maximum and no minimum 2.) only one minimum and no maximum infinity and -infinity are not included.

You have the denominator 4k^2-1 = (2k+1)(2k-1) therefore i believe you should get \frac{1}{4k^2-1} = \frac{1}{(2k+1)}+\frac{1}{(2k-1)} Then you know that: \sum_{k=1}^n \frac{1}{4k^2-1} = \sum_{k=1}^n \frac{1}{(2k+1)} + \sum_{k=1}^n \frac{1}{(2k-1)} You should then try to find expressions...

If I understand your assignment correctly, you already have the formulas for the two expressions \sum_{k=1}^n k^2 \sum_{k=1}^nk So just put a "+" between them :-) and simplify them even more if possible... But being foreign and all, i could have misinterpreted what you wrote, so please...

guess I am not the only one finding it difficult, eh? Or have i been unclear in the formulation?

You have seen the last line of the above reply right? So you have: \sum_{k=1}^nk\left(k+1\right)=\sum_{k=1}^n k^2+\sum_{k=1}^nk that should take you off

I have two excercises which have been causing me to tear my hair off for some time now. (a) the power method to find largest eigenvalue of A is defined as x(k+1) = Ax(k) (b) the inverse power method is to solve Ax(k+1) = x(k) to find smallest eigenvalue of A (c) the smallest/largest...

Hello there! yet another proof, that i need help on I am supposed to prove that the following statement holds for the secant method dk+1/ek -> -1 for k->Infinity where dk+1 is the next change and ek is the error. I have this idea, but i want to hear whether its a valid proof. i use...

About the (x/||x||)||x|| being equal to x... Doh! Of course i can see that... sorry :-S