Health.Zone Web Search

Search results

  1. Results from the Health.Zone Content Network
  2. 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.

  3. Cauchy–Euler equation - Wikipedia

    en.wikipedia.org/wiki/Cauchy–Euler_equation

    Cauchy–Euler equation. In mathematics, an Euler–Cauchy equation, or Cauchy–Euler equation, or simply Euler's equation is a linear homogeneous ordinary differential equation with variable coefficients. It is sometimes referred to as an equidimensional equation. Because of its particularly simple equidimensional structure, the differential ...

  4. Matrix differential equation - Wikipedia

    en.wikipedia.org/wiki/Matrix_differential_equation

    Matrix differential equation. A differential equation is a mathematical equation for an unknown function of one or several variables that relates the values of the function itself and its derivatives of various orders. A matrix differential equation contains more than one function stacked into vector form with a matrix relating the functions to ...

  5. Numerical methods for ordinary differential equations - Wikipedia

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

  6. Euler method - Wikipedia

    en.wikipedia.org/wiki/Euler_method

    It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1770). [1]

  7. Heun's method - Wikipedia

    en.wikipedia.org/wiki/Heun's_method

    Heun's method. In mathematics and computational science, Heun's method may refer to the improved [1] or modified Euler's method (that is, the explicit trapezoidal rule [2] ), or a similar two-stage Runge–Kutta method. It is named after Karl Heun and is a numerical procedure for solving ordinary differential equations (ODEs) with a given ...

  8. Linear differential equation - Wikipedia

    en.wikipedia.org/wiki/Linear_differential_equation

    The general form of a linear ordinary differential equation of order 1, after dividing out the coefficient of y′ (x), is: If the equation is homogeneous, i.e. g(x) = 0, one may rewrite and integrate: where k is an arbitrary constant of integration and is any antiderivative of f.

  9. Backward differentiation formula - Wikipedia

    en.wikipedia.org/wiki/Backward_differentiation...

    Backward differentiation formula. The backward differentiation formula ( BDF) is a family of implicit methods for the numerical integration of ordinary differential equations. They are linear multistep methods that, for a given function and time, approximate the derivative of that function using information from already computed time points ...