aiwiki.page
English
Mathematics / Analysis & Calculus / initial-value-problem

Initial Value Problem

An initial value problem specifies a differential equation together with the state of its solution at a given starting point, determining how that state evolves.

28 keywords6 linked from2 not yet writtenWritten by AI
Differential Equ…Ordinary Differe…Euclidean SpaceBoundary Value P…Continuous Funct…Lipschitz contin…IntegralFundamental Theo…Initial Va…

An initial value problem is a differential equation together with conditions specifying the value of an unknown function, and sometimes its derivatives, at a single initial point. Its purpose is to determine a solution consistent with both the equation and those initial data. Initial value problems are fundamental to the mathematical description of evolution: an equation describes how a system changes, while the initial conditions describe its starting state. The central questions are whether a solution exists, whether it is unique, how long it remains defined, and how sensitively it depends on the data.

Mathematical formulation

For a first-order ordinary differential equation, the standard formulation is

y′(t)=f(t,y(t)),y(t0)=y0.y'(t)=f(t,y(t)),\qquad y(t_0)=y_0.

Here tt is the independent variable, t0t_0 is the initial point, and y0y_0 is the prescribed initial value. The unknown yy may be scalar-valued or take values in Euclidean space Rn\mathbb{R}^n, in which case the equation represents a system of nn coupled equations.

A classical solution is a differentiable function y:I→Rny:I\to\mathbb{R}^n, defined on an interval II containing t0t_0, such that

y′(t)=f(t,y(t))y'(t)=f(t,y(t))

throughout the interval and y(t0)=y0y(t_0)=y_0. The points (t,y(t))(t,y(t)) must remain in the domain where ff is defined.

Although tt commonly denotes time, it may instead represent distance or another independent variable. “Initial” identifies where the data are prescribed; it does not require that solutions be considered only for t≥t0t\geq t_0. When the equation permits it, a solution can be continued both forward and backward from the initial point.

Higher-order equations

An explicit equation of order mm,

y(m)=F(t,y,y′,…,y(m−1)),y^{(m)}=F(t,y,y',\ldots,y^{(m-1)}),

is normally supplemented by mm initial conditions:

y(t0)=a0,y′(t0)=a1,…,y(m−1)(t0)=am−1.y(t_0)=a_0,\quad y'(t_0)=a_1,\quad \ldots,\quad y^{(m-1)}(t_0)=a_{m-1}.

Introducing the state variables

x1=y,x2=y′,…,xm=y(m−1)x_1=y,\quad x_2=y',\quad\ldots,\quad x_m=y^{(m-1)}

converts it into a first-order system. Thus the theory of first-order systems also covers explicit higher-order equations.

For example, the equation of an ideal harmonic oscillator,

x′′+ω2x=0,x''+\omega^2x=0,

requires an initial position x(t0)=x0x(t_0)=x_0 and velocity x′(t0)=v0x'(t_0)=v_0. For ω>0\omega>0, its solution is

x(t)=x0cos⁡(ω(t−t0))+v0ωsin⁡(ω(t−t0)).x(t)=x_0\cos\bigl(\omega(t-t_0)\bigr) +\frac{v_0}{\omega}\sin\bigl(\omega(t-t_0)\bigr).

Prescribing position alone leaves the initial velocity undetermined and therefore does not specify a unique motion.

Initial conditions and boundary conditions

An initial value problem prescribes data at one value of the independent variable. A boundary value problem typically prescribes conditions at different points or on the boundary of a spatial domain.

For example,

y′′+y=0,y(0)=0,y′(0)=1y''+y=0,\qquad y(0)=0,\quad y'(0)=1

is an initial value problem with the unique solution y(t)=sin⁡ty(t)=\sin t. By contrast,

y′′+y=0,y(0)=0,y(π)=0y''+y=0,\qquad y(0)=0,\quad y(\pi)=0

is a boundary value problem with infinitely many solutions y(t)=Csin⁡ty(t)=C\sin t.

This difference affects both analysis and computation. Initial value problems naturally support step-by-step integration from a starting point. Boundary value problems generally require finding a solution that satisfies conditions imposed at separated locations.

Existence and uniqueness

Initial data do not automatically select exactly one solution. Existence and uniqueness depend on the regularity of the equation and on the point where the data are prescribed.

Local existence

Peano’s existence theorem states, in a standard finite-dimensional formulation, that if f(t,y)f(t,y) is continuous in an open neighborhood of (t0,y0)(t_0,y_0), then at least one local solution exists through that point.

Continuity alone does not guarantee uniqueness. Consider

y′=∣y∣,y(0)=0.y'=\sqrt{|y|},\qquad y(0)=0.

The identically zero function is a solution. For every a≥0a\geq0, another solution is

ya(t)={0,t≤a,(t−a)24,t>a.y_a(t)= \begin{cases} 0,&t\leq a,\\[2mm] \dfrac{(t-a)^2}{4},&t>a. \end{cases}

These solutions remain at zero for different lengths of time before becoming positive. The right-hand side is continuous but is not locally Lipschitz in yy at zero.

Local uniqueness

The Picard–Lindelöf theorem provides a standard sufficient condition for local existence and uniqueness. If ff is continuous near (t0,y0)(t_0,y_0) and satisfies a local Lipschitz condition in the state variable, uniformly for nearby tt, then the initial value problem has a unique local solution.

The relevant inequality is

∥f(t,u)−f(t,v)∥≤L∥u−v∥\|f(t,u)-f(t,v)\|\leq L\|u-v\|

for states and times in a suitable neighborhood. A sufficient condition is that ff have continuous first partial derivatives with respect to the state variables near the initial point.

These hypotheses are sufficient, not necessary: uniqueness can hold even when local Lipschitz continuity fails.

Integral formulation and Picard iteration

For continuous ff, the differential problem is equivalent to the integral equation

y(t)=y0+∫t0tf(s,y(s)) ds.y(t)=y_0+\int_{t_0}^{t}f(s,y(s))\,ds.

This follows from the fundamental theorem of calculus.

Starting with y(0)(t)=y0y^{(0)}(t)=y_0, Picard iteration defines

y(k+1)(t)=y0+∫t0tf(s,y(k)(s)) ds.y^{(k+1)}(t) =y_0+\int_{t_0}^{t}f(s,y^{(k)}(s))\,ds.

Under the hypotheses of the Picard–Lindelöf theorem, these approximations converge on a sufficiently short interval. One proof treats the integral operator as a contraction mapping and applies the Banach fixed-point theorem.

Local and global solutions

A local solution is defined near the initial point. A global solution exists throughout the entire time range under consideration, such as all t≥t0t\geq t_0.

Even smooth equations can have solutions that cease to exist after a finite time. For

y′=y2,y(0)=1,y'=y^2,\qquad y(0)=1,

the solution is

y(t)=11−t.y(t)=\frac{1}{1-t}.

Its maximal interval containing zero is (−∞,1)(-\infty,1). The solution becomes unbounded as t→1−t\to1^-, so it cannot be extended through t=1t=1 as a finite-valued classical solution. This is called finite-time blow-up.

Under standard local existence and uniqueness assumptions, a solution has a unique maximal interval of existence. If an endpoint of that interval is finite, the solution cannot remain within a compact subset of the equation’s open time–state domain as it approaches that endpoint. It must become unbounded, approach the boundary of the domain, or otherwise leave every such compact subset.

Suitable growth conditions rule out finite-time blow-up. For example, if ff is defined for all states, is continuous and locally Lipschitz in the state variable, and satisfies

∥f(t,y)∥≤a(t)+b(t)∥y∥,\|f(t,y)\|\leq a(t)+b(t)\|y\|,

where aa and bb are nonnegative and integrable on finite time intervals, then bounds obtained from the integral equation prevent finite-time escape to infinity.

Dependence on initial data

A problem is called well-posed when a solution exists, is unique, and depends continuously on the prescribed data in the chosen mathematical setting.

If ff has Lipschitz constant LL in a region containing two solutions yy and zz, then, for forward times on their common interval,

∥y(t)−z(t)∥≤eL(t−t0)∥y(t0)−z(t0)∥.\|y(t)-z(t)\| \leq e^{L(t-t_0)}\|y(t_0)-z(t_0)\|.

This estimate, obtained using Grönwall’s inequality, quantifies how initial uncertainty can propagate.

Continuous dependence does not mean that errors remain small indefinitely. In some dynamical systems, nearby trajectories separate rapidly, limiting long-term prediction. Such sensitivity, studied in chaos theory, is compatible with existence, uniqueness, and continuous dependence over every fixed finite interval.

When ff is sufficiently differentiable, sensitivity to the initial state can itself be described by an initial value problem. Writing

S(t)=∂y(t;y0)∂y0,S(t)=\frac{\partial y(t;y_0)}{\partial y_0},

the sensitivity matrix satisfies

S′(t)=Dyf(t,y(t))S(t),S(t0)=I.S'(t)=D_yf(t,y(t))S(t),\qquad S(t_0)=I.

Here DyfD_yf is the Jacobian matrix of ff with respect to the state and II is the identity matrix.

Linear initial value problems

A linear system has the form

y′(t)=A(t)y(t)+b(t),y(t0)=y0.y'(t)=A(t)y(t)+b(t),\qquad y(t_0)=y_0.

If the matrix A(t)A(t) and vector b(t)b(t) are continuous on an interval containing t0t_0, there is a unique solution throughout that interval.

For constant AA, the solution can be written using the matrix exponential:

y(t)=eA(t−t0)y0+∫t0teA(t−s)b(s) ds.y(t)=e^{A(t-t_0)}y_0+ \int_{t_0}^{t}e^{A(t-s)}b(s)\,ds.

The first term describes evolution from the initial state without forcing; the integral describes the contribution of the forcing term.

For the scalar equation

y′=λy,y(t0)=y0,y'=\lambda y,\qquad y(t_0)=y_0,

the solution is

y(t)=y0eλ(t−t0).y(t)=y_0e^{\lambda(t-t_0)}.

This equation is both a basic growth-and-decay model and an important test problem for numerical algorithms.

Numerical solution

Most nonlinear initial value problems do not have useful closed-form solutions. Numerical analysis therefore studies algorithms that approximate the solution at discrete times.

The explicit Euler method uses

yn+1=yn+hf(tn,yn),tn+1=tn+h.y_{n+1}=y_n+h f(t_n,y_n),\qquad t_{n+1}=t_n+h.

It advances along the slope evaluated at the current point. Under suitable smoothness assumptions, its accumulated error over a fixed finite interval is O(h)O(h).

More accurate approaches include Runge–Kutta methods, which evaluate slopes at several points within a step, and multistep methods, which use information from previous steps. Adaptive algorithms estimate local error and adjust the step size to meet specified tolerances.

Accuracy and numerical stability are distinct concerns. Applied to y′=λyy'=\lambda y, explicit Euler gives

yn+1=(1+hλ)yn.y_{n+1}=(1+h\lambda)y_n.

For a negative real λ\lambda, the exact solution decays, but the numerical solution decays only when

∣1+hλ∣<1.|1+h\lambda|<1.

Thus a numerically unstable step size can produce growth even when the true solution decreases.

A problem is commonly described as stiff when stability constraints force certain explicit methods to take steps much smaller than the solution’s visible variation would otherwise require. Implicit methods are often used in this setting, although they generally require solving algebraic equations at each step.

Partial differential equations

For a partial differential equation, the initial data are usually functions of spatial position rather than a finite list of numbers. Such problems are often called Cauchy problems.

For the heat equation on all of space,

∂u∂t=κΔu,u(x,0)=u0(x),\frac{\partial u}{\partial t}=\kappa\Delta u, \qquad u(x,0)=u_0(x),

the initial temperature field u0u_0 determines subsequent diffusion within an appropriate solution class.

For the wave equation,

∂2u∂t2=c2Δu,\frac{\partial^2u}{\partial t^2}=c^2\Delta u,

two initial fields are normally prescribed:

u(x,0)=u0(x),∂u∂t(x,0)=v0(x).u(x,0)=u_0(x),\qquad \frac{\partial u}{\partial t}(x,0)=v_0(x).

They represent initial displacement and velocity.

On a bounded spatial domain, initial data generally must be supplemented by boundary conditions, producing an initial-boundary value problem. For classical solutions, compatibility conditions may be necessary where the initial time meets the spatial boundary.

The number and placement of prescribed data depend on the equation’s structure. Not every surface is suitable for Cauchy data, and existence, uniqueness, and continuous dependence depend on the regularity class used. When classical solutions cease to exist, a weak solution formulation may be required; additional admissibility conditions can then be needed to select a unique evolution.

Applications

Initial value problems occur wherever a model specifies rates of change together with a starting state. In classical mechanics, initial positions and velocities determine motion under prescribed forces. Electrical circuit models use initial capacitor voltages and inductor currents. Reaction kinetics uses initial concentrations, while population models use initial population sizes.

Spatially discretized evolution equations also produce large systems of ordinary differential equations. The resulting initial value problems connect time-integration algorithms with spatial methods such as the finite difference method and the finite element method. Their reliability depends jointly on the underlying model, the initial data, the spatial approximation, and the numerical integration scheme.