On Wed, 5 Dec 2012, Derek Gaston wrote: > In his case he is solving with over 2,000 variables > > We also have other users solving with 20-200 variables of the same
It would be interesting to know of other places where users are greatly exceeding our original estimates of what "N" might be in cases where we're designing O(f(N)) algorithms. E.g. I just blithely told Vikram not to worry about writing an O(N_vectors_per_System) bit of code, for instance, because in my typical codes (solution, old solution, rhs, qoi0-adjoint, qoi1-adjoint...) N might be around 6, but perhaps the reduced-basis people or others vastly exceed that. (In this case the constant is small and the code isn't in any inner loops so he's probably fine even for N=6000, but you see the general idea). --- Roy ------------------------------------------------------------------------------ LogMeIn Rescue: Anywhere, Anytime Remote support for IT. Free Trial Remotely access PCs and mobile devices and provide instant support Improve your efficiency, and focus on delivering more value-add services Discover what IT Professionals Know. Rescue delivers http://p.sf.net/sfu/logmein_12329d2d _______________________________________________ Libmesh-devel mailing list Libmesh-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-devel
