Lisp, OCaml or what for Runge Kutta?

Posted by Eelvex on Stack Overflow See other posts from Stack Overflow or by Eelvex
Published on 2010-05-25T19:46:41Z Indexed on 2010/05/25 19:51 UTC
Read the original article Hit count: 310

Filed under:

lisp

|

ocaml

|

numerical-methods

Which language would you propose for solving a system with:

first order differential equations
complex variables
N-dimensions

using 4th order Runge Kutta or the like.

Speed matters a lot but would sacrifice for:

Elegant (clean and short) code
Flexibility + scalability

I'm mostly between a Lisp and OCaml but any other suggestion is welcomed.

Thanks!

© Stack Overflow or respective owner

Related posts about lisp

Why is Lisp useful?

as seen on Programmers - Search for 'Programmers'
Lisp obviously is an advantage for the AI stuff but it doesn't appear to me that Lisp is any faster than Java, C#, or even C. I am not a master of Lisp, but I find it incredibly difficult to understand the advantage one would get in writing Business Software in Lisp. Yet it is considered as a hacker's… >>> More
Why do you like Lisp ?

as seen on Programmers - Search for 'Programmers'
Why does Paul Graham advocate Lisp? Why did ITA Software choose Lisp over other High Level languages? Lisp obviously is an advantage for the AI stuff but I don't think Lisp is any faster than Java, C# or as a matter of fact faster than C. Still it is considered as a Hackers language? I am not a master… >>> More
Emacs 23.1 make error 139 in Mac OS X 10.6.3

as seen on Stack Overflow - Search for 'Stack Overflow'
When I try to compile GNU Emacs 23.1 on my machine with Mac OS X 10.6.3 I repeatedly get the following ending: Directories: /src/emacs-23.1/lisp/. /src/emacs-23.1/lisp/./calc /src/emacs-23.1/lisp/./calendar /src/emacs-23.1/lisp/./emacs-lisp /src/emacs-23.1/lisp/./emulation /src/emacs-23.1/lisp/./erc… >>> More
Why not port Linux kernel to Common Lisp?

as seen on Stack Overflow - Search for 'Stack Overflow'
Conventional wisdom states that OS kernels must be written in C in order to achieve the necessary levels of performance. This has been the justification for not using more expressive high level languages. However, for a few years now implementations of Common Lisp such as SBCL have proven to be… >>> More
Lisp Style question label local functions or not?

as seen on Stack Overflow - Search for 'Stack Overflow'
I was wondering if there is a standard practice regarding the use of labels in Lisp. I've been messing around with a Lisp implementation of the algorithm described in the first answer here http://stackoverflow.com/questions/352203/generating-permutations-lazily My current version uses labels to… >>> More

Related posts about ocaml

F# and OCaml

as seen on Stack Overflow - Search for 'Stack Overflow'
I hear that F# is derived from OCaml. How true is this statement? That is to say, are the resources available for learning OCaml useful to someone who wants to learn F#? What are the major differences between the two languages (aside from the fact that F# is .NET)? >>> More
Higher-order type constructors and functors in Ocaml

as seen on Stack Overflow - Search for 'Stack Overflow'
Can the following polymorphic functions let id x = x;; let compose f g x = f (g x);; let rec fix f = f (fix f);; (*laziness aside*) be written for types/type constructors or modules/functors? I tried type 'x id = Id of 'x;; type 'f 'g 'x compose = Compose of ('f ('g 'x));; type 'f fix = Fix… >>> More
Good projects to learn OCaml and F#

as seen on Stack Overflow - Search for 'Stack Overflow'
After learning the basic syntax, reading some non-trivial code is a fast way to learn a language. We can also learn how to design a library/software during reading others' code. I have following lists. A Chess program in OCaml by Tomek Czajka. Hal Daumé has written several machine learning libraries… >>> More
OCaml beginner needs help: What is wrong?

as seen on Stack Overflow - Search for 'Stack Overflow'
Code: let rec get_val (x, n) = match x with [] -> -1 | if (n=0) then (h::_) -> h else (_::t) -> get_val(t, n-1) ;; Error message: Characters 55-57: | if (n=0) then (h::_) - h ^^ Error: Syntax error >>> More
Tail-recursive merge sort in OCaml

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello world! I’m trying to implement a tail-recursive list-sorting function in OCaml, and I’ve come up with the following code: let tailrec_merge_sort l = let split l = let rec _split source left right = match source with | [] -> (left, right) | head :: tail ->… >>> More