When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Numerical methods for ordinary differential equations - Wikipedia

    en.wikipedia.org/wiki/Numerical_methods_for...

    The step size is =. The same illustration for = The midpoint method converges faster than the Euler method, as .. Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs).

  3. Cash–Karp method - Wikipedia

    en.wikipedia.org/wiki/Cash–Karp_method

    In numerical analysis, the Cash–Karp method is a method for solving ordinary differential equations (ODEs). It was proposed by Professor Jeff R. Cash [1] from Imperial College London and Alan H. Karp from IBM Scientific Center. The method is a member of the Runge–Kutta family of ODE solvers. More specifically, it uses six function ...

  4. Predictor–corrector method - Wikipedia

    en.wikipedia.org/wiki/Predictor–corrector_method

    Predictor–corrector methods for solving ODEs [ edit ] When considering the numerical solution of ordinary differential equations (ODEs) , a predictor–corrector method typically uses an explicit method for the predictor step and an implicit method for the corrector step.

  5. Heun's method - Wikipedia

    en.wikipedia.org/wiki/Heun's_method

    It is named after Karl Heun and is a numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. Both variants can be seen as extensions of the Euler method into two-stage second-order Runge–Kutta methods. The procedure for calculating the numerical solution to the initial value problem:

  6. Parker–Sochacki method - Wikipedia

    en.wikipedia.org/wiki/Parker–Sochacki_method

    If a set of ODEs has a particular form, then the Picard method can be used to find their solution in the form of a power series. If the ODEs do not have the required form, it is nearly always possible to find an expanded set of equations that do have the required form, such that a subset of the solution is a solution of the original ODEs.

  7. Dormand–Prince method - Wikipedia

    en.wikipedia.org/wiki/Dormand–Prince_method

    Dormand–Prince is the default method in the ode45 solver for MATLAB [4] and GNU Octave [5] and is the default choice for the Simulink's model explorer solver. It is an option in Python's SciPy ODE integration library [6] and in Julia's ODE solvers library. [7] Implementations for the languages Fortran, [8] Java, [9] and C++ [10] are also ...

  8. Annihilator method - Wikipedia

    en.wikipedia.org/wiki/Annihilator_method

    In mathematics, the annihilator method is a procedure used to find a particular solution to certain types of non-homogeneous ordinary differential equations (ODEs). [1] It is similar to the method of undetermined coefficients, but instead of guessing the particular solution in the method of undetermined coefficients, the particular solution is determined systematically in this technique.

  9. Spectral method - Wikipedia

    en.wikipedia.org/wiki/Spectral_method

    Spectral methods can be used to solve differential equations (PDEs, ODEs, eigenvalue, etc) and optimization problems. When applying spectral methods to time-dependent PDEs, the solution is typically written as a sum of basis functions with time-dependent coefficients; substituting this in the PDE yields a system of ODEs in the coefficients ...