enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Finite_difference_method

    For example, consider the ordinary differential equation ′ = + The Euler method for solving this equation uses the finite difference quotient (+) ′ to approximate the differential equation by first substituting it for u'(x) then applying a little algebra (multiplying both sides by h, and then adding u(x) to both sides) to get (+) + (() +).

  3. Slope field - Wikipedia

    en.wikipedia.org/wiki/Slope_field

    The slope field can be defined for the following type of differential equations y ′ = f ( x , y ) , {\displaystyle y'=f(x,y),} which can be interpreted geometrically as giving the slope of the tangent to the graph of the differential equation's solution ( integral curve ) at each point ( x , y ) as a function of the point coordinates.

  4. Finite-difference time-domain method - Wikipedia

    en.wikipedia.org/wiki/Finite-difference_time...

    Finite-difference time-domain (FDTD) or Yee's method (named after the Chinese American applied mathematician Kane S. Yee, born 1934) is a numerical analysis technique used for modeling computational electrodynamics (finding approximate solutions to the associated system of differential equations).

  5. Laguerre polynomials - Wikipedia

    en.wikipedia.org/wiki/Laguerre_polynomials

    Complex color plot of the Laguerre polynomial L n(x) with n as -1 divided by 9 and x as z to the power of 4 from -2-2i to 2+2i. In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are nontrivial solutions of Laguerre's differential equation: ″ + ′ + =, = which is a second-order linear differential equation.

  6. Finite difference - Wikipedia

    en.wikipedia.org/wiki/Finite_difference

    In an analogous way, one can obtain finite difference approximations to higher order derivatives and differential operators. For example, by using the above central difference formula for f ′(x + ⁠ h / 2 ⁠) and f ′(x − ⁠ h / 2 ⁠) and applying a central difference formula for the derivative of f ′ at x, we obtain the central difference approximation of the second derivative of f:

  7. List of numerical-analysis software - Wikipedia

    en.wikipedia.org/wiki/List_of_numerical-analysis...

    The GNU Data Language is a free alternative. ILNumerics.Net, a C# math library that brings numeric computing functions for science, engineering and financial analysis to the .NET Framework. KPP generates Fortran 90, FORTRAN 77, C, or Matlab code for the integration of ordinary differential equations (ODEs) resulting from chemical reaction ...

  8. Godunov's scheme - Wikipedia

    en.wikipedia.org/wiki/Godunov's_scheme

    In numerical analysis and computational fluid dynamics, Godunov's scheme is a conservative numerical scheme, suggested by Sergei Godunov in 1959, [1] for solving partial differential equations. One can think of this method as a conservative finite volume method which solves exact, or approximate Riemann problems at each inter-cell boundary. In ...

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