When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Initial value problem - Wikipedia

    en.wikipedia.org/wiki/Initial_value_problem

    The Banach fixed point theorem is then invoked to show that there exists a unique fixed point, which is the solution of the initial value problem. An older proof of the Picard–Lindelöf theorem constructs a sequence of functions which converge to the solution of the integral equation, and thus, the solution of the initial value problem.

  3. Shooting method - Wikipedia

    en.wikipedia.org/wiki/Shooting_method

    In numerical analysis, the shooting method is a method for solving a boundary value problem by reducing it to an initial value problem.It involves finding solutions to the initial value problem for different initial conditions until one finds the solution that also satisfies the boundary conditions of the boundary value problem.

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

  5. Ordinary differential equation - Wikipedia

    en.wikipedia.org/wiki/Ordinary_differential_equation

    For the equation and initial value problem: ′ = (,), = if and / are continuous in a closed rectangle = [, +] [, +] in the plane, where and are real (symbolically: ,) and denotes the Cartesian product, square brackets denote closed intervals, then there is an interval = [, +] [, +] for some where the solution to the above equation and initial ...

  6. Linear multistep method - Wikipedia

    en.wikipedia.org/wiki/Linear_multistep_method

    Numerical methods for ordinary differential equations approximate solutions to initial value problems of the form ′ = (,), =.. The result is approximations for the value of () at discrete times : = +, where is the time step (sometimes referred to as ) and is an integer.

  7. Newton's method - Wikipedia

    en.wikipedia.org/wiki/Newton's_method

    We have f ′ (x) = −sin(x) − 3x 2. Since cos(x) ≤ 1 for all x and x 3 > 1 for x > 1, we know that our solution lies between 0 and 1. A starting value of 0 will lead to an undefined result which illustrates the importance of using a starting point close to the solution.

  8. Boundary value problem - Wikipedia

    en.wikipedia.org/wiki/Boundary_value_problem

    Boundary value problems are similar to initial value problems.A boundary value problem has conditions specified at the extremes ("boundaries") of the independent variable in the equation whereas an initial value problem has all of the conditions specified at the same value of the independent variable (and that value is at the lower boundary of the domain, thus the term "initial" value).

  9. Numerical methods for ordinary differential equations - Wikipedia

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

    ISBN 0-521-55376-8 (hardback), ISBN 0-521-55655-4 (paperback). (Textbook, targeting advanced undergraduate and postgraduate students in mathematics, which also discusses numerical partial differential equations.) John Denholm Lambert, Numerical Methods for Ordinary Differential Systems, John Wiley & Sons, Chichester, 1991. ISBN 0-471-92990-5.