title: Java performance in numerical algorithms
body: <p>I am curious about performance of Java numerical algorithms, say for example matrix matrix double precision multiplication, using the latest JIT machines as compared for example to hand tuned SSE C++/assembler or Fortran counterparts.</p>
  
  <p>I have looked on the web but most of the results come from almost 10 years ago and I understand Java progressed quite a lot since then.</p>
  
  <p>If you have experience using Java for numerically intensive applications can you share your experience.  Also how well does Java perform in kernels where the loops are relatively short and the memory access is not very uniform but still within the limits of L1 cache? If such kernel is executed multiple times in succession, can JVM optimize it during runtime?</p>
  
  <p>Thanks</p>