Math library on the BOOST licence.
Hi Are there any similar to GSL library which is designed using templates and on the BOOST license. I would like to join to such a project - I have developed Runge-Kutta generic solver maybe it can be useful, at present I preparing other designs, but maybe somewhere other is done. Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'
Seweryn Habdank-Wojewódzki wrote:
Hi
Are there any similar to GSL library which is designed using templates and on the BOOST license.
I would like to join to such a project - I have developed Runge-Kutta generic solver maybe it can be useful, at present I preparing other designs, but maybe somewhere other is done.
There is some work in progress here: www.johnmaddock.co.uk/toolkit An older version of the code is also in the Boost.Vault. The emphasis is on statistical distributions and special functions, which is rather different from what you're proposing. There has also been some discussion of ODE solvers and numeric integration in general on this list, with several solutions presented, I suggest you begin by checking through the list archives, and seeing where best to go from there. We do need more methods like this in Boost, the main sticking point for ODE's and integration in general appears to be finding the right interface design (as ever!). HTH, John.
Hi John Maddock wrote:
There is some work in progress here: www.johnmaddock.co.uk/toolkit
Great job. May I download it?
The emphasis is on statistical distributions and special functions, which is rather different from what you're proposing.
My proposition is just an simple example, of the design. If I can say something about my design style, I have other more complicated math example http://knnl.sf.net and description is http://accu.org/var/uploads/journals/overload74.pdf from page 23. Unfortunately library is not on the Boost licence. Maybe next version I will prepare with Boost licence. In preparation I have adaptive Runge-Kutta (4,5) method. I am looking for some tips if there is possible to make generalized Runge-Kutta method. In math books there is an algorithm how to calculate all coefficients for RK algorithm, but the point is that in templates I need to use only integral types, so I need to have all coefficients split in to the two parts: numerator and denominator, and prepare dedicated algorithm to work with such a fractional numbers to calculate RK coefficients in compile time. Otherwise it is easy to do algorithm which prepares coefficients in constructor of the solver, because double numbers are possible.
We do need more methods like this in Boost, the main sticking point for ODE's and integration in general appears to be finding the right interface design (as ever!).
This is the reason why I want to join somewhere - I want to exchange experience on the generative design for the math purpose. Regards and thanks. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'
Seweryn Habdank-Wojewódzki wrote:
Hi
John Maddock wrote:
There is some work in progress here: www.johnmaddock.co.uk/toolkit
Great job. May I download it?
Thanks, there's instructions here: http://www.johnmaddock.co.uk/software.html But we'll also be posting a new release in the Boost Vault (and asking for a review in all likelyhood) real soon now...
The emphasis is on statistical distributions and special functions, which is rather different from what you're proposing.
My proposition is just an simple example, of the design. If I can say something about my design style, I have other more complicated math example http://knnl.sf.net and description is http://accu.org/var/uploads/journals/overload74.pdf from page 23. Unfortunately library is not on the Boost licence. Maybe next version I will prepare with Boost licence.
In preparation I have adaptive Runge-Kutta (4,5) method.
I am looking for some tips if there is possible to make generalized Runge-Kutta method. In math books there is an algorithm how to calculate all coefficients for RK algorithm, but the point is that in templates I need to use only integral types, so I need to have all coefficients split in to the two parts: numerator and denominator, and prepare dedicated algorithm to work with such a fractional numbers to calculate RK coefficients in compile time. Otherwise it is easy to do algorithm which prepares coefficients in constructor of the solver, because double numbers are possible.
There is a library in the Boost Vault that does compile-time math, but I haven't had a chance to play with it yet, you might be able to adapt that to calculate the coefficients at compile time. The big problem is likely to be avoiding numeric overflow in the fractions, however. John.
Hi again John Maddock wrote:
There is a library in the Boost Vault that does compile-time math, but I haven't had a chance to play with it yet, you might be able to adapt that to calculate the coefficients at compile time. The big problem is likely to be avoiding numeric overflow in the fractions, however.
If it will had any problem with calculation, there can be prepared some dedicated (with fixed rank) numeric methods, and can be prepared some more general, but coefficients will be calculated in constructor, and only rank will be set as template parameter. I will look. Regards. -- |\/\/| Seweryn Habdank-Wojewódzki `\/\/'
participants (2)
-
John Maddock
-
Seweryn Habdank-Wojewódzki