On Wed, 24 Oct 2012, Lei Shi wrote: > I would like to do some work on this. However, i'm pretty new on > libMesh. May be you can give me some instructions on how to start
The first thing to do would be creating a shim class API - something that we could #define to use vector<vector>> or Eigen or Blitz or boost::multiarray under the hood via inline functions (just accessor functions, to start, since that's all vector<vector>> ever gave us anyway). That would make it easier to actually do the benchmarking. > and what kind of benchmark we should choose. Thanks. Here I'm not sure. We don't have any explicit transient problems in the libMesh examples, do we? That's really not the kind of problem everyone had in mind when libMesh was designed, but it's probably what we want to look at if we want to benchmark the parts of the code that sometimes get lost the noise when a matrix assembly and linear solver get involved. --- Roy ------------------------------------------------------------------------------ Everyone hates slow websites. So do we. Make your web apps faster with AppDynamics Download AppDynamics Lite for free today: http://p.sf.net/sfu/appdyn_sfd2d_oct _______________________________________________ Libmesh-devel mailing list Libmesh-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-devel