Thursday, 29 March 2012

The list of programs so far

I thought I would, in a brief blog, list the five programs that I have written for the fx-50F so far:

4 comments:

  1. So Next one solutions of differential equations numerically ? When I've got my angst about Topology over I want to have a look at the Cambridge computing stuff again and they do one on Numerical Solutions to Differential equations.

    Chris who is definitely not a robot !!

    ReplyDelete
    Replies
    1. Some time ago I wrote another program which gives a yes/no answer to whether a number is prime or not and I was gearing myself up to jotting it down here.

      I think you are right, doing something along the lines of solving differential equations numerically may be a good idea. I recall that we looked at Euler's method for first order differential equations in MST121. I had always thought I would go back and look at this. Then there is always the Cambridge stuff as you say.

      Delete
  2. One of the later units of MST209 is based on a) the Euler method and b) The Runge Kutta Method which is more accurate and stable as it is based on some form of average of the nearby points and not just the previous one as the Euler method is.

    ReplyDelete
    Replies
    1. I have heard of Runge Kutta. When I worked as a research assitant we had access to libraries of code that could do all sorts of numerical tricks and this was probably one of them.

      Delete