🇮🇳 GATE Mathematics · subject
GATE Mathematics Ordinary Differential Equations Syllabus
The Ordinary Differential Equations syllabus for GATE Mathematics in full: 11 chapters and 6 topics, every one listed below, plus 50 Ordinary Differential Equations flashcards with answers.
Ordinary Differential Equations syllabus: all 11 chapters
Expand any chapter to see its topics and sub-topics.
-
First Order Ordinary Differential Equations
1 topic- Existence and Uniqueness Theorems for Initial Value Problems
-
Linear Ordinary Differential Equations of Higher Order with Constant Coefficients
overviewNo separate topics listed for this chapter.
-
Second Order Linear Ordinary Differential Equations with Variable Coefficients
overviewNo separate topics listed for this chapter.
-
Cauchy-Euler Equation
overviewNo separate topics listed for this chapter.
-
Method of Laplace Transforms for Solving Ordinary Differential Equations
overviewNo separate topics listed for this chapter.
-
Series Solutions
2 topics- Power Series
- Frobenius Method
-
Legendre and Bessel Functions and Their Orthogonal Properties
overviewNo separate topics listed for this chapter.
-
Systems of Linear First Order Ordinary Differential Equations
overviewNo separate topics listed for this chapter.
-
Sturm's Oscillation and Separation Theorems
overviewNo separate topics listed for this chapter.
-
Sturm-Liouville Eigenvalue Problems
overviewNo separate topics listed for this chapter.
-
Planar Autonomous Systems of Ordinary Differential Equations
3 topics- Stability of Stationary Points for Linear Systems with Constant Coefficients
- Linearized Stability
- Lyapunov Functions
GATE Mathematics Ordinary Differential Equations flashcards — 50 questions with answers
State the Picard-Lindelöf (Existence and Uniqueness) Theorem for the IVP $y' = f(x,y),\ y(x_0)=y_0$.
If $f$ is continuous on a rectangle $R$ containing $(x_0,y_0)$ and satisfies a Lipschitz condition in $y$ on $R$, then there exists $h>0$ such that the IVP has a unique solution $y(x)$ on $[x_0-h,\ x_0+h]$.
Define a Lipschitz condition in $y$ for a function $f(x,y)$ on a region $R$.
There exists a constant $L>0$ (the Lipschitz constant) such that $$|f(x,y_1)-f(x,y_2)|\leq L\,|y_1-y_2|$$ for all $(x,y_1),(x,y_2)\in R$.
What simple sufficient condition guarantees that $f(x,y)$ satisfies a Lipschitz condition in $y$ on a convex region?
If $\frac{\partial f}{\partial y}$ exists and is continuous (bounded) on the region, then $f$ is Lipschitz in $y$, with $L=\sup\left|\frac{\partial f}{\partial y}\right|$.
Which theorem guarantees existence (but not uniqueness) of a solution to $y'=f(x,y),\ y(x_0)=y_0$ using only continuity of $f$?
Peano's Existence Theorem: if $f$ is continuous on a neighborhood of $(x_0,y_0)$, then at least one solution exists locally, but it need not be unique.
Give the classic example of an IVP that has a solution but not a unique one, and explain why.
$y'=y^{1/3},\ y(0)=0$. Solutions include $y\equiv 0$ and $y=\left(\tfrac{2}{3}x\right)^{3/2}$. $f(y)=y^{1/3}$ is continuous but not Lipschitz at $y=0$ since $\frac{\partial f}{\partial y}\to\infty$ there, so uniqueness fails.
What is the Picard iteration (successive approximation) scheme for solving $y'=f(x,y),\ y(x_0)=y_0$?
$$y_{n+1}(x)=y_0+\int_{x_0}^{x} f\big(t,\,y_n(t)\big)\,dt,\qquad y_0(x)=y_0,$$ which converges to the unique solution under the Lipschitz hypothesis.
The integral equation equivalent to the IVP $y'=f(x,y),\ y(x_0)=y_0$ is what?
$$y(x)=y_0+\int_{x_0}^{x} f\big(t,y(t)\big)\,dt.$$ A continuous solution of this integral equation is equivalent to a solution of the IVP.
State the existence-uniqueness theorem for a first-order linear ODE $y'+p(x)y=q(x),\ y(x_0)=y_0$.
If $p(x)$ and $q(x)$ are continuous on an interval $I$ containing $x_0$, then the IVP has a unique solution defined on all of $I$ (global, not just local).
Does the Lipschitz condition guarantee global existence of the solution on the whole interval? Explain.
No. It guarantees only local existence and uniqueness. Solutions may blow up in finite time, e.g. $y'=y^{2},\ y(0)=1$ gives $y=\frac{1}{1-x}$, which escapes at $x=1$ despite $f$ being smooth/Lipschitz locally.
Define an ordinary point of the linear ODE $y''+P(x)y'+Q(x)y=0$.
A point $x_0$ is an ordinary point if both $P(x)$ and $Q(x)$ are analytic at $x_0$ (i.e., have convergent power series expansions about $x_0$).
What does the power series method guarantee about solutions near an ordinary point $x_0$?
There exist two linearly independent solutions of the form $y=\sum_{n=0}^{\infty} a_n (x-x_0)^n$, each analytic and convergent at least in the largest interval where $P$ and $Q$ are analytic.
Define a singular point of $y''+P(x)y'+Q(x)y=0$.
A point $x_0$ where $P(x)$ or $Q(x)$ fails to be analytic (i.e., is not analytic at $x_0$).
Distinguish a regular singular point from an irregular singular point for $y''+P(x)y'+Q(x)y=0$.
A singular point $x_0$ is regular if both $(x-x_0)P(x)$ and $(x-x_0)^2 Q(x)$ are analytic at $x_0$. If either fails to be analytic, $x_0$ is an irregular singular point.
In writing $y''+P(x)y'+Q(x)y=0$ in standard form, how do you obtain $P$ and $Q$ from $a_2(x)y''+a_1(x)y'+a_0(x)y=0$?
Divide by the leading coefficient: $P(x)=\dfrac{a_1(x)}{a_2(x)}$ and $Q(x)=\dfrac{a_0(x)}{a_2(x)}$. Singular points typically occur where $a_2(x)=0$.
Outline the basic process of solving an ODE by the power series method at an ordinary point.
Assume $y=\sum a_n x^n$; differentiate term by term for $y',y''$; substitute into the ODE; shift indices so all sums have the same power of $x$; collect coefficients and set each to zero to get a recurrence relation; solve for $a_n$ in terms of $a_0,a_1$.
For Legendre's equation $(1-x^2)y''-2xy'+n(n+1)y=0$, where are the singular points?
At $x=\pm 1$, where the leading coefficient $1-x^2$ vanishes. $x=0$ is an ordinary point, so power series solutions about $0$ converge for $|x|<1$.
State the form of the solution assumed in the Frobenius method about a regular singular point $x_0=0$.
$$y=x^{r}\sum_{n=0}^{\infty} a_n x^{n}=\sum_{n=0}^{\infty} a_n x^{n+r},\qquad a_0\neq 0,$$ where the exponent $r$ is to be determined.
How is the indicial equation obtained in the Frobenius method, and what does it determine?
Substitute the Frobenius series into the ODE and equate the coefficient of the lowest power $x^{r}$ (the $a_0$ term) to zero. This gives the indicial equation, a quadratic in $r$ whose roots $r_1,r_2$ are the exponents at the singularity.
For a regular singular point at $0$ with $p_0=\lim_{x\to0}xP(x)$ and $q_0=\lim_{x\to0}x^2Q(x)$, write the indicial equation.
$$r(r-1)+p_0 r + q_0 = 0,\quad\text{i.e.}\quad r^2+(p_0-1)r+q_0=0.$$
In the Frobenius method, what is the form of the two solutions when the indicial roots differ by a non-integer ($r_1-r_2\notin\mathbb{Z}$)?
Two independent Frobenius series: $$y_1=x^{r_1}\sum_{n\geq0} a_n x^n,\qquad y_2=x^{r_2}\sum_{n\geq0} b_n x^n.$$
Show the other 30 Ordinary Differential Equations flashcards
In the Frobenius method, what is the form of the solutions when the indicial roots are equal, $r_1=r_2=r$?
$$y_1=x^{r}\sum_{n\geq0} a_n x^n,\qquad y_2=y_1\ln x + x^{r}\sum_{n\geq1} b_n x^n.$$ A logarithmic term always appears in the second solution.
In the Frobenius method, what is the form of the solutions when the indicial roots differ by a positive integer, $r_1-r_2=N\in\mathbb{Z}^+$?
$$y_1=x^{r_1}\sum_{n\geq0} a_n x^n,\qquad y_2=C\,y_1\ln x + x^{r_2}\sum_{n\geq0} b_n x^n,$$ where the constant $C$ may be zero (no log term) or nonzero, depending on the equation.
Which root of the indicial equation is used first to guarantee a Frobenius series solution always exists?
The larger root $r_1$ (with $r_1\geq r_2$ for real roots) always yields a Frobenius series solution $y_1=x^{r_1}\sum a_n x^n$.
What is Bessel's equation, and what determines whether its solutions involve a logarithm via Frobenius?
$$x^2y''+xy'+(x^2-\nu^2)y=0.$$ Indicial roots are $r=\pm\nu$. They differ by $2\nu$; when $2\nu$ is a non-negative integer (e.g. integer order $\nu$), the second solution $Y_\nu$ involves a logarithmic term.
Write the general homogeneous linear system with constant coefficients whose stability is studied.
$$\dot{\mathbf{x}}=A\mathbf{x},\qquad \mathbf{x}\in\mathbb{R}^n,$$ where $A$ is a constant $n\times n$ matrix; the origin $\mathbf{x}=\mathbf{0}$ is the stationary (equilibrium) point.
State the eigenvalue criterion for asymptotic stability of the origin of $\dot{\mathbf{x}}=A\mathbf{x}$.
The origin is asymptotically stable if and only if every eigenvalue $\lambda$ of $A$ has negative real part, $\operatorname{Re}(\lambda)<0$.
State the eigenvalue criterion for (Lyapunov) stability of the origin of $\dot{\mathbf{x}}=A\mathbf{x}$.
The origin is stable (in the sense of Lyapunov) iff all eigenvalues satisfy $\operatorname{Re}(\lambda)\leq 0$ AND every eigenvalue with $\operatorname{Re}(\lambda)=0$ is semisimple (its algebraic and geometric multiplicities are equal, i.e. no defective Jordan blocks).
State the eigenvalue criterion for instability of the origin of $\dot{\mathbf{x}}=A\mathbf{x}$.
The origin is unstable if at least one eigenvalue has positive real part $\operatorname{Re}(\lambda)>0$, or if a purely imaginary/zero eigenvalue is defective (algebraic multiplicity exceeds geometric multiplicity).
For the 2D system $\dot{\mathbf{x}}=A\mathbf{x}$, classify the equilibrium when $A$ has two real eigenvalues of the same sign.
A node. Both negative $\Rightarrow$ stable node (sink); both positive $\Rightarrow$ unstable node (source). Trajectories approach/leave the origin tangent to the slow (smaller magnitude) eigendirection.
For the 2D system $\dot{\mathbf{x}}=A\mathbf{x}$, classify the equilibrium when $A$ has two real eigenvalues of opposite signs.
A saddle point, which is always unstable. Trajectories approach along the stable eigendirection (negative eigenvalue) and depart along the unstable eigendirection (positive eigenvalue).
For the 2D system $\dot{\mathbf{x}}=A\mathbf{x}$, classify the equilibrium when $A$ has complex eigenvalues $\alpha\pm i\beta$ with $\alpha\neq0$.
A spiral (focus). $\alpha<0\Rightarrow$ stable spiral (trajectories spiral inward); $\alpha>0\Rightarrow$ unstable spiral (spiral outward). $\beta$ governs the rotation rate.
For the 2D system $\dot{\mathbf{x}}=A\mathbf{x}$, classify the equilibrium when $A$ has purely imaginary eigenvalues $\pm i\beta$.
A center: trajectories are closed ellipses around the origin. It is stable (Lyapunov) but not asymptotically stable.
Using trace $T=\operatorname{tr}A$ and determinant $D=\det A$ of a $2\times2$ matrix, give the conditions for the origin to be asymptotically stable.
Asymptotically stable iff $T=\lambda_1+\lambda_2<0$ and $D=\lambda_1\lambda_2>0$ (both eigenvalues have negative real part).
Using $T=\operatorname{tr}A$, $D=\det A$, and discriminant $\Delta=T^2-4D$, how do you distinguish nodes from spirals in 2D?
If $D>0$: $\Delta=T^2-4D>0$ gives a node (real eigenvalues), $\Delta<0$ gives a spiral (complex eigenvalues), and $\Delta=0$ gives a degenerate/improper node. If $D<0$, it is a saddle regardless of $T$.
What does $\det A<0$ tell you immediately about the equilibrium of a planar linear system?
It is a saddle point (eigenvalues are real with opposite signs), and therefore unstable.
Define a stable node versus an unstable node in terms of eigenvalues for a planar system.
Stable (improper/proper) node: both eigenvalues real and negative, $\lambda_2\leq\lambda_1<0$. Unstable node: both real and positive, $0<\lambda_1\leq\lambda_2$. Trajectories converge to / diverge from origin without spiraling.
State the general nonlinear autonomous system whose equilibrium stability is studied by linearization.
$$\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x}),\qquad \mathbf{f}(\mathbf{x}^*)=\mathbf{0},$$ where $\mathbf{x}^*$ is an equilibrium (stationary) point.
What is the Jacobian (linearization) matrix used to analyze stability of an equilibrium $\mathbf{x}^*$ of $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$?
$$J=D\mathbf{f}(\mathbf{x}^*)=\left[\frac{\partial f_i}{\partial x_j}\right]_{\mathbf{x}=\mathbf{x}^*}.$$ The linearized system is $\dot{\mathbf{u}}=J\mathbf{u}$ with $\mathbf{u}=\mathbf{x}-\mathbf{x}^*$.
State the Linearized Stability (Hartman-Grobman based) theorem for a hyperbolic equilibrium.
If all eigenvalues of $J=D\mathbf{f}(\mathbf{x}^*)$ have nonzero real part (the equilibrium is hyperbolic), then the nonlinear system's stability matches the linear one: all $\operatorname{Re}\lambda<0\Rightarrow$ asymptotically stable; some $\operatorname{Re}\lambda>0\Rightarrow$ unstable. Near $\mathbf{x}^*$ the nonlinear and linear phase portraits are topologically conjugate.
When does linearization FAIL to determine the stability of an equilibrium?
When the equilibrium is non-hyperbolic, i.e. the Jacobian has at least one eigenvalue with zero real part ($\operatorname{Re}\lambda=0$, e.g. a center case). Then higher-order/nonlinear terms decide stability, and a Lyapunov function is needed.
Define a Lyapunov-stable equilibrium $\mathbf{x}^*$ of $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$.
$\mathbf{x}^*$ is stable if for every $\varepsilon>0$ there exists $\delta>0$ such that $\|\mathbf{x}(0)-\mathbf{x}^*\|<\delta$ implies $\|\mathbf{x}(t)-\mathbf{x}^*\|<\varepsilon$ for all $t\geq0$. It is asymptotically stable if additionally $\mathbf{x}(t)\to\mathbf{x}^*$ as $t\to\infty$.
Define a Lyapunov function $V(\mathbf{x})$ for an equilibrium at the origin of $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$.
A continuously differentiable function $V$ on a neighborhood of $\mathbf{0}$ with $V(\mathbf{0})=0$ and $V(\mathbf{x})>0$ for $\mathbf{x}\neq\mathbf{0}$ (positive definite), whose orbital derivative $\dot{V}$ satisfies a sign condition along trajectories.
How is the orbital derivative $\dot{V}$ of a Lyapunov function computed along solutions of $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$?
$$\dot{V}(\mathbf{x})=\nabla V(\mathbf{x})\cdot \mathbf{f}(\mathbf{x})=\sum_{i=1}^{n}\frac{\partial V}{\partial x_i}\,f_i(\mathbf{x}).$$ No need to solve the ODE; it is evaluated using the vector field directly.
State Lyapunov's theorem on (simple) stability via a Lyapunov function.
If there is a positive definite $V$ with $\dot{V}(\mathbf{x})\leq 0$ (negative semidefinite) in a neighborhood of the origin, then the origin is stable (in the sense of Lyapunov).
State Lyapunov's theorem on asymptotic stability.
If there is a positive definite $V$ with $\dot{V}(\mathbf{x})<0$ for all $\mathbf{x}\neq\mathbf{0}$ in a neighborhood (negative definite), then the origin is asymptotically stable.
State Chetaev's / Lyapunov's instability theorem.
If there is a $C^1$ function $V$ with $V(\mathbf{0})=0$ that takes positive values arbitrarily close to the origin and has $\dot{V}>0$ (positive definite) there, then the origin is unstable.
What additional condition (LaSalle's invariance principle) lets $\dot{V}\leq0$ still imply asymptotic stability?
If $\dot{V}\leq0$ and the only complete trajectory contained in the set $\{\dot{V}=0\}$ is the equilibrium itself, then the origin is asymptotically stable.
For a linear system $\dot{\mathbf{x}}=A\mathbf{x}$, what quadratic form is commonly used as a Lyapunov function, and what equation must $P$ satisfy?
Use $V(\mathbf{x})=\mathbf{x}^T P\mathbf{x}$ with $P$ symmetric positive definite. Then $\dot{V}=\mathbf{x}^T(A^TP+PA)\mathbf{x}$. Stability follows if $P$ solves the Lyapunov equation $$A^TP+PA=-Q$$ for some positive definite $Q$, which has a positive definite solution $P$ iff $A$ is a stability (Hurwitz) matrix.
Compare the strengths of the eigenvalue (linearization) method versus the Lyapunov function method for stability.
Eigenvalue/linearization: easy and definitive for hyperbolic equilibria, but fails when $\operatorname{Re}\lambda=0$ and is only local. Lyapunov functions: can handle non-hyperbolic cases and give global/large basin estimates, but there is no general recipe for constructing $V$, so it requires ingenuity.
For the undamped pendulum / center-type system, why is $V=$ total energy a useful Lyapunov function, and what does it show?
Energy $V$ is positive definite near the stable equilibrium and conserved, giving $\dot{V}=0$. By Lyapunov's stability theorem this proves the equilibrium is stable (a center), even though linearization gives purely imaginary eigenvalues and is inconclusive on its own.
GATE Mathematics Ordinary Differential Equations FAQ
What is in the GATE Mathematics Ordinary Differential Equations syllabus?
GATE Mathematics Ordinary Differential Equations is split into 11 chapters: First Order Ordinary Differential Equations, Linear Ordinary Differential Equations of Higher Order with Constant Coefficients, Second Order Linear Ordinary Differential Equations with Variable Coefficients, Cauchy-Euler Equation, Method of Laplace Transforms for Solving Ordinary Differential Equations, Series Solutions, Legendre and Bessel Functions and Their Orthogonal Properties, Systems of Linear First Order Ordinary Differential Equations, Sturm's Oscillation and Separation Theorems, Sturm-Liouville Eigenvalue Problems and Planar Autonomous Systems of Ordinary Differential Equations. Together they contain 6 topics.
How many chapters are in GATE Mathematics Ordinary Differential Equations?
11 chapters, containing 6 topics. The largest chapter is Planar Autonomous Systems of Ordinary Differential Equations, with 3 topics.
Are there flashcards for GATE Mathematics Ordinary Differential Equations?
Yes — a 50-card Ordinary Differential Equations deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.