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}
(52) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 



1

2

3
(13) 
4
(10) 
5

6
(1) 
7
(4) 
8
(4) 
9
(1) 
10
(5) 
11
(1) 
12

13

14
(5) 
15
(2) 
16

17
(2) 
18

19

20

21
(4) 
22
(8) 
23
(16) 
24
(6) 
25
(12) 
26
(4) 
27
(5) 
28
(2) 
29
(1) 
30
(2) 
31



From: Roy Stogner <roystgnr@ic...>  20130127 22:31:22

On Sun, 27 Jan 2013, Paul T. Bauman wrote: > I see the docs say that MeshBase::point_locator() is a deprecated function. > Is there an alternative to this function that's not deprecated? I have a > need for exactly this functionality  locating an element at specific point > (actually a handful of points) that isn't known until run time. There's some "sublocator" function in there that's threadsafe Sorry can't be more specific, leaving in a hurry  Roy 
From: David Knezevic <dknezevic@se...>  20130127 21:25:51

Hi K, It doesn't matter how you get the lift function. If you can construct u0 "by hand" then that's fine, but it may not always be so easy, e.g. if the domain is nontrivial. Solving a laplace problem will work in general. To do this just follow introduction_ex4 (which already has nonhomogeneous Dirichlet BCs). Re this: On 01/26/2013 07:23 PM, Kyunghoon Lee wrote: > Overall it looks like a nested problem  solving a Laplace equation > inside of a reduced basis model construction. I wonder if you'd suggest > some relevant examples/codes regarding the lift function creation. Well, you solve the Laplace problem (as in introduction_ex4), store the result, then do the RB stuff. David > > Best, > K. Lee. > > On Sun, Jan 27, 2013 at 1:43 AM, David Knezevic > <dknezevic@...>wrote: > >> To create the lift function, probably the simplest thing to do is solve >> a Laplace equation (\Laplacian u = 0) with the Dirichlet boundary >> conditions that you want, and then use the solution as your u0. This >> process is called "elliptic lifting" since the Laplace equation is an >> elliptic PDE. >> >> Then to assemble a(u0,v), you need to do something like what you wrote. >> But the code can be simplified a bit; you don't need to compute Ke and >> then multiply. You can just get the gradient of u0 directly (by >> multiplying the coefficients of u0 with c.interior_gradient) and then >> integrate. >> >> David >> >> >> >> On 01/26/2013 06:14 AM, Kyunghoon Lee wrote: >>> Thanks for the reply. Now I'd appreciate if you'd help me with the >>> implementation of a(u0,v). I was thinking of computing Ke*u0 where Ke is >>> the stiffness matrix and u0 is the lift function as below: >>> >>> //inhomogeneous Dirichlet BC >>> struct IDBCAssembly : ElemAssembly { >>> >>> short unsigned int sbd_id; >>> IDBCAssembly(short unsigned int sbd_id_in) : sbd_id(sbd_id_in) {} >>> >>> virtual void interior_assembly(FEMContext &c) { >>> >>> const unsigned int u_var = 0; >>> const std::vector<Real> &JxW = >>> c.element_fe_var[u_var]>get_JxW(); >>> const std::vector<std::vector<RealGradient> >& dphi = >>> c.element_fe_var[u_var]>get_dphi(); >>> >>> const unsigned int n_u_dofs = >> c.dof_indices_var[u_var].size(); >>> unsigned int n_qpoints = c.element_qrule>n_points(); >>> >>> // stiffness matrix Ke >>> std::vector<std::vector<Number> > Ke(n_u_dofs, >>> std::vector<Number>(n_u_dofs)); >>> for (unsigned int qp=0; qp != n_qpoints; qp++) >>> for (unsigned int i=0; i != n_u_dofs; i++) >>> for (unsigned int j=0; j != n_u_dofs; j++) >>> Ke[i][j] += JxW[qp] * dphi[j][qp] * dphi[i][qp]; >>> >>> // lift function u0 >>> std::vector<Number> u0(n_u_dofs, 0.0); >>> >>> // multiply stiffness matrix by lift function >>> for (unsigned int qp=0; qp != n_qpoints; qp++) >>> for (unsigned int i=0; i != n_u_dofs; i++) >>> for (unsigned int j=0; j != n_u_dofs; j++) >>> c.elem_residual(i) += Ke[i][j] * u0[j]; >>> } // end of interior_assembly >>> }; >>> >>> However, I'm not sure of how to create the lift function u0 such that it >>> has values for given boundary ID and zeros for elsewhere. I think I need >>> to the following: >>> >>> iterate nodes >>> if node belongs to the given boundary ID, set u0(i) = u0_given; otherwise >>> u(i) = 0.0 >>> >>> but I'm not sure of how to check whether a node is associated with >> boundary >>> ID. Can you help me with this problem, plz? (or are there examples >> related >>> to this issue?) >>> >>> Best, >>> K. Lee. >>> >>> >>> On Fri, Jan 25, 2013 at 12:38 PM, David Knezevic < >> dknezevic@... >>>> wrote: >>>> Yep, that's right, use the RB method to solve for u'. >>>> >>>> Note that you put a(u0,v) on the righthand side, since u0 is known >>>> (it's the "lifting function"). >>>> >>>> David >>>> >>>> >>>> >>>> On 01/24/2013 11:34 PM, Kyunghoon Lee wrote: >>>>> Thanks for clearing it up. Then I guess we just solve for u' >>>>> >>>>> a(u',v) + a(u0,v) = f(v) >>>>> >>>>> and attach assemblies a(u',v), a(u0,v), and f(v) as usual, then >> restore u >>>>> by u = u' + u0. >>>>> >>>>> K. Lee. >>>>> >>>>> On Fri, Jan 25, 2013 at 12:17 PM, David Knezevic < >>>> dknezevic@... >>>>>> wrote: >>>>>> Hi K, >>>>>> >>>>>> heterogeneously_constrain_element_matrix_and_vector is not relevant to >>>>>> Reduced Basis stuff. For Reduced Basis formulations, you have to >>>>>> transform the problem using a lifting function so that it has zero >>>>>> Dirichlet BC's  this is essential since you want your Reduced Basis >>>>>> space to be a vector space, i.e. it must contain 0 (which would be not >>>>>> be the case with nonzero Dirichlet BCs). This lifting function >> approach >>>>>> is what you described in your email already, so that's fine. >>>>>> >>>>>> Once you've transformed your problem using a lifting function, then >> you >>>>>> just proceed as normal, e.g. as in reduced_basis_ex1. The only trick >> is >>>>>> you have to add your lifting function back on at the end to recover u >>>>>> from u'. >>>>>> >>>>>> David >>>>>> >>>>>> >>>>>> >>>>>> On 01/24/2013 11:10 PM, Kyunghoon Lee wrote: >>>>>>> Hi all, >>>>>>> >>>>>>> In my previous email regarding inhomogeneous Dirichlet boundary >>>>>> conditions, >>>>>>> David suggested using >>>> heterogenously_constrain_element_matrix_and_vector >>>>>> in >>>>>>> introduction_ex4, but I'm not sure of how to deal with inhomogeneous >>>>>>> Dirichlet BCs in connection with reduced basis models. Suppose we >>>> have a >>>>>>> simple steady state heat conduction model whose BCs are u = T on >> \Gamma >>>>>> and >>>>>>> u = 0 on the rest surfaces. After variable change, we solve >>>>>>> >>>>>>> a(u',v) = f(v)  a(u0,v) >>>>>>> >>>>>>> where 1) u' = u  T on \Gamma and u' = u on the rest surfaces; and 2) >>>> u0 >>>>>> = >>>>>>> T on \Gamma and u0 = zero on the rest surfaces. I thought we build >> the >>>>>> LHS >>>>>>> then call attach_F_assembly to attach it, but in that case, I'm not >>>> sure >>>>>>> how heterogenously_constrain_element_matrix_and_vector can be used. >> Or >>>>>>> should we attach a(u',v) and f(v) as usual then call >>>>>>> heterogenously_constrain_element_matrix_and_vector to impose  >> a(u0,v) >>>> on >>>>>>> the LHS? I'd appreciate if someone can briefly describe how the >>>> function >>>>>>> work. >>>>>>> >>>>>>> Regards, >>>>>>> K. Lee. >>>>>>> >>  >>>>>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >>>>>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills >> current >>>>>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >>>>>>> MVPs and experts. ON SALE this month only  learn more at: >>>>>>> http://p.sf.net/sfu/learnnowd2d >>>>>>> _______________________________________________ >>>>>>> Libmeshusers mailing list >>>>>>> Libmeshusers@... >>>>>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers >>>>>> >>  >>>>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >>>>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills >> current >>>>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >>>>>> MVPs and experts. ON SALE this month only  learn more at: >>>>>> http://p.sf.net/sfu/learnnowd2d >>>>>> _______________________________________________ >>>>>> Libmeshusers mailing list >>>>>> Libmeshusers@... >>>>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers >>>>>> >>  >>>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >>>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current >>>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >>>>> MVPs and experts. ON SALE this month only  learn more at: >>>>> http://p.sf.net/sfu/learnnowd2d >>>>> _______________________________________________ >>>>> Libmeshusers mailing list >>>>> Libmeshusers@... >>>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers >>>> >>>> >>  >>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current >>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >>>> MVPs and experts. ON SALE this month only  learn more at: >>>> http://p.sf.net/sfu/learnnowd2d >>>> _______________________________________________ >>>> Libmeshusers mailing list >>>> Libmeshusers@... >>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers >>>> >>  >>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current >>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >>> MVPs and experts. ON SALE this month only  learn more at: >>> http://p.sf.net/sfu/learnnowd2d >>> _______________________________________________ >>> Libmeshusers mailing list >>> Libmeshusers@... >>> https://lists.sourceforge.net/lists/listinfo/libmeshusers >> >> >>  >> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, >> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current >> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft >> MVPs and experts. ON SALE this month only  learn more at: >> http://p.sf.net/sfu/learnnowd2d >> _______________________________________________ >> Libmeshusers mailing list >> Libmeshusers@... >> https://lists.sourceforge.net/lists/listinfo/libmeshusers >> >  > Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current > with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > MVPs and experts. ON SALE this month only  learn more at: > http://p.sf.net/sfu/learnnowd2d > _______________________________________________ > Libmeshusers mailing list > Libmeshusers@... > https://lists.sourceforge.net/lists/listinfo/libmeshusers 
From: Paul T. Bauman <ptbauman@gm...>  20130127 19:30:21

All, I see the docs say that MeshBase::point_locator() is a deprecated function. Is there an alternative to this function that's not deprecated? I have a need for exactly this functionality  locating an element at specific point (actually a handful of points) that isn't known until run time. Thanks, Paul 
From: Roy Stogner <roystgnr@ic...>  20130127 14:51:52

On Sat, 26 Jan 2013, Saurabh Srivastava wrote: > I recently switched to Libmesh 0.9xx and after quite some tweaks I was able to compile my code, > however I am baffled to witness the following when my program is run,,, > > EquationSystems > n_systems()=1 > System #0, "NavierStokes" > Type "TransientLinearImplicit" > Variables={ "u" "v" } "p" > Finite Element Types="HIERARCHIC", "JACOBI_20_00" "L2_HIERARCHIC", "JACOBI_20_00" > Infinite Element Mapping="CARTESIAN" "CARTESIAN" > Approximation Orders="THIRD", "THIRD" "SECOND", "THIRD" > n_dofs()=290 > n_local_dofs()=290 > > what intrigues me is "Jacobi_20_000" I only inserted 'u' 'v' and 'p' as Hierarchich and > L2_Hierarchic and hence not sure why those extra FE types are being picked? looks like they > correspond to infinite element types! while I have none implemented in my code. You have no infinite elements, but the EquationSystems doesn't know that. It's just telling you the approximation it would use if it were to run across any infinite elements in your Mesh.  Roy 
From: Kyunghoon Lee <aeronova.mailing@gm...>  20130127 00:23:18

Hi David, I'm afraid creating a lift function is much more complicated than I thought. I'm not sure why we need to solve a Laplace equation since we already know what the lift function looks like  some values on the nodes of the inhomogeneous Dirichlet BC and zeros elsewhere. I guess it would be much easier to directly set up a lift function by checking whether a node belongs to the inhomogeneous Dirichlet BC. Is this because we cannot create a lift function in that way? Anyway, If I follow what you suggest, I guess I need to do the following steps. 1. obtain u0 by solving a Laplace equation with inhomogeneous Dirichlet BC  maybe I can refer to introduction_ex3 for solving a Laplace equation, but somehow I need to deal with inhomogeneous Dirichlet BC by using heterogeneously_constrain_element_matrix_and_vector ? 2. assemble a(u0,v) by integrating the gradient of u0 Overall it looks like a nested problem  solving a Laplace equation inside of a reduced basis model construction. I wonder if you'd suggest some relevant examples/codes regarding the lift function creation. Best, K. Lee. On Sun, Jan 27, 2013 at 1:43 AM, David Knezevic <dknezevic@...>wrote: > To create the lift function, probably the simplest thing to do is solve > a Laplace equation (\Laplacian u = 0) with the Dirichlet boundary > conditions that you want, and then use the solution as your u0. This > process is called "elliptic lifting" since the Laplace equation is an > elliptic PDE. > > Then to assemble a(u0,v), you need to do something like what you wrote. > But the code can be simplified a bit; you don't need to compute Ke and > then multiply. You can just get the gradient of u0 directly (by > multiplying the coefficients of u0 with c.interior_gradient) and then > integrate. > > David > > > > On 01/26/2013 06:14 AM, Kyunghoon Lee wrote: > > Thanks for the reply. Now I'd appreciate if you'd help me with the > > implementation of a(u0,v). I was thinking of computing Ke*u0 where Ke is > > the stiffness matrix and u0 is the lift function as below: > > > > //inhomogeneous Dirichlet BC > > struct IDBCAssembly : ElemAssembly { > > > > short unsigned int sbd_id; > > IDBCAssembly(short unsigned int sbd_id_in) : sbd_id(sbd_id_in) {} > > > > virtual void interior_assembly(FEMContext &c) { > > > > const unsigned int u_var = 0; > > const std::vector<Real> &JxW = > > c.element_fe_var[u_var]>get_JxW(); > > const std::vector<std::vector<RealGradient> >& dphi = > > c.element_fe_var[u_var]>get_dphi(); > > > > const unsigned int n_u_dofs = > c.dof_indices_var[u_var].size(); > > unsigned int n_qpoints = c.element_qrule>n_points(); > > > > // stiffness matrix Ke > > std::vector<std::vector<Number> > Ke(n_u_dofs, > > std::vector<Number>(n_u_dofs)); > > for (unsigned int qp=0; qp != n_qpoints; qp++) > > for (unsigned int i=0; i != n_u_dofs; i++) > > for (unsigned int j=0; j != n_u_dofs; j++) > > Ke[i][j] += JxW[qp] * dphi[j][qp] * dphi[i][qp]; > > > > // lift function u0 > > std::vector<Number> u0(n_u_dofs, 0.0); > > > > // multiply stiffness matrix by lift function > > for (unsigned int qp=0; qp != n_qpoints; qp++) > > for (unsigned int i=0; i != n_u_dofs; i++) > > for (unsigned int j=0; j != n_u_dofs; j++) > > c.elem_residual(i) += Ke[i][j] * u0[j]; > > } // end of interior_assembly > > }; > > > > However, I'm not sure of how to create the lift function u0 such that it > > has values for given boundary ID and zeros for elsewhere. I think I need > > to the following: > > > > iterate nodes > > if node belongs to the given boundary ID, set u0(i) = u0_given; otherwise > > u(i) = 0.0 > > > > but I'm not sure of how to check whether a node is associated with > boundary > > ID. Can you help me with this problem, plz? (or are there examples > related > > to this issue?) > > > > Best, > > K. Lee. > > > > > > On Fri, Jan 25, 2013 at 12:38 PM, David Knezevic < > dknezevic@... > >> wrote: > >> Yep, that's right, use the RB method to solve for u'. > >> > >> Note that you put a(u0,v) on the righthand side, since u0 is known > >> (it's the "lifting function"). > >> > >> David > >> > >> > >> > >> On 01/24/2013 11:34 PM, Kyunghoon Lee wrote: > >>> Thanks for clearing it up. Then I guess we just solve for u' > >>> > >>> a(u',v) + a(u0,v) = f(v) > >>> > >>> and attach assemblies a(u',v), a(u0,v), and f(v) as usual, then > restore u > >>> by u = u' + u0. > >>> > >>> K. Lee. > >>> > >>> On Fri, Jan 25, 2013 at 12:17 PM, David Knezevic < > >> dknezevic@... > >>>> wrote: > >>>> Hi K, > >>>> > >>>> heterogeneously_constrain_element_matrix_and_vector is not relevant to > >>>> Reduced Basis stuff. For Reduced Basis formulations, you have to > >>>> transform the problem using a lifting function so that it has zero > >>>> Dirichlet BC's  this is essential since you want your Reduced Basis > >>>> space to be a vector space, i.e. it must contain 0 (which would be not > >>>> be the case with nonzero Dirichlet BCs). This lifting function > approach > >>>> is what you described in your email already, so that's fine. > >>>> > >>>> Once you've transformed your problem using a lifting function, then > you > >>>> just proceed as normal, e.g. as in reduced_basis_ex1. The only trick > is > >>>> you have to add your lifting function back on at the end to recover u > >>>> from u'. > >>>> > >>>> David > >>>> > >>>> > >>>> > >>>> On 01/24/2013 11:10 PM, Kyunghoon Lee wrote: > >>>>> Hi all, > >>>>> > >>>>> In my previous email regarding inhomogeneous Dirichlet boundary > >>>> conditions, > >>>>> David suggested using > >> heterogenously_constrain_element_matrix_and_vector > >>>> in > >>>>> introduction_ex4, but I'm not sure of how to deal with inhomogeneous > >>>>> Dirichlet BCs in connection with reduced basis models. Suppose we > >> have a > >>>>> simple steady state heat conduction model whose BCs are u = T on > \Gamma > >>>> and > >>>>> u = 0 on the rest surfaces. After variable change, we solve > >>>>> > >>>>> a(u',v) = f(v)  a(u0,v) > >>>>> > >>>>> where 1) u' = u  T on \Gamma and u' = u on the rest surfaces; and 2) > >> u0 > >>>> = > >>>>> T on \Gamma and u0 = zero on the rest surfaces. I thought we build > the > >>>> LHS > >>>>> then call attach_F_assembly to attach it, but in that case, I'm not > >> sure > >>>>> how heterogenously_constrain_element_matrix_and_vector can be used. > Or > >>>>> should we attach a(u',v) and f(v) as usual then call > >>>>> heterogenously_constrain_element_matrix_and_vector to impose  > a(u0,v) > >> on > >>>>> the LHS? I'd appreciate if someone can briefly describe how the > >> function > >>>>> work. > >>>>> > >>>>> Regards, > >>>>> K. Lee. > >>>>> > >> >  > >>>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > >>>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills > current > >>>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > >>>>> MVPs and experts. ON SALE this month only  learn more at: > >>>>> http://p.sf.net/sfu/learnnowd2d > >>>>> _______________________________________________ > >>>>> Libmeshusers mailing list > >>>>> Libmeshusers@... > >>>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers > >>>> > >>>> > >> >  > >>>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > >>>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills > current > >>>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > >>>> MVPs and experts. ON SALE this month only  learn more at: > >>>> http://p.sf.net/sfu/learnnowd2d > >>>> _______________________________________________ > >>>> Libmeshusers mailing list > >>>> Libmeshusers@... > >>>> https://lists.sourceforge.net/lists/listinfo/libmeshusers > >>>> > >> >  > >>> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > >>> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current > >>> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > >>> MVPs and experts. ON SALE this month only  learn more at: > >>> http://p.sf.net/sfu/learnnowd2d > >>> _______________________________________________ > >>> Libmeshusers mailing list > >>> Libmeshusers@... > >>> https://lists.sourceforge.net/lists/listinfo/libmeshusers > >> > >> > >> >  > >> Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > >> MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current > >> with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > >> MVPs and experts. ON SALE this month only  learn more at: > >> http://p.sf.net/sfu/learnnowd2d > >> _______________________________________________ > >> Libmeshusers mailing list > >> Libmeshusers@... > >> https://lists.sourceforge.net/lists/listinfo/libmeshusers > >> > > >  > > Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > > MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current > > with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > > MVPs and experts. ON SALE this month only  learn more at: > > http://p.sf.net/sfu/learnnowd2d > > _______________________________________________ > > Libmeshusers mailing list > > Libmeshusers@... > > https://lists.sourceforge.net/lists/listinfo/libmeshusers > > > >  > Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS, > MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current > with LearnDevNow  3,200 stepbystep video tutorials by Microsoft > MVPs and experts. ON SALE this month only  learn more at: > http://p.sf.net/sfu/learnnowd2d > _______________________________________________ > Libmeshusers mailing list > Libmeshusers@... > https://lists.sourceforge.net/lists/listinfo/libmeshusers > 