You can subscribe to this list here.
2003 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}
(2) 
_{Oct}
(2) 
_{Nov}
(27) 
_{Dec}
(31) 

2004 
_{Jan}
(6) 
_{Feb}
(15) 
_{Mar}
(33) 
_{Apr}
(10) 
_{May}
(46) 
_{Jun}
(11) 
_{Jul}
(21) 
_{Aug}
(15) 
_{Sep}
(13) 
_{Oct}
(23) 
_{Nov}
(1) 
_{Dec}
(8) 
2005 
_{Jan}
(27) 
_{Feb}
(57) 
_{Mar}
(86) 
_{Apr}
(23) 
_{May}
(37) 
_{Jun}
(34) 
_{Jul}
(24) 
_{Aug}
(17) 
_{Sep}
(50) 
_{Oct}
(24) 
_{Nov}
(10) 
_{Dec}
(60) 
2006 
_{Jan}
(47) 
_{Feb}
(46) 
_{Mar}
(127) 
_{Apr}
(19) 
_{May}
(26) 
_{Jun}
(62) 
_{Jul}
(47) 
_{Aug}
(51) 
_{Sep}
(61) 
_{Oct}
(42) 
_{Nov}
(50) 
_{Dec}
(33) 
2007 
_{Jan}
(60) 
_{Feb}
(55) 
_{Mar}
(77) 
_{Apr}
(102) 
_{May}
(82) 
_{Jun}
(102) 
_{Jul}
(169) 
_{Aug}
(117) 
_{Sep}
(80) 
_{Oct}
(37) 
_{Nov}
(51) 
_{Dec}
(43) 
2008 
_{Jan}
(71) 
_{Feb}
(94) 
_{Mar}
(98) 
_{Apr}
(125) 
_{May}
(54) 
_{Jun}
(119) 
_{Jul}
(60) 
_{Aug}
(111) 
_{Sep}
(118) 
_{Oct}
(125) 
_{Nov}
(119) 
_{Dec}
(94) 
2009 
_{Jan}
(109) 
_{Feb}
(38) 
_{Mar}
(93) 
_{Apr}
(88) 
_{May}
(29) 
_{Jun}
(57) 
_{Jul}
(53) 
_{Aug}
(48) 
_{Sep}
(68) 
_{Oct}
(151) 
_{Nov}
(23) 
_{Dec}
(35) 
2010 
_{Jan}
(84) 
_{Feb}
(60) 
_{Mar}
(184) 
_{Apr}
(112) 
_{May}
(60) 
_{Jun}
(90) 
_{Jul}
(23) 
_{Aug}
(70) 
_{Sep}
(119) 
_{Oct}
(27) 
_{Nov}
(47) 
_{Dec}
(54) 
2011 
_{Jan}
(22) 
_{Feb}
(19) 
_{Mar}
(92) 
_{Apr}
(93) 
_{May}
(35) 
_{Jun}
(91) 
_{Jul}
(32) 
_{Aug}
(61) 
_{Sep}
(7) 
_{Oct}
(69) 
_{Nov}
(81) 
_{Dec}
(23) 
2012 
_{Jan}
(64) 
_{Feb}
(95) 
_{Mar}
(35) 
_{Apr}
(36) 
_{May}
(63) 
_{Jun}
(98) 
_{Jul}
(70) 
_{Aug}
(171) 
_{Sep}
(149) 
_{Oct}
(64) 
_{Nov}
(67) 
_{Dec}
(126) 
2013 
_{Jan}
(108) 
_{Feb}
(104) 
_{Mar}
(171) 
_{Apr}
(133) 
_{May}
(108) 
_{Jun}
(100) 
_{Jul}
(93) 
_{Aug}
(126) 
_{Sep}
(74) 
_{Oct}
(59) 
_{Nov}
(145) 
_{Dec}
(93) 
2014 
_{Jan}
(38) 
_{Feb}
(45) 
_{Mar}
(26) 
_{Apr}
(41) 
_{May}
(125) 
_{Jun}
(70) 
_{Jul}
(61) 
_{Aug}
(64) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 

1
(2) 
2
(2) 
3
(6) 
4
(8) 
5
(10) 
6

7
(2) 
8
(1) 
9
(5) 
10
(5) 
11
(8) 
12
(4) 
13
(5) 
14
(1) 
15
(2) 
16
(7) 
17
(3) 
18

19
(2) 
20

21

22
(5) 
23
(6) 
24
(6) 
25
(3) 
26
(2) 
27
(2) 
28
(5) 
29

30






From: jonghan Kasella <jonghan143@ar...>  20070428 21:41:42

UP 500% in 2 days http://img231.imageshack.us/my.php?image=wrwnlonub7.gif Raising a cloud of dust it then slowly moved towards the bank. 
From: Kapil Fults <F<ultsliqvf@ar...>  20070428 21:41:42

Important communique. http://img175.imageshack.us/img175/6236/w7bi1.png Other Driver Information and Sources. 
From: Jones IGNACIO <JonesIGNACIO@atarijaguar.de>  20070428 20:42:54

ANLEGER UHR BJ5N.F!!! DIE RALLYE IST GESTARTET Firma: BOERSE INVEST BETEI WKN : 797639 ISIN : CH0012802093 Markt: Frankfurt Kürzel : BJ5N.F Preis: 1.90 5Tag Prognose: 3.00 KAUFEN KAUFEN KAUFEN! BJ5N.F ESGESCHAFT FIN UNTER PARI! 
From: Hendrick Huxley <HendrickH<uxley@at...>  20070428 20:42:54

ANLEGER UHR BJ5N.F!!! DIE RALLYE IST GESTARTET Firma: BOERSE INVEST BETEI WKN : 797639 ISIN : CH0012802093 Markt: Frankfurt Kürzel : BJ5N.F Preis: 1.90 5Tag Prognose: 3.00 KAUFEN KAUFEN KAUFEN! BJ5N.F ESGESCHAFT FIN UNTER PARI! 
From: Quan danilov <Q<uan.danilov@20...>  20070428 17:44:24

For investors. http://img441.imageshack.us/img441/8237/uykmc0.jpg It had been the property of the merchant Vasu until his conversion, at which time he had presented it to the teacher variously known as Mahasamatman, Tathagatha and the Enlightened One. 
From: Betty Porteous <BettyP<orteous@as...>  20070427 05:57:00

Oklahoma WATCH OJU.F TRADE LIKE CRAZY ON FRIDAY! THIS FRANKFURT STOCK IS GOING THROUGH THE ROOF! COMPANY: ORAMED PHARMA SYMBOL: OJU.F PRICE: 0.65 TARGET: 2.15 WKN : A0J3FG ISIN : US68403P1049 WE ARE PREDICTING AMAZING GAINS ON THIS ONE! BE PART OF IT! ADD IT TO YOUR PORTFOLIO! WATCH OJU.F ON FRIDAY APRIL 27TH! Michigan Minnesota Missouri Montana Nebraska 
From: Leslye nasri <nasri@as...>  20070427 05:56:50

West WATCH OJU.F TRADE LIKE CRAZY ON FRIDAY! THIS FRANKFURT STOCK IS GOING THROUGH THE ROOF! COMPANY: ORAMED PHARMA SYMBOL: OJU.F PRICE: 0.65 TARGET: 2.15 WKN : A0J3FG ISIN : US68403P1049 WE ARE PREDICTING AMAZING GAINS ON THIS ONE! BE PART OF IT! ADD IT TO YOUR PORTFOLIO! WATCH OJU.F ON FRIDAY APRIL 27TH! Michigan Minnesota Missouri Montana Nebraska 
From: Roy Stogner <roystgnr@ic...>  20070426 14:43:58

On Thu, 26 Apr 2007, Michael Povolotskyi wrote: > Is it possible to get local coordinates of a node (on a reference > element) without calling the FEInterface::inverse_map function ? Not that I know of, at least not in any straightforward manner. You could probably instantiate a first order QGrid object to get all the local node coordinates at once, but even then the quadrature point ordering wouldn't equal the node ordering. Getting local node coordinates sounds like a generally useful function, though. If it's really not in libMesh already, and if you want to add it, maybe as something like "static Point Elem::local_node(ElemType, int)" or "virtual Point Elem::local_node(int) const", then we'd appreciate a patch.  Roy 
From: Michael Povolotskyi <povolotskyi@in...>  20070426 14:31:36

<!DOCTYPE html PUBLIC "//W3C//DTD HTML 4.01 Transitional//EN"> <html> <head> <meta content="text/html;charset=ISO88591" httpequiv="ContentType"> </head> <body bgcolor="#ffffff" text="#000000"> <font size="+1"><font face="Helvetica, Arial, sansserif">Dear Libmesh developers<br> I have one question.<br> <br> <br> Is it possible to get local coordinates of a node (on a reference element) without calling the FEInterface::inverse_map function ?<br> Thank you,<br> Michael.<br> </font></font> <pre class="mozsignature" cols="72"> </pre> </body> </html> 
From: Isaiah <tbcf@di...>  20070425 20:47:24

CHFR continues its Steady Climb, UP Another 23% Since Monday! China Fruits Corporation Symbol: CHFR Price: $0.42 CHFR is climbing steady all week. UP over 23% since Monday, investors are enjoying the solid climb. Read CHFR's recent news, and get on it Thursday! hideFeatures[j] ) this. Race Now Mode: Jump right into the driver's seat to start the race as any driver on any track. What he didn't say, though, is what is most revealing about Jarvis Moss. So, yeah, running the ball is a problem. (NASDAQ: TTWO), and Gas Powered Games, the renowned video game developer, today announced that Dungeon Siege II: Broken World for PC has gone gold and is off to manufacturing. Some people say Moss is a top 20 pick. "This is not a bad kid," said one NFC scout. 
From: li pan <li76pan@ya...>  20070425 17:08:17

Hi, I solved the problem by myself at last. c. u. pan  li pan <li76pan@...> wrote: > Dear friends, > I have again on mathematic question, which I can > solve > by myself. Can anyone tell me how to transform the > following three terms > > div ( delta_ij*delta_kl*U_lk ) + > div ( delta_ik*delta_jl*U_lk ) + > div ( delta_il*delta_jk*U_lk ) > > into: > grad(div(U)) + laplace(U) + div(grad(U)) > where, > delta_ij: Kronecker delta > U_lk partial differential of U l,k=1,2,3 > > This has nothing to do with libmesh. But I really > want > to understand it. > > thanx > > pan > > __________________________________________________ > Do You Yahoo!? > Tired of spam? Yahoo! Mail has the best spam > protection around > http://mail.yahoo.com > >  > This SF.net email is sponsored by DB2 Express > Download DB2 Express C  the FREE version of DB2 > express and take > control of your XML. No limits. Just data. Click to > get it now. > http://sourceforge.net/powerbar/db2/ > _______________________________________________ > Libmeshusers mailing list > Libmeshusers@... > https://lists.sourceforge.net/lists/listinfo/libmeshusers > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: li pan <li76pan@ya...>  20070425 13:48:43

Dear friends, I have again on mathematic question, which I can solve by myself. Can anyone tell me how to transform the following three terms div ( delta_ij*delta_kl*U_lk ) + div ( delta_ik*delta_jl*U_lk ) + div ( delta_il*delta_jk*U_lk ) into: grad(div(U)) + laplace(U) + div(grad(U)) where, delta_ij: Kronecker delta U_lk partial differential of U l,k=1,2,3 This has nothing to do with libmesh. But I really want to understand it. thanx pan __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: Roy Stogner <roystgnr@ic...>  20070424 15:29:37

On Tue, 24 Apr 2007, Tim Kröger wrote: > On Tue, 24 Apr 2007, Roy Stogner wrote: > >> On Tue, 24 Apr 2007, Tim Kröger wrote: >> >>> for (unsigned int l=0; l<n_dofs; l++) >>> { >>> system.solution>set(dof_indices_v[l], >>> (*system.current_local_solution)(dof_indices_u[l])); >>> } >> >> That might work for the elements like you're using. I wouldn't trust >> it until I dug into the code and made sure the local shape functions >> were identical and identically ordered, though. It's certain to break >> on quads or hexes. > > I tried it out and found that it doesn't work. v is discontinuous > afterwards. Yes, I suppose you're right. The Lagrange shape functions are (1xieta), xi, eta; the monomial shapes are 1, xi, eta. >> The safest thing in general would be a local L2 projection, > > I don't think I need any projection since the u space is contained in the v > space. A projection doesn't necessarily have to imply a reduction in dimensionality. Doing the code as an L2 projection would simply ensure that it worked correctly for arbitrary nested spaces. > It would suffice to do the following: For each dof of v, find the > corresponding local coordinates, then find the values of the ansatz functions > for u at these points, multiply and sum up. > > Unfortunately, I have no idea how to do this. Do you have any hint where to > find an example code that does a similar thing? No  partly because we don't have the facilities for it. You'd need the functions sigma_i which satisfy sigma_i(shape_j) == (i == j), and we don't actually have those functions in code anywhere. They're straightforward for the Lagrange elements, but you need them for the monomials. And for the monomials, the degree of freedom functionals *aren't* local coordinates. Even for the p=1 case they're linear combinations of coordinate values. If you're only going to use linear elements, your best bet is probably to work out the local transformations by hand and just plug them into a loop like you've got above. It won't be as simple as vdof_i = udof_i, but it'll be close. > Currenty, I don't plan to increase p. However, I would like to work the > thing on hex cells. You'll have to add a new FE class (named TENSORMONOMIAL? POLYNOMIAL? QMONOMIAL?) to do that if you want the spaces nested. The discontinuous MONOMIAL class uses a P1 basis even on nonsimplices; the LAGRANGE elements use Q1.  Roy 
From: <tim@ce...>  20070424 15:09:11

Dear Roy, On Tue, 24 Apr 2007, Roy Stogner wrote: > On Tue, 24 Apr 2007, Tim Kr=F6ger wrote: > >> Now my question: If I want to assign v=3Du at some point in my code >> (thus not exploiting the possibility of v to be discontinuous), can I >> do this on every cell: >> >> for (unsigned int l=3D0; l<n_dofs; l++) >> { >> system.solution>set(dof_indices_v[l],=20 >> (*system.current_local_solution)(dof_indices_u[l])); >> } > > That might work for the elements like you're using. I wouldn't trust > it until I dug into the code and made sure the local shape functions > were identical and identically ordered, though. It's certain to break > on quads or hexes. I tried it out and found that it doesn't work. v is discontinuous=20 afterwards. >> or do I have to use a quadrature rule? > > The safest thing in general would be a local L2 projection, I don't think I need any projection since the u space is contained in=20 the v space. It would suffice to do the following: For each dof of v,=20 find the corresponding local coordinates, then find the values of the=20 ansatz functions for u at these points, multiply and sum up. Unfortunately, I have no idea how to do this. Do you have any hint=20 where to find an example code that does a similar thing? > but that's > probably overkill here, and factoring even small dense matrices may > not be as cheap as you'd like. Still, if you're thinking of bumping > up p later it may be the thing to do. Currenty, I don't plan to increase p. However, I would like to=20 work the thing on hex cells. Best Regards, Tim 
From: Roy Stogner <roystgnr@ic...>  20070424 12:35:23

On Tue, 24 Apr 2007, li pan wrote: > Maybe, I didn't explain my question clearly. I need > the grad_displacemet at each node point but not at > quadrature point. In this case, I think the only thing > to do is like in MeshFunction::gradient(), > go over each element and > node_fe_value.reinit(elem,node); > Node is each node of the element. Oh, you meant to use the code inside MeshFunction::gradient(), not to actually create a MeshFunction object yourself? In that case, yes, that's probably the best way to go about things. The only problem with MeshFunction is that its PointLocator tricks are often expensive and unnecessary. Keep in mind that you can build quadrature rules that include only the nodes of an element; it may be slightly cheaper to do so and let reinit() calculate all local nodal values of an element at once.  Roy 
From: Roy Stogner <roystgnr@ic...>  20070424 12:31:32

On Tue, 24 Apr 2007, Tim Kröger wrote: > Now my question: If I want to assign v=u at some point in my code > (thus not exploiting the possibility of v to be discontinuous), can I > do this on every cell: > > for (unsigned int l=0; l<n_dofs; l++) > { > system.solution>set(dof_indices_v[l], (*system.current_local_solution)(dof_indices_u[l])); > } That might work for the elements like you're using. I wouldn't trust it until I dug into the code and made sure the local shape functions were identical and identically ordered, though. It's certain to break on quads or hexes. > or do I have to use a quadrature rule? The safest thing in general would be a local L2 projection, but that's probably overkill here, and factoring even small dense matrices may not be as cheap as you'd like. Still, if you're thinking of bumping up p later it may be the thing to do.  Roy 
From: li pan <li76pan@ya...>  20070424 10:26:06

Hallo Roy, Maybe, I didn't explain my question clearly. I need the grad_displacemet at each node point but not at quadrature point. In this case, I think the only thing to do is like in MeshFunction::gradient(), go over each element and node_fe_value.reinit(elem,node); Node is each node of the element. thanx pan  Roy Stogner <roystgnr@...> wrote: > On Mon, 23 Apr 2007, li pan wrote: > > > I have found it. MeshFunction::gradient(). Is it > > right? > > Not if you want to perform these calculations > efficiently. If your > displacement and velocity spaces are expressed in > the same basis (and > probably even if they aren't) the most efficient > thing to do is to > manually sum the local degrees of freedom times > basis gradients at > each quadrature point. See the construction of > grad_u, grad_v, etc. > in example 13. > > You're *already* going to "go over all elements, > nodes again" when > you're assembling the displacement equation matrix > and right hand > side. You might as well calculate the grad(u) > contributions at the > same time. >  > Roy > > >  li pan <li76pan@...> wrote: > > > >> Hallo, > >> I'm calculating a kind of NavierStokes equation. > >> After one "solve", I get the velocity vector. > Then > >> I'll evaluate displacement. Here, I have to > >> transform > >> the velocity vector from Euler coordinates to > >> Lagrange > >> coordinates, because of convective derivative: > >> vel: velocity at time t > >> u: displacement at time t > >> I : identity matrix > >> vel(t) = d_u/d_t + grad(u,t)*vel(t). > >> I need to do something like: > >> d_u/d_t = (I+grad(u,t))vel(t) > >> > >> My question is, how to do it effectively? I don't > >> want > >> to go over all elements, nodes again, to > calculate > >> the > >> deformation gradient. > >> Do you have good idea ? > >> > >> pan > >> > >> > >> > __________________________________________________ > >> Do You Yahoo!? > >> Tired of spam? Yahoo! Mail has the best spam > >> protection around > >> http://mail.yahoo.com > >> > > > > > > __________________________________________________ > > Do You Yahoo!? > > Tired of spam? Yahoo! Mail has the best spam > protection around > > http://mail.yahoo.com > > > > >  > > This SF.net email is sponsored by DB2 Express > > Download DB2 Express C  the FREE version of DB2 > express and take > > control of your XML. No limits. Just data. Click > to get it now. > > http://sourceforge.net/powerbar/db2/ > > _______________________________________________ > > Libmeshusers mailing list > > Libmeshusers@... > > > https://lists.sourceforge.net/lists/listinfo/libmeshusers > > > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: <tim@ce...>  20070424 08:45:46

Dear all, If I have two variables in a system (say, u and v), for both of which I use first order approximation, but u is continuous (i.e. FIRST,LAGRANGE) and v not (i.e. FIRST,MONOMIAL), I note that the number of dofs on each cell is the same for both (e.g. 4 on tetrahedrons). This is certainly not surprising. Now my question: If I want to assign v=u at some point in my code (thus not exploiting the possibility of v to be discontinuous), can I do this on every cell: for (unsigned int l=0; l<n_dofs; l++) { system.solution>set(dof_indices_v[l], (*system.current_local_solution)(dof_indices_u[l])); } or do I have to use a quadrature rule? Best Regards, Tim  Dr. Tim Kroeger CeVis  Center of Complex Systems and Visualization University of Bremen Universitaetsallee 29 (Office 3.13) tim@... D28359 Bremen Phone +494212187710 Germany Fax +494212184236 
From: Roy Stogner <roystgnr@ic...>  20070423 15:25:20

On Mon, 23 Apr 2007, Nachiket Gokhale wrote: > I am looking to learn the basics of DG FEM and write an adaptive DG > solver for static problems. Oh, and on this note: I'd personally appreciate someone doing adaptive hp with libMesh, since we've got most of the infrastructure for it now but our only experiments have been my own fiddling around. However, we currently only support isotropic adaptive refinement. Anisotropic p refinement wouldn't be too hard to add to the library on cartesian meshes, but adding anisotropic h refinement capabilities to libMesh might be quite difficult. Since the cover of Demkowicz's book shows an anisotropically p refined mesh, it occurred to me that that issue might be important to you.  Roy 
From: Roy Stogner <roystgnr@ic...>  20070423 15:19:10

On Mon, 23 Apr 2007, Nachiket Gokhale wrote: > I am looking to learn the basics of DG FEM and write an adaptive DG > solver for static problems. I am looking for a paper or book that > explains Adaptive (hp) Discontinuous Galerkin methods. It need not be > a complex or exhaustive treatment, a simple treatment for a > onedimensional or a two dimensional heat equation would be sufficient > for now. In particular, I am interested in the choice of numerical > traces, whether or not the method is stable, consistent and > convergent, error estimators and strategies for h and p refinement. > > Do you know any such papers/books? Any pointers to references would be > greatly appreciated. Leszek Demkowicz has a new book out: "Computing with hpAdaptive Finite Elements". I haven't looked at this one yet, but his Functional Analysis textbook was excellent and his research group is certainly keeping up with the cutting edge of hp research. I think they're doing more CG and 3D stuff lately, but the book focuses on 1D and 2D problems and I'd be surprised if it didn't cover DG.  Roy 
From: Nachiket Gokhale <gokhalen@gm...>  20070423 15:11:10

Hello, I am looking to learn the basics of DG FEM and write an adaptive DG solver for static problems. I am looking for a paper or book that explains Adaptive (hp) Discontinuous Galerkin methods. It need not be a complex or exhaustive treatment, a simple treatment for a onedimensional or a two dimensional heat equation would be sufficient for now. In particular, I am interested in the choice of numerical traces, whether or not the method is stable, consistent and convergent, error estimators and strategies for h and p refinement. Do you know any such papers/books? Any pointers to references would be greatly appreciated. Nachiket 
From: Roy Stogner <roystgnr@ic...>  20070423 15:04:34

On Mon, 23 Apr 2007, li pan wrote: > I have found it. MeshFunction::gradient(). Is it > right? Not if you want to perform these calculations efficiently. If your displacement and velocity spaces are expressed in the same basis (and probably even if they aren't) the most efficient thing to do is to manually sum the local degrees of freedom times basis gradients at each quadrature point. See the construction of grad_u, grad_v, etc. in example 13. You're *already* going to "go over all elements, nodes again" when you're assembling the displacement equation matrix and right hand side. You might as well calculate the grad(u) contributions at the same time.  Roy >  li pan <li76pan@...> wrote: > >> Hallo, >> I'm calculating a kind of NavierStokes equation. >> After one "solve", I get the velocity vector. Then >> I'll evaluate displacement. Here, I have to >> transform >> the velocity vector from Euler coordinates to >> Lagrange >> coordinates, because of convective derivative: >> vel: velocity at time t >> u: displacement at time t >> I : identity matrix >> vel(t) = d_u/d_t + grad(u,t)*vel(t). >> I need to do something like: >> d_u/d_t = (I+grad(u,t))vel(t) >> >> My question is, how to do it effectively? I don't >> want >> to go over all elements, nodes again, to calculate >> the >> deformation gradient. >> Do you have good idea ? >> >> pan >> >> >> __________________________________________________ >> Do You Yahoo!? >> Tired of spam? Yahoo! Mail has the best spam >> protection around >> http://mail.yahoo.com >> > > > __________________________________________________ > Do You Yahoo!? > Tired of spam? Yahoo! Mail has the best spam protection around > http://mail.yahoo.com > >  > This SF.net email is sponsored by DB2 Express > Download DB2 Express C  the FREE version of DB2 express and take > control of your XML. No limits. Just data. Click to get it now. > http://sourceforge.net/powerbar/db2/ > _______________________________________________ > Libmeshusers mailing list > Libmeshusers@... > https://lists.sourceforge.net/lists/listinfo/libmeshusers > 
From: li pan <li76pan@ya...>  20070423 14:55:26

I have found it. MeshFunction::gradient(). Is it right?  li pan <li76pan@...> wrote: > Hallo, > I'm calculating a kind of NavierStokes equation. > After one "solve", I get the velocity vector. Then > I'll evaluate displacement. Here, I have to > transform > the velocity vector from Euler coordinates to > Lagrange > coordinates, because of convective derivative: > vel: velocity at time t > u: displacement at time t > I : identity matrix > vel(t) = d_u/d_t + grad(u,t)*vel(t). > I need to do something like: > d_u/d_t = (I+grad(u,t))vel(t) > > My question is, how to do it effectively? I don't > want > to go over all elements, nodes again, to calculate > the > deformation gradient. > Do you have good idea ? > > pan > > > __________________________________________________ > Do You Yahoo!? > Tired of spam? Yahoo! Mail has the best spam > protection around > http://mail.yahoo.com > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: li pan <li76pan@ya...>  20070423 10:36:07

Hallo, I'm calculating a kind of NavierStokes equation. After one "solve", I get the velocity vector. Then I'll evaluate displacement. Here, I have to transform the velocity vector from Euler coordinates to Lagrange coordinates, because of convective derivative: vel: velocity at time t u: displacement at time t I : identity matrix vel(t) = d_u/d_t + grad(u,t)*vel(t). I need to do something like: d_u/d_t = (I+grad(u,t))vel(t) My question is, how to do it effectively? I don't want to go over all elements, nodes again, to calculate the deformation gradient. Do you have good idea ? pan __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: Fabricio Lapiz <Fabricio_Lapiz@SCR.CO.IL>  20070422 17:04:11

http://i84.imagethrust.com/i/1049593/6k1tb.gif Rise symbol report The one we are really interested in is 'eip'. 