Difference between revisions of "Differential equation"
m |
|||
Line 17: | Line 17: | ||
==Approximations== | ==Approximations== | ||
− | <b> Euler's method </b> uses repeated [[Taylor series|tangent-line approximations]] to approximate the solution to first-order differential | + | <b> Euler's method </b> uses repeated [[Taylor series|tangent-line approximations]] to approximate a value <math>f(b)</math> of the solution to a first-order differential equation given an initial condition <math>f(a)</math>. |
+ | |||
+ | If <math>b > a</math>, Euler's method works by subdividing <math>[a,b]</math> into smaller intervals <math>[a,c_1], [c_1,c_2], \dots , [c_{n-2}, c_{n-1}], [c_{n-1}, b]</math>, sometimes called <b>steps</b>. Starting at <math>a = c_0</math>, for each step <math>i</math>, the value of <math>f(c_i)</math> (at the end of the step) is approximated via a tangent line about <math>x = c_{i-1}</math> (the beginning of the step, where <math>f(c_{i-1})</math> is known and <math>f'(c_{i-1})</math> can be computed in terms of <math>c_{i-1}</math> and <math>f(c_{i-1})</math> using the given differential equation), until <math>b = c_n</math> is reached. | ||
+ | |||
+ | The formula for the tangent-line approximation is <cmath>f(c_i) \approx f(c_{i-1}) + (c_i - c_{i-1})f'(c_{i-1}).</cmath> | ||
+ | |||
+ | The quantity <math>c_i - c_{i-1}</math> is called the <b>step size</b>. Euler's method can be employed when <math>b < a</math> by simply using negative step sizes. | ||
==Constant expressions== | ==Constant expressions== |
Revision as of 19:29, 6 March 2022
A differential equation is a functional equation involving functions and their derivatives.
The order of a differential equation is the largest order of any derivative that appears in the equation.
Examples
has solutions
for all real constants
.
has solutions
for all real constants
and
. The solutions with
are
; those with
are
.
Solutions
Separation of variables is a convenient technique for solving certain types of differential equations. Essentially, the method involves rewriting the equation so that each side is an expression in only one variable and then taking the antiderivative of both sides.
When solving differential equations, it is best to notate functions using a single variable name instead of spelling out the function and its arguments, for example using instead of
. Here we also use Leibniz notation
for the derivative because it allows for manipulating
and
individually.
Worked example
To solve the differential equation we manipulate and factor to get
then rearrange:
We then proceed to take the antiderivatives
at which point the equation can be solved using integration techniques.
Approximations
Euler's method uses repeated tangent-line approximations to approximate a value of the solution to a first-order differential equation given an initial condition
.
If , Euler's method works by subdividing
into smaller intervals
, sometimes called steps. Starting at
, for each step
, the value of
(at the end of the step) is approximated via a tangent line about
(the beginning of the step, where
is known and
can be computed in terms of
and
using the given differential equation), until
is reached.
The formula for the tangent-line approximation is
The quantity is called the step size. Euler's method can be employed when
by simply using negative step sizes.
Constant expressions
Certain expressions involving solutions to differential equations can be proven constant by noting that their derivatives are always . These constant expressions can then be used to prove properties of the solutions.
For example, when ,
Using
allows for reconstructing the familiar identity
for all real
.
When , for any real constant
,
Letting
and evaluating at both
and
gives
which using
becomes the familiar identity
for all real
and
.
This article is a stub. Help us out by expanding it.