You may be interested to have a look at the implementation I wrote in RandomMatrices.jl; the package unfortunately is broken on master and I really haven't had the time to fix yet, but this may give you some idea of what is possible in Julia.
It is also entirely possible that you can find a faster way of doing this still, in which case I would encourage you to submit a pull request to RandomMatrices.jl. https://github.com/jiahao/RandomMatrices.jl/blob/master/src/FastHistogram.jl#L41 Thanks, Jiahao Chen Staff Research Scientist MIT Computer Science and Artificial Intelligence Laboratory On Thu, Mar 20, 2014 at 8:15 PM, Jarvist Moore Frost <[email protected]> wrote: > Hello Julias, > > I've written some code implemented the 'Sturm sequence' method of > calculating the spectrum of a Tridiagonal matrix (in this case the physics > model of a Tight Binding Hamiltonian, for which we are calculating the > Density of States). The O(n*m) complexity of this makes it massively faster > than the O(n*n + m) time to calculate eigenvalues and then histogram them. > > https://github.com/jarvist/LongSnakeMoan/blob/efb0445ff24c93e48ae07b8be679f47108bcf6c3/Sturm-DoS/Sturm_Drang.jl > > Writing this in Julia was a nice experience, but I found myself still > writing in a clunky C-style way (initialising variables, and writing > for-loop iterators). Is there a guide to Julia written for those of us > seeking refuge from lower level languages? > > Best, > > Jarv
