I have been thinking about numerical methods for ODEs, and the whole notion of stability confuses me.(adsbygoogle = window.adsbygoogle || []).push({});

Take Euler's method for solving an ODE:

U_n+1 = U_n + h.A.U_n

where U_n = U_n( t ), A is the Jacobian and h is step size.

Rearrange:

U_n+1 = ( 1 + hA ).U_n

This method is only stable if (1 + hA) < 1 ( using the eigenvalues of A). But what does this mean!?? Every value of my function that I am numerically getting is less than the previous value. This seems rather useless, I don't get it? It appears to me that this method can only be used on functions that are strictly decreasing for all increasing t ???

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Stability of an ODE and Euler's method

Loading...

Similar Threads for Stability Euler's method | Date |
---|---|

I Cauchy-Euler Diff. Eqn | Apr 2, 2018 |

A Stability for a system of nonlinear ODEs | Mar 20, 2018 |

A How is this 'root stability' differential equation derived? | Nov 21, 2016 |

I Runge-Kutta Stability Regions | Nov 16, 2016 |

I Meaning of stability regions | Oct 30, 2016 |

**Physics Forums - The Fusion of Science and Community**