Gradient in general co-ordinates

  • Thread starter Thread starter sebb1e
  • Start date Start date
  • Tags Tags
    General Gradient
sebb1e
Messages
34
Reaction score
0

Homework Statement



I know that for a general co-ordinate system, the gradient can be expressed as it is at the bottom of this page:

http://en.wikipedia.org/wiki/Orthogo...ree_dimensions

However, the book I am working from (A First Course in Continuum Mechanics by Gonzalez and Stuart) defines it as:

"Let {ei} be an arbitrary frame. Then grad phi(x)= (partial d phi by d xi)(x) ei where (x1,x2,x3) are the coordinates of x in ei"

I don't understand how this relates to the actual definition, for example given the definition in my book, how do I show that the gradient in cylindricals contains a 1/r in front of the unit theta term?

I presume that these ei are completely general so they are not unit vectors?

I need to understand this notation properly so I can apply it to deformation gradients etc



Homework Equations





The Attempt at a Solution



From reading http://en.wikipedia.org/wiki/Curvilinear_coordinates where the same formula as the book is given, I presume it has something to do with covariant and contravariant basis but this isn't really mentioned in the book.
 
Last edited by a moderator:
Physics news on Phys.org
A circular arc, from point (r, \theta) to (r, \theta+ d\theta) will have length rd\theta. A vector, in the \theta direction, at the point with coordinates (r, \theta_0) will, similarly, have length given by r d\theta. The "1/r" is required to remove the dependence on r.
 
How would I know, merely from the definition in the book that I need that, for example if we were dealing with some totally arbitrary coordinates? (I completely understand why it is there in this case and know how to derive it)
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top