Numerical methods for ordinary differential equations

methods used to find numerical solutions of ordinary differential equations From Wikipedia, the free encyclopedia

Numerical methods for ordinary differential equations are computational schemes to obtain approximate solutions of ordinary differential equations (ODEs).

Background

Since ODEs appeared in science, many mathematicians have studied how to solve them.[1][2][3][4] However, only few of them can be mathematically solved. This is why numerical methods are needed. One of the most famous methods are the Runge-Kutta methods,[5] but it doesn't work for some ODEs (especially nonlinear ODEs). This is why new ODE solvers are developed. The following list includes frequently used methods:

  • Bulirsch-Stoer algorithm[6]
  • Euler's method (named after Leonhard Euler) and their variants
    • Backward Euler method[7]
    • Semi-implicit Euler method
    • Euler-Maruyama method[8]
  • Exponential integrator[9][10]
  • Leapfrog method
  • Linear multistep methods
  • Shooting method
  • Symplectic integrator[11][12][13][14]
  • Taylor series method[15][16]

Validated Numerics for ODEs

Not only approximate solvers, but the study to "verify the existence of solution by computers" is also active. This study is needed because numerically obtained solutions could be phantom solutions (fake solutions). This kind of incident is already reported.[17][18] The popular methods are based on the shooting method or spectral methods.[19][20] Today, European research teams[21][22][23][24][25][26][27][28][29] and Japanese experts[30][31] are working on this topic.

References

Further reading

Other websites

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.