# All Science Fair Projects

## Science Fair Project Encyclopedia for Schools!

Search                 Browse                 Forum               Coach                 Links                 Editor                 Help                 Tell-a-Friend                 Encyclopedia                 Dictionary

# Science Fair Project Encyclopedia

For information on any area of science that interests you,
enter a keyword (eg. scientific method, molecule, cloud, carbohydrate etc.).
Or else, you can start by choosing any of the categories below.

# Ordinary differential equation

(Redirected from Ordinary differential equations)

In mathematics, and in particular analysis, an ordinary differential equation (or ODE) is an equation that involves the derivatives of an unknown function of one variable. A simple example of an ordinary differential equation is

$f' = f,\,$

where f is an unknown function, and f' is its derivative.

See differential calculus and integral calculus for basic calculus background.

Contents

## Definition

Let y represent an unknown function of x, and let

$y', y'',\ \dots,\ y^{(n)}$

denote the derivatives

$\frac{dy}{dx},\ \frac{d^{2}y}{dx^2},\ \dots,\ \frac{d^{n}y}{dx^{n}}.$

An ordinary differential equation (ODE) is an equation involving

$x,\ y,\ y',\ y'',\ \dots$.

The order of a differential equation is the order n of the highest derivative that appears.

A solution of an ODE is a function y(x) whose derivatives satisfy the equation. Such a function is not guaranteed to exist and, if it does exist, is usually not unique.

When a differential equation of order n has the form

$F(x, y', y'',\ \dots,\ y^{(n)}) = 0$

it is called an implicit differential equation whereas the form

$F(x, y', y'',\ \dots,\ y^{(n-1)}) = y^{(n)}$

is called an explicit differential equation.

A differential equation not depending on x is called autonomous, and one with no terms depending only on x is called homogeneous.

## General application

An important special case is when the equations do not involve x. These differential equations may be represented as vector fields. This type of differential equations has the property that space can be divided into equivalence classes based on whether two points lie on the same solution curve. Since the laws of physics are believed not to change with time, the physical world is governed by such differential equations. (See also symplectic topology for abstract discussion.)

The problem of solving a differential equation is to find the function y whose derivatives satisfy the equation. For example, the differential equation

$y'' + y = 0 \, \!$

has the general solution

$y = A \cos{x} + B \sin{x} \, \!$,

where A, B are constants determined from boundary conditions. In the case where the equations are linear, this can be done by breaking the original equation down into smaller equations, solving those, and then adding the results back together. Unfortunately, many of the interesting differential equations are non-linear, which means that they cannot be broken down in this way. There are also a number of techniques for solving differential equations using a computer (see numerical ordinary differential equations).

Ordinary differential equations are to be distinguished from partial differential equations where y is a function of several variables, and the differential equation involves partial derivatives.

## Types of differential equations with some history

The influence of geometry, physics, and astronomy, starting with Newton and Leibniz, and further manifested through the Bernoullis, Riccati, and Clairaut, but chiefly through d'Alembert and Euler, has been very marked, and especially on the theory of linear partial differential equations with constant coefficients .

### Linear ODEs with constant coefficients

The first method of integrating linear ordinary differential equations with constant coefficients is due to Euler, who made the solution of the form

$\frac {d^{n}y} {dx^{n}} + A_{1}\frac {d^{n-1}y} {dx^{n-1}} + \cdots + A_{n}y = 0$

depend on that of the algebraic equation of the nth degree,

$F(z) = z^{n} + A_{1}z^{n-1} + \cdots + A_n = 0$

in which zk takes the place of

$\frac {d^{k}y} {dx^{k}}\quad\quad(k = 1, 2, \cdots, n).$

This equation F(z) = 0, is the "characteristic" equation considered later by Monge and Cauchy. If z is a (possibly complex) zero of F(z) of multiplicity m and $k\in\{0,1,\dots,m-1\}$ then y = xkezx is a solution of the ODE.

If the Ai are real then real-valued solutions are preferable. Since the complex z values will come in conjugate pairs, so will their corresponding y values; replace each pair with their linear combinations $\Re y$ and $\Im y$.

A case that involves complex ($\mathbb{C}$) root can be solved with the aid of Euler's formulae. Recall that Maclaurin series are defined as:

$e^x = \sum_{k = 0}^\infty {\frac{{x^{k} }}{{k!}}}$,

$\cos x = \sum_{k = 0}^\infty {\frac{{\left( { - 1} \right)^k x^{2k} }}{{\left( {2k} \right)!}}}$, $\sin x = \sum_{k = 0}^\infty {\frac{{\left( { - 1} \right)^k }}{{\left( {2k + 1} \right)!}}x^{2k + 1} }$

And since

$\begin{matrix} i = \sqrt { - 1} \\ i^2 = - 1 \\ i^3 = - i \\ i^4 = 1 \\ \end{matrix}, e^{i\theta } = \sum_{k = 0}^\infty {\frac{{\left( i \right)^k }}{{k!}}\theta ^k = } \sum_{k = 0}^\infty {\frac{{\left( { - 1} \right)^k }}{{\left( {2k} \right)!}}\theta ^{2k} + i} \sum_{k = 0}^\infty {\frac{{\left( { - 1} \right)^k }}{{\left( {2k + 1} \right)!}}\theta ^{2k + 1} = } \cos \theta + i\sin \theta$

Giving the Euler's Formulae, eiθ = cosθ + isinθ

• Example: Suppose P(D)y = 0 for P(D)=D2 - 4D + 5

(Note: Here operator's notation is used to represent the linear ODE, y"-4y'+5=0),

Complete the square to find $\mathbb{C}$ roots by writing above equation in form:

$P(D)=\left[ {P - a} \right] + b^2$ roots are $r = a \pm bi.$
$P(D) = \left[ {D^2 - 4D + 4} \right] + 1 = \left[ {D - 2} \right]^2 + 1^2.\ \mathrm{Here}\ r = 2 \pm i$

are the characteristic roots. Hence solution in the form of y = erx are to be written as

$e^{\left( {2 + i} \right)x} = e^{2x + ix} = e^{2x} e^{ix} = e^{2x} \left( {\cos x + i\sin x} \right) = e^{2x} \cos x + ie^{2x} \sin x$

We think of $r = 2 \pm i{\rm{ }}$ as a root of multiplicity of 2. So seek two linearly independent solution to above equation yields:

$\left\{ {\begin{matrix} {y_1 = e^{2x} \cos x} \\ {y_2 = e^{2x} \sin x} \\\end{matrix}} \right.$

Any other solution to the equation has form of: yc = c1e2xcosx + c2e2xsinx . Note the arbitrariness of C1 and C2 absorbs $\pm$ i.

Also, for repeated complex roots, multiply y1 and y2 repeatedly by x to generate a family of solutions, but only to multiplicity.

### Linear ODEs with variable coefficient

Natural oscillations (be it mechanical or electrical circuit) exhibit a forcing function that is due to friction, dashpot, or circuit resistance.

Suppose we model this forcing function as f(t), an linear ODE with this added nonhomogeneous term now takes the form

$A_n \frac{{d^n y}}{{dt^n }} + A_{n - 1} \frac{{d^{n - 1} y}}{{dt^{n - 1} }} + \cdots + A_1 \frac{{dy}}{{dt}} + A_0 y = f\left( t \right),$

or simply (in standard form),

$a_n y^{(n)} + a_{n - 1} y^{(n - 1)} + \cdots + a_1 y' + a_0 y = f\left( t \right).\,$

In case of non-homogeneous linear ODE (non-HLDE) where the input function is polynomial, sinusoidal, exponential or any product of the three; we seek the solution to the equation above in the form of yG = yc + yp where

• yG denotes a general solution;
• yc denotes a characteristic equation;
• yp denotes a particular solution.

#### Method of undetermined coefficients

The method of undetermined coefficients (MoUC) is useful in finding solution for yp. Given P(D) = f(t), find the annihilator A(D) for f(t) such that A(D)f(t) = 0; then apply A(D) to both side of P(D) = f(t) to have A(D)f(t) = A(D)f = 0, a HLDE with constant coefficients (cc) which could than be readily solve using technique found in 3.1. Note by convention when f(t) is used, it often means that an equation is time-dependent, where f(x) and other denotes time-independent.

Suppose that f(x) = 1 − 2x; A(D) has the following family of solutions:

Recall: r = 0:e0 = 1,x,x2,x3,...

Thus, when we have x; henceforth it implies this root repeated twice. With this in mind, A(D) = D2 has multiplicity 2.

Similarly, case of complex roots is based on sin or cos.

• Example: f(x) = sinx - xcos2x
1. sin x is due to complex root, has real part of 0 because e0 = 1 (multiply 1 on sin and cos).
2. A(D) then has root of $0 \pm i$ (simply $\pm i$) with multiplicity 1.
3. Also $r=\pm 2i$ with multiplicity 2.
• Example: $\left[ {D^2 - D} \right]y = 1 - 2x$

Here r = 0:e0 = 1,x,x2,....xn;r = 1:ex,xex,...,xnex Note that once a distinct root is used, it may not be used again due to linearly independent.

$y_c = c_1 y_1 + c_2 y_2 = c_1 \left( 1 \right) + c_2 \left( {e^x } \right)$. A(D) has of multiplicity of 2.

$\left. {\begin{matrix} {Y_p = Ax + Bx^2 } \\ {Y_p ^\prime = A + 2Bx} \\ {Y_p ^{\prime \prime } = 2B} \\ \end{matrix}} \right\}2B - \left[ {A + 2Bx} \right] = \left[ {2B - A} \right] - 2Bx = 1 - 2x$

Equating coefficients, 2B − A yields constant term on RHS of 1, hence 2B − 1 = 1 so B = 1, A = 1. −2B = −2. Therefore yp = Ax + Bx2 = x + x2. Solution hence becomes y = yc + yp = C1 + C2ex + x + x2 . If we do not keep deleting our used roots, we than may have y = yc + yp = C1 + C2ex + 1 + x2, it would be incorrect since C1 absorbs the arbitrariness of x (here is 1); thus violates linearly dependence.

• Example: $\left[ {D^2 - D} \right]y = x - 2e^x$ (same as y'' - y' = x - 2ex)

In this case, we have roots r = {0, 1} which yield family of solution such as

$\begin{matrix} r = 0:1,x,x^2,x^3,... \\ r = 1:e^x,xe^x,x^2 e^x,... \\ \end{matrix}$

Therefore, y1 = 1,y2 = ex and yc = C1(1) + C2ex Since A(D) has $\left. \begin{matrix} r = 0\,\,{\rm{of\ multiplicity\ of\ 2}} \\ r = 1\,\,{\rm{of\ multiplicity\ of\ 1}} \\ \end{matrix} \right\}$ giving the form of $\left. \begin{matrix} Y_p = Ax + Bx^2 + Cxe^x \\ Y_p ^\prime = A + 2Bx + C(1 + x)e^x \\ Y_p ^{\prime \prime } = 2B + C(2 + x)e^x \\ \end{matrix} \right\}$ put in original equation to have $\left[ {2B - A} \right] - 2Bx + ce^x = x - 2e^x$

Equating coefficient, $\begin{matrix} 2B - A = 0\,\,{\rm{so }}\,{\rm{A = 2B}} \Rightarrow A = - 1 \\ - 2B = 1 \Rightarrow B = - \frac{1}{2};C = - 1 \\ \end{matrix}$

Thus $y_p = Ax + Bx^2 + Cxe^x = - x - \frac{1}{2}x^2 - 2xe^x$

• Example: $\left[ {D^2 + 1} \right]y = f = \sec x$. What roots would give rise to the solution of the form $f\left( x \right) = \sec \left( x \right)$ ?

Solution: No roots. $f\left( x \right) = \sec \left( x \right)$ is not a sinusoid, rather the reciprocal of a sinusoid. So this method would not apply and 2nd-order variation-of-parameters (VoP) must be used to solve these type of problems (no valid finite linear combination could be tried in this case).

#### Method of variation of parameters

As explained above, the general solution to a non-homogeneous, linear differential equation y''(x) + p(x)y'(x) + q(x)y(x) = g(x) can be expressed as the sum of the general solution yh(x) to the corresponding homogenous, linear differential equation y''(x) + p(x)y'(x) + q(x)y(x) = 0 and any one solution yp(x) to y''(x) + p(x)y'(x) + q(x)y(x) = g(x).

Like the method of undetermined coefficients, described above, the method of variation of parameters is a method for finding one solution to y''(x) + p(x)y'(x) + q(x)y(x) = g(x), having already found the general solution to y''(x) + p(x)y'(x) + q(x)y(x) = 0. Unlike the method of undetermined coefficients, which fails except with certain specific forms of g(x), the method of variation of parameters will always work; however, it is significantly more difficult to use.

For a second-order equation, the method of variation of parameters makes use of the following fact:

##### Fact

Let p(x), q(x), and g(x) be functions, and let y1(x) and y2(x) be solutions to the homogeneous, linear differential equation y''(x) + p(x)y'(x) + q(x)y(x) = 0. Further, let u(x) and v(x) be functions such that u'(x)y1(x) + v'(x)y2(x) = 0 and u'(x)y1'(x) + v'(x)y2'(x) = g(x) for all x, and define yp(x) = u(x)y1(x) + v(x)y2(x). Then yp(x) is a solution to the non-homogeneous, linear differential equation y''(x) + p(x)y'(x) + q(x)y(x) = g(x).

##### Proof

yp(x) = u(x)y1(x) + v(x)y2(x)

yp'(x) = u'(x)y1(x) + u(x)y1'(x) + v'(x)y2(x) + v(x)y2'(x) = 0 + u(x)y1'(x) + v(x)y2'(x)

yp''(x) = u'(x)y1'(x) + u(x)y1''(x) + v'(x)y2'(x) + v(x)y2''(x) = g(x) + u(x)y1''(x) + v(x)y2''(x)

yp''(x) + p(x)y'p(x) + q(x)yp(x) = g(x) + u(x)y1''(x) + v(x)y2''(x) + p(x)u(x)y1'(x) + p(x)v(x)y2'(x) + q(x)u(x)y1(x) + q(x)v(x)y2(x) = g(x) + u(x)(y1''(x) + p(x)y1'(x) + q(x)y1(x)) + v(x)(y2''(x) + p(x)y2'(x) + q(x)y2(x)) = g(x) + 0 + 0 = g(x)

##### Usage

To solve the second-order, non-homogeneous, linear differential equation y''(x) + p(x)y'(x) + q(x)y(x) = g(x) using the method of variation of parameters, use the following steps:

1. Find the general solution to the corresponding homogeneous equation y''(x) + p(x)y'(x) + q(x)y(x) = 0. Specifically, find two linearly independent solutions y1(x) and y2(x).
2. Since y1(x) and y2(x) are linearly independent solutions, their Wronskian y1(x)y2'(x) - y1'(x)y2(x) is nonzero, so we can compute $-\frac{g(x) y_2(x)}{y_1(x) y_2'(x) - y_1'(x) y_2(x)}$ and $\frac{g(x) y_1(x)}{y_1(x) y_2'(x) - y_1'(x) y_2(x)}$. If the former is equal to u'(x) and the latter to v'(x), then u and v satisfy the two constraints given above: that u'(x)y1(x) + v'(x)y2(x) = 0 and that u'(x)y1'(x) + v'(x)y2'(x) = g(x).
3. Integrate $-\frac{g(x) y_2(x)}{y_1(x) y_2'(x) - y_1'(x) y_2(x)}$ and $\frac{g(x) y_1(x)}{y_1(x) y_2'(x) - y_1'(x) y_2(x)}$ to obtain u(x) and v(x), respectively. (Note that we only need one choice of u and v, so there is no need for constants of integration.)
4. Compute yp(x) = u(x)y1(x) + v(x)y2(x). The function yp is one solution of y''(x) + p(x)y'(x) + q(x)y(x) = g(x).
5. The general solution is c1y1(x) + c2y2(x) + yp(x), where c1 and c2 are arbitrary constants.
##### Higher-order equations

The method of variation of parameters can also be used with higher-order equations. For example, if y1(x), y2(x), and y3(x) are linearly independent solutions to y'''(x) + p(x)y''(x) + q(x)y'(x) + r(x)y(x) = 0, then there exist functions u(x), v(x), and w(x) such that u'(x)y1(x) + v'(x)y2(x) + w'(x)y3(x) = 0, u'(x)y1'(x) + v'(x)y2'(x) + w'(x)y3'(x) = 0, and u'(x)y1''(x) + v'(x)y2''(x) + w'(x)y3''(x) = g(x). Having found such functions (by solving algebraically for u'(x), v'(x), and w'(x), then integrating each), we have yp(x) = u(x)y1(x) + v(x)y2(x) + w(x)y3(x), one solution to the equation y'''(x) + p(x)y''(x) + q(x)y'(x) + r(x)y(x) = g(x).

##### Example

Solve the previous example, y'' + y = secx Recall $\sec x = \frac{1}{{\cos x}} = f$. From technique learned from 3.1, LHS has root of $r = \pm i$ that yield yc = C1cosx + C2sinx, (so y1 = cosx, y2 = sinx ) and its derivatives $\left\{ {\begin{matrix} {\dot u = \frac{{ - y_2 f}}{W} = \frac{{ - \sin x}}{{\cos x}} = \tan x} \\ {\dot v = \frac{{y_1 f}}{W} = \frac{{\cos x}}{{\cos x}} = 1} \\ \end{matrix}} \right.$ where Wronskian $W\left( {y_1,y_2 :x} \right) = \left| {\begin{matrix} {\cos x} & {\sin x} \\ { - \sin x} & {\cos x} \\ \end{matrix}} \right| = 1$ were computed in order to seek solution to its derivatives. Upon integration, $\left\{ \begin{matrix} u = - \int {\tan xdx = - \ln \left| {\sec x} \right| + C} \\ v = \int {1dx = x + C} \\ \end{matrix} \right.$ Computing yp and yG: $\begin{matrix} y_p = f = uy_1 + vy_2 = \cos x\ln \left| {\cos x} \right| + x\sin x \\ y_G = y_c + y_p = C_1 \cos x + C_2 \sin x + x\sin x + \cos x\ln \left( {\cos x} \right) \\ \end{matrix}$

### General solution method for first-order linear ODEs

For a first-order linear ODE, with coefficients that may or may not vary with t:

$x'(t) + p(t) \times x(t) = r(t)$

Then:

$x=e^{-C}(\int{r(t) \times e^{C}dt} + \kappa)$

Where κ is the constant of integration, and:

$C=\int{Adt}$

#### Proof

This proof comes from Jean Bernoulli. Let

$x^\prime + px = r$

Suppose for some unknown functions u(t) and v(t) that x = uv.

Then

$x^\prime = u^\prime v + u v^\prime$

Substituting into the differential equation,

$u^\prime v + u v^\prime + puv = r$

Now, the most important step: Since the differential equation is linear we can split this into two independent equations and write

$u^\prime v + puv = 0$
$u v^\prime = r$

Since v is not zero, the top equation becomes

$u^\prime + pu = 0$

The solution of this is

$u = e^{ - \int p dt }$

Substituting into the second equation

$v = \int r e^{ \int p dt } + C$

Since x = uv, for aribitrary constant C

$x =e^{ - \int p dt } \left( \int r e^{ \int p dt } + C \right)$

#### First order differential equation with constant coefficients

As an illustrative example, consider a first order differential equation with constant coefficients:

$a\frac{dx}{dt} + bx = Af(t).$

This equation is particularly relevant to first order systems such as RC circuits, mass-damper systems.

After nondimensionalization, the equation becomes

$\frac{d \chi}{d \tau} + \chi = F(\tau).$

In this case, p(t) = r(t) = 1.

Hence it's solution by inspection is

$\chi (\tau) = e^{-\tau} \left( \int F(\tau)e^{\tau} \, d\tau + C \right).$

### Linear PDEs

The theory of linear partial differential equations may be said to begin with Lagrange (1779 to 1785). Monge (1809) treated ordinary and partial differential equations of the first and second order, uniting the theory to geometry, and introducing the notion of the "characteristic", the curve represented by F(z) = 0, which was investigated by Darboux, Levy, and Lie.

### First-order PDEs

Pfaff (1814, 1815) gave the first general method of integrating partial differential equations of the first order, of which Gauss (1815) gave an analysis. Cauchy (1819) gave a simpler method, attacking the subject from the analytical standpoint, but using the Monge characteristic . Cauchy also first stated the theorem (now called the Cauchy-Kovaleskaya theorem ) that every analytic differential equation defines an analytic function, expressible by means of a convergent series.

Jacobi (1827) also gave an analysis of Pfaff's method, besides developing an original one (1836) which Clebsch published (1862). Clebsch's own method appeared in 1866, and others are due to Boole (1859), Korkine (1869), and A. Mayer (1872). Pfaff's problem (on total differential equations) was investigated by Natani (1859), Clebsch (1861, 1862), DuBois-Reymond (1869), Cayley, Baltzer, Frobenius, Morera, Darboux, and Lie.

The next great improvement in the theory of partial differential equations of the first order was made by Lie (1872), who placed the whole subject on a solid foundation. After about 1870, Darboux, Kovalevsky, Méray, Mansion, Graindorge, and Imschenetsky became prominent in this line. The theory of partial differential equations of the second and higher orders, beginning with Laplace and Monge, was notably advanced by Ampère (1840).

The integration of partial differential equations with three or more variables was the object of elaborate investigations by Lagrange, and his name became connected with certain subsidiary equations. It was he and Charpit who originated one of the methods for integrating the general equation with two variables; a method which now bears Charpit's name.

### Singular solutions

The theory of singular solutions of ordinary and partial differential equations was a subject of research from the time of Leibniz, but only since the middle of the nineteenth century did it receive special attention. A valuable but little-known work on the subject is that of Houtain (1854). Darboux (starting in 1873) was a leader in the theory, and in the geometric interpretation of these solutions he opened a field which was worked by various writers, notably Casorati and Cayley. To the latter is due (1872) the theory of singular solutions of differential equations of the first order as accepted circa 1900.

### Reduction to quadratures

The primitive attempt in dealing with differential equations had in view a reduction to quadratures. As it had been the hope of eighteenth-century algebraists to find a method for solving the general equation of the nth degree, so it was the hope of analysts to find a general method for integrating any differential equation. Gauss (1799) showed, however, that the differential equation meets its limitations very soon unless complex numbers are introduced. Hence analysts began to substitute the study of functions, thus opening a new and fertile field. Cauchy was the first to appreciate the importance of this view. Thereafter the real question was to be, not whether a solution is possible by means of known functions or their integrals, but whether a given differential equation suffices for the definition of a function of the independent variable or variables, and if so, what are the characteristic properties of this function.

### The Fuchsian theory

Two memoirs by Fuchs (Crelle, 1866, 1868), inspired a novel approach, subsequently elaborated by Thomé and Frobenius. Collet was a prominent contributor beginning in 1869, although his method for integrating a non-linear system was communicated to Bertrand in 1868. Clebsch (1873) attacked the theory along lines parallel to those followed in his theory of Abelian integrals. As the latter can be classified according to the properties of the fundamental curve which remains unchanged under a rational transformation, so Clebsch proposed to classify the transcendent functions defined by the differential equations according to the invariant properties of the corresponding surfaces f = 0 under rational one-to-one transformations.

## Lie's theory

From 1870 Lie's work put the theory of differential equations on a more satisfactory foundation. He showed that the integration theories of the older mathematicians can, by the introduction of what are now called Lie groups, be referred to a common source; and that ordinary differential equations which admit the same infinitesimal transformations present comparable difficulties of integration. He also emphasized the subject of transformations of contact (Berührungstransformationen).

## See also

03-10-2013 05:06:04
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 70, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9158939123153687, "perplexity_flag": "middle"}