-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithm
Here is the list of tools that can speed up writing julia code to implement your own algorithms. Please add or edit so things can get evolved.
The C++ library STL algorithms should be a starting point for the low level computations The current Julia standard library has implemented some of functions in the C++ library STL algorithms such as count, max, min, sum, sort, set_union, etc.
The following are the wish list in the C++ library STL algorithms that are crucial for technical computing, but not implemented yet in Julia.
- lower_bound
- upper_bound
- min_element
- max_element
- unique
- find
- ...
Alternatively, one should look into the range implementation. Taken from the email list discussion, range seems a better choice than iterator in C++. See the slides by Andrei Alexandrescu iterator must go.
GSL is a good resource for numerical computations. For example find the root of a function, solve ODE, and find the maximum of a function.
There are are lot of functions in GSL that we can use directly. These are pure C functions and should be ported into Julia directly. We probably do not need all of them, and some of them have already existed in the current julia or might be replaced by other high quality library or code rewriting, but it could be used as starting point just as the ported Rmath library immediately allows us to access a lot of statistical functions such as pnorm, qnorm, dnorm etc.