Thank you for your replies, I wrote the numeric code myself. It's heavily optimized for speed, and as such, it doesn't contain many explicit matrix multiplications and/ or inversions. All calculations have been expanded to minimize the instruction count.
You seem to know a lot about this, so I can be more specific. I'm using a conjugate gradient method for solving (and caching) systems of equations, so there's no need to explicitly form a matrix (therefore object allocation isn't a problem). The second most processor- intensive operation is my lineary complementarity solver which has also had all it's matrix equations expanded to minimize instruction count. Anyway, my Java code makes heavy use of mutable primitives, and loops, to do this. What's the appropriate approach in Clojure for translating this sort of code? I just need to minimize performance costs for -iteration -and basic arithmetic on primitives. Thanks for your help -Patrick --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
