Wow =) Do you have more details about the commercial solver? Is it implemented in C/C++? If yes, this might become my favorite example to show off Julia's strengths! Commercial C/C++ software looses against non commercial high level code makes up a pretty good story =)
One thing I notice while scanning through your code: You're extensively using your own type(alias). I guess you have your reasons for that, but it made it a little harder for me to read your code and reminds me a lot of C/C++. Like this, if I want to use another array type instead of your defined type, I'd need to go into your JFFoundationModule and change your code. If it would be programmed against the abstract interfaces of FloatingPoint/AbstractArray/etc..., together with type stable functions, your library would be more flexible to use, as the types would simply be defined by the input types. I don't know if you're just used to C/C++ style programming, or if your case is a little more complicated than I imagine. Anyway, thanks for this great package! :) Am Samstag, 10. Januar 2015 03:42:24 UTC+1 schrieb Petr Krysl: > > Hello all, > > Big thanks to Tim Holy and Andreas Noack. The FE solver implemented in > Julia as described previously ( > https://groups.google.com/forum/?fromgroups=#!searchin/julia-users/Krysl/julia-users/dgNqrJBZx5U/oGeXMZFjToMJ) > > has been further optimized with their helpful hints and pointers. The > comparison problem now runs in around 9.6 seconds, compared to 16 seconds > solve phase achieved with the commercial FEA software . > > Not bad, Julia! > > Petr >
