For example, with this differential equation, how can I do it in a pythonic way?


I have a way to do it, but I think this is not the most pythonic way:

import numpy as np
def f(x,t):
    return x**2*t#insert your favorite function here
for i in range(N_iter-1):
  • 2
    \$\begingroup\$ What was wrong with scipy.integrate? \$\endgroup\$ Feb 13, 2014 at 20:50
  • \$\begingroup\$ What makes you think the code isn't Pythonic? (apart from PEP8 issues) \$\endgroup\$ Feb 14, 2014 at 10:25
  • \$\begingroup\$ Well I thought that there was only one pythonic way to do something and I was wondering if I was doing it right. The problem with 'scipy.integrate' is that I must do each step in turn inside a loop. \$\endgroup\$
    – gota
    Feb 14, 2014 at 16:01
  • 1
    \$\begingroup\$ @NunoCalaim: Have you looked at scipy.integrate.odeint? \$\endgroup\$ Feb 19, 2014 at 13:46

1 Answer 1


Using a for loop is not an unpythonic way at all. Instead, an Euler method could be implemented with a recursive function, but it not necessary and less optimized in Python.

However, methods for vectorizing recursive sequences are discussed on the numpy-discussion mailing-list. I encourage you to use structures like for loops in such situations. You will minimize the risk of errors by writing simple and concise codes.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.