MTH2003 DIFFFERENTIAL EQUATIONS Flashcards
DEFINITION: independent variable
in the function y(x), x is the independent variable
DEFINITION: dependent variable
in the function y(x), y is the dependent variable
DEFINITION: ordinary differential equation (ODE)
an equation that relates values of a function to its derivatives with
respect to one independent variable, where F(. . .) is a given function, and y(x) is the function to be
found, i.e. unknown function
DEFINITION: solution of an ODE
a function y = φ(x) is a solution of an ODE in an
interval I : {x : a < x < b} NOT= ∅, if its substitution into the ODE
produces an identity.
DEFINITION: partial differential equation (PDE)
an equation that relates values of a function to partial derivatives with
respect to more than one independent variable
DEFINITION: order of a differential equation
the order of
the highest-order derivative of the unknown function that appears
in it
DEFINITION: ODE in resolved form (standard form)
an equality of the form d^ny/dx^n = f(x, y, dy/dx, . . . , d^(n−1)y/dx^(n−1)) where f(x, y, . . .) is given, and y(x) is to be found
DEFINITION: right-hand side
the function f(x, y, . . )
DEFINITION: initial value problem (IVP) (also known as Cauchy problem or one-point boundary value problem with boundary conditions)
an ODE plus initial conditions (extra requirements on y(x))
DEFINITION: solution of the initial value problem
a function y = φ(x) is a solution of the initial
value problem
d^ny/dx^n = f (x, y, . . .), y(x0) = K0, . . .
d^(n−1)y/dx^(n−1)(x0) = Kn−1 in an interval
I : {x : a < x < b} NOT= ∅, such that x0 ∈ I,
if it is a solution of the ODE in that interval, and satisfies the
initial condition
DEFINITION: separable first-order ODE (ODE with separable variables)
an ODE right-hand side is of the special form dy/dx = f(x, y) = F(x) G(y(x))
DEFINITION: special solution
if G(y∗) = 0, then y(x) = y∗ is a special solution
ALGORITHM: test for separability
If f(x, y) = F(x)G(y) for all x, y, then f(a, b)f(c, d) ≡ f(a, d)f(c, b) for all a, b, c, d. if at least one combination of a, b, c, d violates the equality, this is a definite proof that f(x, y) is not separable (it is not possible to present it in the form F(x)G(y))
THEOREM: Peano’s existence theorem
consider the initial value problem
dy/dx = f(x, y),
y(x0) = K0,
and assume that there exists a rectangle R = (α, β) × (γ, δ) NOT= ∅,
such that
1◦ The initial condition is within this rectangle, (x0, K0) ∈ R.
2◦ The right-hand side f(x, y) is continuous for all (x, y) ∈ R.
-> Then there exists an interval of x values, I = (a, b), where x0 ∈ I,
such that initial value problem has at least one solution in
the interval I.
THEOREM: Picard’s existence and uniqueness theorem
Consider the initial value problem
dy/dx = f(x, y),
y(x0) = K0,
and assume that there exists a rectangle R = (α, β) × (γ, δ) NOT= ∅,
such that
1◦ The initial condition is within this rectangle, (x0, K0) ∈ R;
2◦ The right-hand side f(x, y) is continuous for all (x, y) ∈ R;
3◦ The partial derivative fy(x, y) is defined and continuous for
all (x, y) ∈ R.
_> Then there exists an interval of x values, I = (a, b), where x0 ∈ I,
such that initial value problem has a UNIQUE solution in the
interval I.
DEFINITION: integrating factor
h(x) = exp (integral(p(x))dx)
DEFINITION: derivative of a vector-function x(t)
dx/dt := lim[h→0] x(t + h) − x(t) / h
THEOREM: Picard’s existence and uniqueness theorem for systems
Consider the initial value problem consisting of the
ODE system and the initial conditions, and assume that
there exist such a box B in the R^N+1 = {(t, x1, . . . xN)} space,
defined by conditions B : α < t < β, α1 < x1 < β1, . . . , αN < xN <
βN, B NOT= ∅, such that
1◦ The point representing the initial conditions is inside the box,
(t0, K1 . . . KN) ∈ B,
2◦ The N right-hand sides fj(t, x1, . . . xN), j = 1, . . . , N are defined
and continuous for all (t, x) ∈ B,
3◦ The N × N partial derivatives ∂ fj(t, x1, . . . xN)/∂xk, j = 1 . . . N,
k = 1 . . . N are defined and continuous for all (t, x) ∈ B.
-> Then there exists an interval of t values, I = (a, b), containing
the initial point t0, that is t0 ∈ I, such that initial value problem has a unique solution in the interval I
DEFINITION: linear ODE system
a linear ODE system if all the righthand sides depend on all the unknowns x_k
linearly (the coefficients of the linear functions may depend on t)
THEOREM: Existence and uniqueness theorem for linear systems
If coefficients a_jk(t) and g_k(t), j = 1 . . . N, k = 1 . . . N
are continuous in an interval t ∈ (α, β), then for initial conditions such that t0 ∈ I, there exists an interval of t values, I = (a, b), containing the initial point t0, that is t0 ∈ I, such
that initial value problem has a unique solution in the interval I
DEFINTION: eigenvector and eigenvalue of matrix A
If A ∈ C^N×N is a N × N matrix and the column vector v ∈ CN satisfies
Av = λv, v NOT= 0, where λ ∈ C is a number,
then v is called an eigenvector of matrix A and λ is the eigenvalue
LEMMA: 2 If v is an eigenvector of A corresponding to eigenvalue λ,
then kv for any nonzero scalar k is also an eigenvector of A corresponding to the same λ.
Proof:
1◦ If v NOT= 0 and k NOT= 0, then kv NOT= 0
2◦ If Av = λv, then A(kv) = k(Av) = kλv = λ(kv)
That is, kv satisfies both requirements for an eigenvector.
DEFINITION: characteristic equation
det(A - λI) = 0
DEFINITION:
linear independent system of vectors
A system of m vectors x^(1), . . . x^(m) of the same dimensionality N is called linearly independent (LI), if the equality c1x^(1) + · · · + cmx^(m) = 0
is possible only if all c1 = · · · = cm = 0. If a system of vectors is
not linearly independent, it is called linearly dependent (LD).
THEOREM: linear independence of eigenvectors
Let v^1, . . . , v^m be eigenvectors, corresponding to eigenvalues λ1, . . . , λm, of matrix A ∈ C^N×N where 1 < m ≤ N and let all λj , j = 1, . . . , λm be different.
Then vectors v^1, . . . , v^m are linearly independent.
DEFINITION: generalised eigenvector (GEV) of m-th order
Let v be an eigenvector of A corresponding to eigenvalue.
Then a generalised eigenvector (GEV) of m-th order, m = 1, 2 . . . , is a vector v^(m)
satisfying:
Av^(m) = λv^(m) + v^(m−1), where v^(0) := v
DEFINTION: Jordan chain of GEV
The set of vectors (v^(0), . . . , v^(m)), is called a Jordan chain
DEFINITION: lead vector or generator of a Jordan chain in a GEV
The GEV v^(m) is called the lead vector or the generator of the chain.