When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Ordinary differential equation - Wikipedia

    en.wikipedia.org/wiki/Ordinary_differential_equation

    e. 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] The term "ordinary" is used in contrast with partial differential equations ...

  3. Differential equation - Wikipedia

    en.wikipedia.org/wiki/Differential_equation

    An ordinary differential equation (ODE) is an equation containing an unknown function of one real or complex variable x, its derivatives, and some given functions of x. The unknown function is generally represented by a variable (often denoted y), which, therefore, depends on x. Thus x is often called the independent variable of the equation.

  4. Numerov's method - Wikipedia

    en.wikipedia.org/wiki/Numerov's_method

    Numerov's method (also called Cowell's method) is a numerical method to solve ordinary differential equations of second order in which the first-order term does not appear. It is a fourth-order linear multistep method. The method is implicit, but can be made explicit if the differential equation is linear. Numerov's method was developed by the ...

  5. 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 is known and a second linearly independent solution is desired. The method also applies to n -th order equations. In this case the ansatz will yield an (n −1)-th order ...

  6. Numerical methods for ordinary differential equations

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

    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). Their use is also known as "numerical integration", although this term can also refer to ...

  7. Abel's identity - Wikipedia

    en.wikipedia.org/wiki/Abel's_identity

    In mathematics, Abel's identity (also called Abel's formula[1] or Abel's differential equation identity) is an equation that expresses the Wronskian of two solutions of a homogeneous second-order linear ordinary differential equation in terms of a coefficient of the original differential equation. The relation can be generalised to n th-order ...

  8. Wronskian - Wikipedia

    en.wikipedia.org/wiki/Wronskian

    In mathematics, the Wronskian of n differentiable functions is the determinant formed with the functions and their derivatives up to order n – 1.It was introduced in 1812 by the Polish mathematician Józef WroĊ„ski, and is used in the study of differential equations, where it can sometimes show the linear independence of a set of solutions.

  9. Runge–Kutta–Fehlberg method - Wikipedia

    en.wikipedia.org/wiki/Runge–Kutta–Fehlberg...

    In mathematics, the Runge–Kutta–Fehlberg method (or Fehlberg method) is an algorithm in numerical analysis for the numerical solution of ordinary differential equations. It was developed by the German mathematician Erwin Fehlberg and is based on the large class of Runge–Kutta methods. The novelty of Fehlberg's method is that it is an ...