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}
(66) 
_{Sep}
(60) 
_{Oct}
(110) 
_{Nov}
(27) 
_{Dec}
(30) 
2015 
_{Jan}
(43) 
_{Feb}
(67) 
_{Mar}
(71) 
_{Apr}
(92) 
_{May}
(39) 
_{Jun}
(15) 
_{Jul}
(46) 
_{Aug}
(63) 
_{Sep}
(84) 
_{Oct}
(82) 
_{Nov}
(69) 
_{Dec}
(45) 
2016 
_{Jan}
(92) 
_{Feb}
(91) 
_{Mar}
(148) 
_{Apr}
(43) 
_{May}
(58) 
_{Jun}
(117) 
_{Jul}
(92) 
_{Aug}
(140) 
_{Sep}
(49) 
_{Oct}
(33) 
_{Nov}
(85) 
_{Dec}
(40) 
2017 
_{Jan}
(41) 
_{Feb}
(36) 
_{Mar}
(49) 
_{Apr}
(41) 
_{May}
(73) 
_{Jun}
(51) 
_{Jul}
(12) 
_{Aug}
(45) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 




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

19

20
(2) 
21

22
(1) 
23
(11) 
24

25

26
(2) 
27
(7) 
28
(12) 
29
(9) 
30
(7) 
31
(2) 

From: John Peterson <peterson@cf...>  20060323 17:19:44

Shengli Xu writes: > On 3/23/06, Shengli Xu <shengli.xu.xu@...> wrote: > > > > Dear Developers and Users, > > I want to get the node's coordinate from the node vector. > > // define node vector > > typedef std::vector<Node*> evec; > > evec Nevec; > > { > > // add some node to Nevec through Nevec.push_back() > > } > > for(evec::iterator it = Nevec.begin(); it !=Nevec.end(); ++it){ > > > > // Is this right to get the node coordinate? Compile shows that is > error. > > > const Real nx = (*it)(0); > > const Real ny = (*it)(1); Dereferencing the iterator with *it returns a Node*. Thus you can do (*it)>operator()(0); // awkward! Or (*(*it))(0) // holy parentheses batman! Or Node *node = *it; (*node)(0); John 
From: John Peterson <peterson@cf...>  20060323 17:07:18

David Xu writes: > Hi, > > How can I perform Matrixvector multiplication for SparseMatrix? The > SparseMatrix class doesn't seem to have such capability. Hi, What you need is the add_vector(x,A) routine in numeric_vector.h J 
From: Benjamin S. Kirk <benjamin.kirk@na...>  20060323 15:01:27

On Thu, 20060323 at 08:27 0600, Roy Stogner wrote: > On Thu, 23 Mar 2006, li pan wrote: > > > The penalty method was used to set boundary condition > > in ex13. Can I use DenseMatrix::condense() in stead of > > penalty method? > > In general, not easily. Even if you know the nodal values implied by > your boundary conditions (which may not be easy for nonLagrange > elements), what happens when you have boundary nodes that are on > nonboundary elements? (picture a triangulated domain, for example, > or an interior corner on a mesh of quads). You'd need to use > condense() on every element matrix that included your boundary node, > which means you'd have to store a pernode "I'm on the boundary" flag > somewhere; libMesh only keeps track of boundary element sides. > Agreed. You can use the condense method, but you have to avoid the pitfall Roy describes. However, the BoundaryInfo class does keep track of boundary nodes for the boundary sides it tracks. The only possible problem is when you have, for example, a corner node which lives on two sides with two separate BC ids. This does give you the option of using the condense method for Lagrange elements, but as Roy points out you can no longer restrict your boundary condition applications to elements with a side on the boundary. See http://libmesh.sourceforge.net/doxygen/classBoundaryInfo.html#a6 Now, since only level0 elements have their side BCs stored then only their nodes will get added in this automatic way. But, as a preprocessing step, you could loop through all active elements on the boundary and add their nodes to the BoundaryInfo class. > > Another simple question, how to calculate invert matrix in libmesh? > > There is no inverse, I'm afraid; nobody has needed anything more than > linear system solves with DenseMatrix. It's rare that you really need > a matrix inverse, but if you do you can call lu_solve() or > cholesky_solve() with each of N unit vectors to build one. Roy's right here too ;) To quote one of my professors, "we only invert matrices under the penalty of death." Also, multiple subsequent lu_solve()'s will only perform the O(n^3) factorization once and then just do a series of O(n^2) back substitutions. See http://libmesh.sourceforge.net/doxygen/classDenseMatrix.html#a19 Ben 
From: Roy Stogner <roystgnr@ic...>  20060323 14:29:53

On Thu, 23 Mar 2006, Shengli Xu wrote: > On 3/23/06, Shengli Xu <shengli.xu.xu@...> wrote: >> >> Dear Developers and Users, >> I want to get the node's coordinate from the node vector. >> // define node vector >> typedef std::vector<Node*> evec; >> evec Nevec; >> { >> // add some node to Nevec through Nevec.push_back() >> } >> for(evec::iterator it = Nevec.begin(); it !=Nevec.end(); ++it){ >> > > // Is this right to get the node coordinate? Compile shows that is > error. > >> const Real nx = (*it)(0); >> const Real ny = (*it)(1); > No; (it) is an iterator to pointers to Nodes; (*it) is a pointer to Node; you want (**it)(0) and (**it)(1) to operate on the Nodes themselves.  Roy Stogner 
From: Roy Stogner <roystgnr@ic...>  20060323 14:28:06

On Thu, 23 Mar 2006, li pan wrote: > The penalty method was used to set boundary condition > in ex13. Can I use DenseMatrix::condense() in stead of > penalty method? In general, not easily. Even if you know the nodal values implied by your boundary conditions (which may not be easy for nonLagrange elements), what happens when you have boundary nodes that are on nonboundary elements? (picture a triangulated domain, for example, or an interior corner on a mesh of quads). You'd need to use condense() on every element matrix that included your boundary node, which means you'd have to store a pernode "I'm on the boundary" flag somewhere; libMesh only keeps track of boundary element sides. > Another simple question, how to calculate invert matrix in libmesh? There is no inverse, I'm afraid; nobody has needed anything more than linear system solves with DenseMatrix. It's rare that you really need a matrix inverse, but if you do you can call lu_solve() or cholesky_solve() with each of N unit vectors to build one.  Roy 
From: Roy Stogner <roystgnr@ic...>  20060323 14:18:47

On Thu, 23 Mar 2006, li pan wrote: > I need a tensor of order 4. Is this defined in > libmesh? No; after implementing 2nd order tensors I realized that even those were hard to generalize efficiently due to possible symmetry. Even if you've got a 4th order tensor conceptually, it's very unlikely that you've got the 81 independent coefficients that such a tensor would require in a general implementation.  Roy Stogner 
From: David Xu <dxu@my...>  20060323 13:54:15

Hi, How can I perform Matrixvector multiplication for SparseMatrix? The SparseMatrix class doesn't seem to have such capability. Thanks, David 
From: Shengli Xu <shengli.xu.xu@gm...>  20060323 12:19:15

On 3/23/06, Shengli Xu <shengli.xu.xu@...> wrote: > > Dear Developers and Users, > I want to get the node's coordinate from the node vector. > // define node vector > typedef std::vector<Node*> evec; > evec Nevec; > { > // add some node to Nevec through Nevec.push_back() > } > for(evec::iterator it =3D Nevec.begin(); it !=3DNevec.end(); ++it){ > // Is this right to get the node coordinate? Compile shows that is error. > const Real nx =3D (*it)(0); > const Real ny =3D (*it)(1); > Cheers, ShengliXu 
From: Shengli Xu <shengli.xu.xu@gm...>  20060323 12:15:34

Dear Developers and Users, I want to get the node's coordinate from the node vector. // define node vector typedef std::vector<Node*> evec; evec Nevec; { // add some node to Nevec through Nevec.push_back() } for(evec::iterator it =3D Nevec.begin(); it !=3DNevec.end(); ++it){ const Real nx =3D (*it)(0); const Real ny =3D (*it)(1); 
From: li pan <li76pan@ya...>  20060323 11:37:53

Dear all, The penalty method was used to set boundary condition in ex13. Can I use DenseMatrix::condense() in stead of penalty method? Another simple question, how to calculate invert matrix in libmesh? best pan __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 
From: li pan <li76pan@ya...>  20060323 10:34:45

Dear everyone, I need a tensor of order 4. Is this defined in libmesh? best pan __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com 