enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Numerical methods for ordinary differential equations

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

    First-order means that only the first derivative of y appears in the equation, and higher derivatives are absent. Without loss of generality to higher-order systems, we restrict ourselves to first-order differential equations, because a higher-order ODE can be converted into a larger system of first-order equations by introducing extra variables.

  3. 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:

  4. Reduction of order - Wikipedia

    en.wikipedia.org/wiki/Reduction_of_order

    Reduction of order (or d’Alembert reduction) is a technique in mathematics for solving second-order linear ordinary differential equations. It is employed when one solution y 1 ( x ) {\displaystyle y_{1}(x)} is known and a second linearly independent solution y 2 ( x ) {\displaystyle y_{2}(x)} is desired.

  5. Frobenius solution to the hypergeometric equation - Wikipedia

    en.wikipedia.org/wiki/Frobenius_solution_to_the...

    In the following we solve the second-order differential equation called the hypergeometric differential equation using Frobenius method, named after Ferdinand Georg Frobenius. This is a method that uses the series solution for a differential equation, where we assume the solution takes the form of a series. This is usually the method we use for ...

  6. Runge–Kutta methods - Wikipedia

    en.wikipedia.org/wiki/Runge–Kutta_methods

    Runge–Kutta–Nyström methods are specialized Runge–Kutta methods that are optimized for second-order differential equations. [22] [23] A general Runge–Kutta–Nyström method for a second order ODE system ¨ = (,,,) with order is with the form

  7. Predictor–corrector method - Wikipedia

    en.wikipedia.org/wiki/Predictor–corrector_method

    In numerical analysis, predictor–corrector methods belong to a class of algorithms designed to integrate ordinary differential equations – to find an unknown function that satisfies a given differential equation. All such algorithms proceed in two steps:

  8. Trapezoidal rule (differential equations) - Wikipedia

    en.wikipedia.org/wiki/Trapezoidal_rule...

    In numerical analysis and scientific computing, the trapezoidal rule is a numerical method to solve ordinary differential equations derived from the trapezoidal rule for computing integrals. The trapezoidal rule is an implicit second-order method, which can be considered as both a Runge–Kutta method and a linear multistep method.

  9. Ordinary differential equation - Wikipedia

    en.wikipedia.org/wiki/Ordinary_differential_equation

    In mathematics, an ordinary differential equation (ODE) is a differential equation (DE) dependent on only a single independent variable.As with other DE, its unknown(s) consists of one (or more) function(s) and involves the derivatives of those functions. [1]