enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Euler method - Wikipedia

    en.wikipedia.org/wiki/Euler_method

    In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value.

  3. Numerical methods for ordinary differential equations

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

    Many differential equations cannot be solved exactly. For practical purposes, however – such as in engineering – a numeric approximation to the solution is often sufficient. The algorithms studied here can be used to compute such an approximation. An alternative method is to use techniques from calculus to obtain a series expansion of the ...

  4. Explicit and implicit methods - Wikipedia

    en.wikipedia.org/wiki/Explicit_and_implicit_methods

    Explicit and implicit methods are approaches used in numerical analysis for obtaining numerical approximations to the solutions of time-dependent ordinary and partial differential equations, as is required in computer simulations of physical processes.

  5. Predictor–corrector method - Wikipedia

    en.wikipedia.org/wiki/Predictor–corrector_method

    A simple predictor–corrector method (known as Heun's method) can be constructed from the Euler method (an explicit method) and the trapezoidal rule (an implicit method). Consider the differential equation ′ = (,), =, and denote the step size by .

  6. Backward Euler method - Wikipedia

    en.wikipedia.org/wiki/Backward_Euler_method

    In numerical analysis and scientific computing, the backward Euler method (or implicit Euler method) is one of the most basic numerical methods for the solution of ordinary differential equations. It is similar to the (standard) Euler method , but differs in that it is an implicit method .

  7. Runge–Kutta methods - Wikipedia

    en.wikipedia.org/wiki/Runge–Kutta_methods

    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]

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

  9. Cauchy–Euler equation - Wikipedia

    en.wikipedia.org/wiki/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 equation can be solved ...