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

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

  5. Euler–Lagrange equation - Wikipedia

    en.wikipedia.org/wiki/Euler–Lagrange_equation

    In the calculus of variations and classical mechanics, the Euler–Lagrange equations[1] are a system of second-order ordinary differential equations whose solutions are stationary points of the given action functional. The equations were discovered in the 1750s by Swiss mathematician Leonhard Euler and Italian mathematician Joseph-Louis Lagrange.

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

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

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

  9. Runge–Kutta methods - Wikipedia

    en.wikipedia.org/wiki/Runge–Kutta_methods

    t. e. In numerical analysis, the Runge–Kutta methods (English: / ˈrʊŋəˈkʊtɑː / ⓘ RUUNG-ə-KUUT-tah[1]) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations. [2]