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

    An initial value problem is a differential equation ′ = (, ()) with : where is an open set of , together with a point in the domain of (,),called the initial condition.. A solution to an initial value problem is a function that is a solution to the differential equation and satisfies

  3. Course-of-values recursion - Wikipedia

    en.wikipedia.org/wiki/Course-of-values_recursion

    The factorial function n! is recursively defined by the rules ! =, (+)! =!(+).This recursion is a primitive recursion because it computes the next value (n+1)! of the function based on the value of n and the previous value n! of the function.

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

  5. Direct multiple shooting method - Wikipedia

    en.wikipedia.org/wiki/Direct_multiple_shooting...

    The boundary value problem solver's performance suffers from this. Even stable and well-conditioned ODEs may make for unstable and ill-conditioned BVPs. A slight alteration of the initial value guess y 0 may generate an extremely large step in the ODEs solution y(t b; t a, y 0) and thus in the values of the function F whose root is sought. Non ...

  6. One-step method - Wikipedia

    en.wikipedia.org/wiki/One-step_method

    In general, let be a value that is to be determined numerically, in the case of this article, for example, the value of the solution function of an initial value problem at a given point. A numerical method, for example a one-step method, calculates an approximate value v ~ ( h ) {\displaystyle {\tilde {v}}(h)} for this, which depends on the ...

  7. Picard–Lindelöf theorem - Wikipedia

    en.wikipedia.org/wiki/Picard–Lindelöf_theorem

    For instance, the differential equation ⁠ dy / dt ⁠ = y 2 with initial condition y(0) = 1 has the solution y(t) = 1/(1-t), which is not defined at t = 1. Nevertheless, if f is a differentiable function defined over a compact subset of R n, then the initial value problem has a unique solution defined over the entire R. [6]

  8. Fixed-point iteration - Wikipedia

    en.wikipedia.org/wiki/Fixed-point_iteration

    The fixed point iteration x n+1 = cos x n with initial value x 1 = −1.. An attracting fixed point of a function f is a fixed point x fix of f with a neighborhood U of "close enough" points around x fix such that for any value of x in U, the fixed-point iteration sequence , (), (()), ((())), … is contained in U and converges to x fix.

  9. Singular solution - Wikipedia

    en.wikipedia.org/wiki/Singular_solution

    A singular solution y s (x) of an ordinary differential equation is a solution that is singular or one for which the initial value problem (also called the Cauchy problem by some authors) fails to have a unique solution at some point on the solution. The set on which a solution is singular may be as small as a single point or as large as the ...