enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Numerical methods for ordinary differential equations - Wikipedia

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

    Ordinary differential equations occur in many scientific disciplines, including physics, chemistry, biology, and economics. [1] In addition, some methods in numerical partial differential equations convert the partial differential equation into an ordinary differential equation, which must then be solved.

  3. Method of undetermined coefficients - Wikipedia

    en.wikipedia.org/wiki/Method_of_undetermined...

    Consider a linear non-homogeneous ordinary differential equation of the form = + (+) = where () denotes the i-th derivative of , and denotes a function of .. The method of undetermined coefficients provides a straightforward method of obtaining the solution to this ODE when two criteria are met: [2]

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

  5. Collocation method - Wikipedia

    en.wikipedia.org/wiki/Collocation_method

    In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations.The idea is to choose a finite-dimensional space of candidate solutions (usually polynomials up to a certain degree) and a number of points in the domain (called collocation points), and to select that solution which satisfies the ...

  6. Euler method - Wikipedia

    en.wikipedia.org/wiki/Euler_method

    The exact solution of the differential equation is () =, so () =. Although the approximation of the Euler method was not very precise in this specific case, particularly due to a large value step size h {\displaystyle h} , its behaviour is qualitatively correct as the figure shows.

  7. Trapezoidal rule (differential equations) - Wikipedia

    en.wikipedia.org/wiki/Trapezoidal_rule...

    Suppose that we want to solve the differential equation ′ = (,). The trapezoidal rule is given by the formula + = + ((,) + (+, +)), where = + is the step size. [1]This is an implicit method: the value + appears on both sides of the equation, and to actually calculate it, we have to solve an equation which will usually be nonlinear.

  8. Predictor–corrector method - Wikipedia

    en.wikipedia.org/wiki/Predictor–corrector_method

    When considering the numerical solution of ordinary differential equations (ODEs), a predictor–corrector method typically uses an explicit method for the predictor step and an implicit method for the corrector step.

  9. Reduction of order - Wikipedia

    en.wikipedia.org/wiki/Reduction_of_order

    The method of reduction of order is used to obtain a second linearly independent solution to this differential equation using our one known solution. To find a second solution we take as a guess y 2 ( x ) = v ( x ) y 1 ( x ) {\displaystyle y_{2}(x)=v(x)y_{1}(x)} where v ( x ) {\displaystyle v(x)} is an unknown function to be determined.