I've got a lot recursion relation that takes multiple hours at a time to run. I'm looking for some subtle reasons why it takes so long, and hoping to be able to reduce the time it takes for the more complicated and bigger processes.
My first thought was obviously to do with unnecessary pattern matching, which I've done my best to eliminate. A more seemingly trivial one was how MMA deals with symbols such as
y etc, vs say
y3. Is it worthwhile swapping from this argument-holding general functions into these mere undefined symbols?
Edit to clarify- Which does MMA process faster - an symbolic function or a symbolic number?
Edit2 - Which of the two above would you use?